{"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":"8dedaa48-e7f9-593c-aa4a-5cbd2748073f","task_key":"default--test--10702","task_revision_id":"1","upstream_id":"10702","short_description":"Let a undirected graph G with edges E =…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['[0, 2, 3, 4, 7, 8, 10]', '[0, 1, 3, 4, 5, 8, 12]', '[1, 2, 3, 4, 5, 7, 8, 9]', '[0, 1, 2, 4, 7, 9]', '[0, 2, 3, 5, 8, 11]', '[1, 3, 4, 5, 8, 10]', '[0, 1, 2, 3, 4, 5, 8]', '[0, 1, 2, 3, 5, 6, 8, 9]', '[0, 1, 2, 3, 8, 9]', '[1, 2, 3, 4, 6, 8, 9, 12]']\",\"question\":\"Let a undirected graph G with edges E = {<0,2>,<1,4>,<9,6>,<8,12>,<2,4>,<1,3>,<1,5>,<12,1>,<8,1>,<5,9>,<0,10>,<5,2>,<0,8>,<3,4>,<3,11>,<7,1>,<2,1>,<0,12>,<1,0>,<7,8>}, which <A,B> represent Node A is connected to Node B. What is the minimum vertex cover of G? Represent the vertex cover in a list of ascending order.\",\"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":[]}