{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu-pro","formal_name":"MMLU-Pro","introduction":"MMLU-Pro rebuilds MMLU with ten answer options instead of four and removes items that no longer separate models. Questions span fourteen academic and professional subjects.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"1910365f-d274-579b-9455-9b9193a53689","task_key":"default--test--9009","task_revision_id":"1","upstream_id":"9009","short_description":"S(n) is a statement about positive integers n such that whenever S(k) is true,…","config":"default","split":"test","body":"{\"category\":\"math\",\"options\":\"['S(n) is not true for any n = n0', 'S(n) is not true for any n <= n0', 'S(n) is not true for any n > n0', 'S(n) is not true for any n < n0', 'S(n0 - 2) is not true.', 'S(n) is not true for any n >= n0', 'S(n) is not true for any n != n0', 'S(n0 + 2) is not true.', 'S(n0 - 1) is not true.', 'S(n0 + 1) is not true.']\",\"question\":\"S(n) is a statement about positive integers n such that whenever S(k) is true, S(k + 1) must also be true. Furthermore, there exists some positive integer n0 such that S(n0) is not true. Of the following, which is the strongest conclusion that can be drawn?\",\"src\":\"ori_mmlu-college_mathematics\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/TIGER-Lab/MMLU-Pro","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}