{"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":"e504c8ea-15a0-5be9-ad2f-9592f6a616ec","task_key":"default--test--10644","task_revision_id":"1","upstream_id":"10644","short_description":"Let $X_0, X_1, X_2, \\ldots$ be drawn i.i.d. from $p(x)$, and…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['99.0', '101.0', '125.0', '150.0', '50.0', '25.0', '175.0', '100.0', '200.0', '75.0']\",\"question\":\"Let $X_0, X_1, X_2, \\\\ldots$ be drawn i.i.d. from $p(x)$, and $x\\\\in\\\\{1,2,3,\\\\ldots,100\\\\}. Let $N$ be the waiting time to the next occurrence of $X_0$. Compute $E(N)$.\",\"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":[]}