{"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":"e485e20c-04ff-51cf-bace-d79394d36ca8","task_key":"default--test--10769","task_revision_id":"1","upstream_id":"10769","short_description":"Let a undirected graph G with edges E =…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['[1, 2, 7, 8, 10, 9, 11, 14]', '[1, 2, 5, 10, 6, 9, 11, 14]', '[1, 3, 0, 4, 2, 6, 9, 11, 14]', '[1, 2, 5, 8, 10, 14]', '[1, 2, 7, 6, 8, 10, 9, 11, 14]', '[1, 3, 4, 0, 2, 5, 8, 10, 9, 11, 14]', '[1, 0, 3, 2, 5, 8, 9, 11, 14]', '[1, 3, 4, 0, 2, 6, 9, 11, 14]', '[1, 0, 4, 3, 2, 7, 10, 9, 11, 14]', '[1, 2, 6, 9, 11, 14]']\",\"question\":\"Let a undirected graph G with edges E = {<0,1>,<1,3>,<0,3>,<3,4>,<0,4>,<1,2>,<2,5>,<2,7>,<2,6>,<6,7>,<6,10>,<5,8>,<10,9>,<5,10>,<6,8>,<7,8>,<6,9>,<7,10>,<8,10>,<9,11>,<9,12>,<9,13>,<13,12>,<13,11>,<11,14>}, which <A,B> represent Node A is connected to Node B. What is the shortest path from node 1 to node 14? 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":[]}