{"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":"3152d2e2-85ee-52cd-9657-0b090b55b3bb","task_key":"default--test--10536","task_revision_id":"1","upstream_id":"10536","short_description":"Let a undirected graph G with edges E =…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['[0, 2, 3, 4, 5]', '[0, 2, 3, 5]', '[0, 1, 2, 3, 4, 5]', '[0, 1, 2, 4, 5]', '[0, 2, 4, 5]', '[0, 1, 3, 5]', '[0, 1, 4, 5]', '[0, 3, 5]', '[0, 3, 2, 4, 5]', '[0, 1, 2, 3, 5]']\",\"question\":\"Let a undirected graph G with edges E = {<0,1>,<0,2>,<0,3>,<3,5>,<2,3>,<2,4>,<4,5>}, which <A,B> represent Node A is connected to Node B. What is the shortest path from node 0 to node 5? Represent the path as a list.\",\"src\":\"theoremQA-EECS\"}","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":[]}