{"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":"6b04dde2-f45c-5361-a4ae-03fee59570b6","task_key":"default--test--10755","task_revision_id":"1","upstream_id":"10755","short_description":"A \"strictly binary tree\" is a binary tree in which every node that is not a leaf…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['h <= log2(N)', 'h = log2(cN)', 'h > c log2(N)', 'h < 1/c * log2(N)', 'h < c log2(N)', 'h > log2(N)', 'h <= c log2(N)', 'h > log2(cN)', 'h = c log2(N)', 'h = 1/c * log2(N)']\",\"question\":\"A \\\"strictly binary tree\\\" is a binary tree in which every node that is not a leaf has two children. Suppose that for a class of strictly binary trees there exists c > 0 such that, for any tree in the class, the ratio of the lengths of any two root-to-leaf paths is bounded above by c. Which of the following best characterizes the height h of any tree in this class, where N is the number of nodes in the tree and N > 1 ?\",\"src\":\"ori_mmlu-college_computer_science\"}","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":[]}