{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mmlu","formal_name":"MMLU","introduction":"MMLU asks four-way multiple-choice questions across 57 subjects, from elementary material to professional-level examinations. Since 2020 it has been the most widely cited single reference point for general capability.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/test","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":"036955c8-d5ee-56ee-91c1-8177dcf30425","task_key":"all--test--036955c8-d5ee-56ee-91c1-8177dcf30425","task_revision_id":"1","upstream_id":"","short_description":"Let G = (V, E) be a connected, undirected graph, and let a and b be two distinct…","config":"all","split":"test","body":"{\"choices\":\"['Both P_1 and P_2 can be solved in polynomial time.', 'P_1 can be solved in polynomial time but P_2 is not known to be solvable in polynomial time.', 'P_1 is not known to be solvable in polynomial time but P_2 can be solved in polynomial time.', 'It is not known whether either P_1 or P_2 can be solved in polynomial time.']\",\"question\":\"Let G = (V, E) be a connected, undirected graph, and let a and b be two distinct vertices in V. Let P_1 be the problem of finding a shortest simple path between a and b, and let P_2 be the problem of finding a longest simple path between a and b. Which of the following statements about P_1 and P_2 is true?\",\"subject\":\"college_computer_science\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/test","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}