{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"omni-math","formal_name":"Omni-MATH","introduction":"Omni-MATH evaluates mathematical reasoning on Olympiad-level problems. Its official dataset contains 4,428 problems accompanied by domain and difficulty information.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","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":"11c8700a-d57f-59b5-9a48-6ff5d27e97e7","task_key":"test--11c8700a-d57f-59b5-9a48-6ff5d27e97e7","task_revision_id":"1","upstream_id":"","short_description":"[i]Superchess[/i] is played on on a $12 \\times 12$ board, and it uses…","config":"","split":"test","body":"{\"problem\":\"[i]Superchess[/i] is played on on a $12 \\\\times 12$ board, and it uses [i]superknights[/i], which move between opposite corner cells of any $3\\\\times4$ subboard. Is it possible for a [i]superknight[/i] to visit every other cell of a superchessboard exactly once and return to its starting cell ?\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}