{"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":"0e52197f-14a2-56aa-a0a7-0b5bd18e5a27","task_key":"default--test--12008","task_revision_id":"1","upstream_id":"12008","short_description":"Find recursively the sequence y [n] such that y [1] = 3, y [0] = 2, and y [n] -…","config":"default","split":"test","body":"{\"category\":\"engineering\",\"options\":\"['y [n] = 5, 9, 15,...; n >= 2', 'y [n] = 5, 9, 17,...; n >= 2', 'y [n] = 2, 5, 9,...; n >= 2', 'y [n] = 3, 5, 9,...; n >= 2']\",\"question\":\"Find recursively the sequence y [n] such that y [1] = 3, y [0] = 2, and y [n] - 3y [n - 1] + 2y [n - 2] = 0 ; n \\\\geq 2.\",\"src\":\"stemez-ElectricCircuits\"}","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":[]}