{"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":"9965957e-9804-5ef8-97c2-6b3b25710540","task_key":"test--9965957e-9804-5ef8-97c2-6b3b25710540","task_revision_id":"1","upstream_id":"","short_description":"Denote $S$ as the subset of $\\{1,2,3,\\dots,1000\\}$ with the property that none…","config":"","split":"test","body":"{\"problem\":\"Denote $S$ as the subset of $\\\\{1,2,3,\\\\dots,1000\\\\}$ with the property that none of the sums of two different elements in $S$ is in $S$. Find the maximum number of elements 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":[]}