{"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":"234f0b97-f7eb-50f8-ab49-a3e059134b6b","task_key":"default--test--10747","task_revision_id":"1","upstream_id":"10747","short_description":"What is the maximum number of entries that can be stored in a binary tree if the…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['2^(2N) - 1, (2N - 1) / (2^(2N) - 1)', 'N^3, (log(N) + 1) / N', '2^(N-1), (2N) / (2^(N-1))', '2^(N+1) - 1, N / (2^(N+1) - 1)', '2^N, N / (2^N)', '2^N + 1, N / (2^N - 1) - 1', '3^N - 1, log(N) / (3^N - 1)', 'N!, (N^2) / (N!)', '2^N - 1, N - 1 + (N / (2^N - 1))', 'N^2 - 1, N + 1 - (N / (2^N - 1))']\",\"question\":\"What is the maximum number of entries that can be stored in a binary tree if the longest path from the root to any node does not exceed N? Find the general equation for the aver-age search time for any entry in a tree with N levels.\",\"src\":\"stemez-ComputerScience\"}","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":[]}