{"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":"2257ee43-d442-59fe-ae85-39161e489ef6","task_key":"default--test--10593","task_revision_id":"1","upstream_id":"10593","short_description":"Let k >= 2. Let L be the set of strings in {0, 1}^* such that x \\in L if and…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['k - 2', '2k', 'k^2', 'k log k', 'k^2 + 2', '2k + 1', '2^k', 'k + 2', 'k^3', 'k + log k']\",\"question\":\"Let k >= 2. Let L be the set of strings in {0, 1}^* such that x \\\\in L if and only if the number of 0's in x is divisible by k and the number of 1's in x is odd. The minimum number of states in a deterministic finite automaton (DFA) that recognizes L is\",\"src\":\"ori_mmlu-college_computer_science\"}","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":[]}