{"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":"e11058f6-0998-5f62-b459-8163b3fd7617","task_key":"default--test--10414","task_revision_id":"1","upstream_id":"10414","short_description":"Let G = (V, E) be a finite directed acyclic graph with |E| > 0. Which of the…","config":"default","split":"test","body":"{\"category\":\"computer science\",\"options\":\"['I and III only', 'None of the above', 'I and II only', 'II and III only', 'I, II, and a vertex with one outgoing edge', 'I, II, and a vertex with one incoming edge', 'All of the above (I, II, III)', 'II only', 'I only', 'III only']\",\"question\":\"Let G = (V, E) be a finite directed acyclic graph with |E| > 0. Which of the following must be true?\\nI. G has a vertex with no incoming edge.\\nII. G has a vertex with no outgoing edge.\\nIII. G has an isolated vertex, that is, one with neither an incoming edge nor an outgoing edge.\",\"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":[]}