{"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":"f769f633-ea66-5c92-ba22-86151917cc2a","task_key":"test--f769f633-ea66-5c92-ba22-86151917cc2a","task_revision_id":"1","upstream_id":"","short_description":"Let $A=\\{V, W, X, Y, Z, v, w, x, y, z\\}$. Find the number of subsets of the…","config":"","split":"test","body":"{\"problem\":\"Let $A=\\\\{V, W, X, Y, Z, v, w, x, y, z\\\\}$. Find the number of subsets of the 2-configuration \\\\( \\\\{\\\\{V, W\\\\}, \\\\{W, X\\\\}, \\\\{X, Y\\\\}, \\\\{Y, Z\\\\}, \\\\{Z, V\\\\}, \\\\{v, x\\\\}, \\\\{v, y\\\\}, \\\\{w, y\\\\}, \\\\{w, z\\\\}, \\\\{x, z\\\\}, \\\\{V, v\\\\}, \\\\{W, w\\\\}, \\\\{X, x\\\\}, \\\\{Y, y\\\\}, \\\\{Z, z\\\\}\\\\} \\\\) that are consistent of order 1.\"}","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":[]}