{"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":"e3ec06ee-69dd-54dd-93de-e157c662105b","task_key":"default--test--11842","task_revision_id":"1","upstream_id":"11842","short_description":"Find a recursion equation satisfying y [n] where y [n] is the sum of the squares…","config":"default","split":"test","body":"{\"category\":\"engineering\",\"options\":\"['y [n-1] = y [n] + n^2; n \\\\\\\\geq 1 where y [0] = 0', 'y [n] = (n(n+1)(2n+1))/6; n \\\\\\\\geq 0', 'y [n-1] = y [n] * n^2; n \\\\\\\\geq 1 where y [0] = 0', 'y [n-1] = y [n] / n^2; n \\\\\\\\geq 1 where y [0] = 0', 'y [n+1] = 2y [n] + (n+1)^2; n \\\\\\\\geq 0 where y [0] = 0', 'y [n-1] = y [n] - n^2; n \\\\\\\\geq 1 where y [0] = 0', 'y [n] = y [n-1] + 2n - 1; n \\\\\\\\geq 1 where y [0] = 0', 'y [n+1] = y [n] - (n+1)^2; n \\\\\\\\geq 0 where y [0] = 0']\",\"question\":\"Find a recursion equation satisfying y [n] where y [n] is the sum of the squares of all integers from 0 to n.\",\"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":[]}