{"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":"8bfd38dc-cc62-53e9-a148-3b6e4a1b4f25","task_key":"default--test--8615","task_revision_id":"1","upstream_id":"8615","short_description":"Let $F_0(x)=log(x)$. For $n\\geq 0$ and $x>0$, let $F_{n+1}(x)=\\int_0^x…","config":"default","split":"test","body":"{\"category\":\"math\",\"options\":\"['π (Pi)', '1.0', '1/n', '2.0', '-1.0', \\\"e (Euler's number)\\\", \\\"-e (Negative Euler's number)\\\", \\\"e^-1 (Inverse of Euler's number)\\\", '0.0', 'Infinity']\",\"question\":\"Let $F_0(x)=log(x)$. For $n\\\\geq 0$ and $x>0$, let $F_{n+1}(x)=\\\\int_0^x F_n(t)dt$. Evaluate $\\\\lim _{n \\\\rightarrow \\\\infty} (n! F_n(1))/(log(n))$.\",\"src\":\"theoremQA-Math\"}","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":[]}