{"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":"bea56df4-bef3-5078-8ec3-248387c4a0f4","task_key":"test--bea56df4-bef3-5078-8ec3-248387c4a0f4","task_revision_id":"1","upstream_id":"","short_description":"Evaluate","config":"","split":"test","body":"{\"problem\":\"Evaluate\\n\\\\[\\\\left \\\\lfloor  \\\\ \\\\prod_{n=1}^{1992} \\\\frac{3n+2}{3n+1} \\\\  \\\\right \\\\rfloor\\\\]\"}","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":[]}