{"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":"f89ff374-f724-54b8-b7d6-d831193755e6","task_key":"test--f89ff374-f724-54b8-b7d6-d831193755e6","task_revision_id":"1","upstream_id":"","short_description":"Compute the number of sets $S$ such that every element of $S$ is a nonnegative…","config":"","split":"test","body":"{\"problem\":\"Compute the number of sets $S$ such that every element of $S$ is a nonnegative integer less than 16, and if $x \\\\in S$ then $(2 x \\\\bmod 16) \\\\in S$.\"}","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":[]}