{"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":"ef1105aa-71f2-5ebb-b01b-0bf5a4a6959b","task_key":"test--ef1105aa-71f2-5ebb-b01b-0bf5a4a6959b","task_revision_id":"1","upstream_id":"","short_description":"Find the smallest positive integer $n$ such that $\\underbrace{2^{2 \\cdot…","config":"","split":"test","body":"{\"problem\":\"Find the smallest positive integer $n$ such that $\\\\underbrace{2^{2 \\\\cdot 2}}_{n}>3^{3^{3^{3}}}$. (The notation $\\\\underbrace{2^{2^{2}}}_{n}$, is used to denote a power tower with $n 2$ 's. For example, $\\\\underbrace{2^{22^{2}}}_{n}$ with $n=4$ would equal $2^{2^{2^{2}}}$.)\"}","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":[]}