{"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":"5026a297-bf2a-512e-99b6-d312ef9313aa","task_key":"test--5026a297-bf2a-512e-99b6-d312ef9313aa","task_revision_id":"1","upstream_id":"","short_description":"Determine the number of sequences of sets $S_{1}, S_{2}, \\ldots, S_{999}$ such…","config":"","split":"test","body":"{\"problem\":\"Determine the number of sequences of sets $S_{1}, S_{2}, \\\\ldots, S_{999}$ such that $$S_{1} \\\\subseteq S_{2} \\\\subseteq \\\\cdots \\\\subseteq S_{999} \\\\subseteq\\\\{1,2, \\\\ldots, 999\\\\}$$ Here $A \\\\subseteq B$ means that all elements of $A$ are also elements of $B$.\"}","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":[]}