{"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":"1e801429-4318-5fb3-943e-b3f44ee17aab","task_key":"default--test--10613","task_revision_id":"1","upstream_id":"10613","short_description":"How many trees are there on n (n > 1) labeled vertices with no vertices of…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['2n', '2^(n-1)', '1', '2', 'n + 1', '(n-1)!', 'n^2', '0', '3', 'n - 1']\",\"question\":\"How many trees are there on n (n > 1) labeled vertices with no vertices of degree 1 or 2?\",\"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":[]}