{"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":"14069c96-6c58-52d7-b2c0-e6e613b52e6e","task_key":"default--test--10819","task_revision_id":"1","upstream_id":"10819","short_description":"Select the best translation into predicate logic. All children go to some…","config":"default","split":"test","body":"{\"category\":\"philosophy\",\"options\":\"['(∀x)(∃y)[(Cx • Sy) • Gxy)', '(∀x)[Cx • (∃y)(Sy ⊃ Gxy)]', '(∀x)[Sx ⊃ (∃y)(Cy • Gxy)]', '(∀x)(∃y)[(Sx • Cy) • Gxy]', '(∀x)(∃y)[(Cx ⊃ Sy) • Gxy]', '(∀x)(∃y)[(Cx • Sy) ⊃ Gxy]', '(∀x)[Sx ⊃ (∃y)(Cy ⊃ Gxy)]', '(∀x)[Sx • (∃y)(Cy • Gxy)]', '(∃x)(∀y)[(Cx • Sy) • Gxy]', '(∀x)[Cx ⊃ (∃y)(Sy • Gxy)]']\",\"question\":\" Select the best translation into predicate logic. All children go to some school. (Cx: x is a child; Sx: x is a school; Gxy: x goes to y)\",\"src\":\"ori_mmlu-formal_logic\"}","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":[]}