{"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":"53db7eaa-f0a5-5d92-95d6-e27dc378e623","task_key":"default--test--7788","task_revision_id":"1","upstream_id":"7788","short_description":"Determine whether the polynomial in Z[x] satisfies an Eisenstein criterion for…","config":"default","split":"test","body":"{\"category\":\"math\",\"options\":\"['Yes, with p=4.', 'No, because the polynomial is reducible.', 'Yes, with p=1.', 'No, because the polynomial does not satisfy the Eisenstein criterion.', 'No.', 'Yes, with p=12.', 'Yes, with p=3.', 'Yes, with p=5.', 'Yes, with p=6.', 'Yes, with p=2.']\",\"question\":\"Determine whether the polynomial in Z[x] satisfies an Eisenstein criterion for irreducibility over Q. x^2 - 12\",\"src\":\"ori_mmlu-abstract_algebra\"}","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":[]}