{"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":"9b8a78f9-897e-53be-a4d0-01e3f419a1a4","task_key":"default--test--7862","task_revision_id":"1","upstream_id":"7862","short_description":"What is the smallest number of vertices in a graph that guarantees the existence…","config":"default","split":"test","body":"{\"category\":\"math\",\"options\":\"['6', '4', '5', '10', '7', '3', '2', '1', '9', '8']\",\"question\":\"What is the smallest number of vertices in a graph that guarantees the existence of a clique of size 3 or an independent set of size 2?\",\"src\":\"theoremQA-Math\"}","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":[]}