{"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":"66401e93-9ef0-51d5-a5cc-4feb724d0dde","task_key":"test--66401e93-9ef0-51d5-a5cc-4feb724d0dde","task_revision_id":"1","upstream_id":"","short_description":"Compute the number of triples $(f, g, h)$ of permutations on $\\{1,2,3,4,5\\}$…","config":"","split":"test","body":"{\"problem\":\"Compute the number of triples $(f, g, h)$ of permutations on $\\\\{1,2,3,4,5\\\\}$ such that $$ \\\\begin{aligned} & f(g(h(x)))=h(g(f(x)))=g(x), \\\\\\\\ & g(h(f(x)))=f(h(g(x)))=h(x), \\\\text { and } \\\\\\\\ & h(f(g(x)))=g(f(h(x)))=f(x) \\\\end{aligned} $$ for all $x \\\\in\\\\{1,2,3,4,5\\\\}$.\"}","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":[]}