{"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":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"6c3ddb3c-69a2-50c0-bd2f-66c35ef3d438","task_key":"test--6c3ddb3c-69a2-50c0-bd2f-66c35ef3d438","task_revision_id":"3","upstream_id":"","short_description":"Let $X$ be a set of $100$ elements. Find the smallest possible $n$ satisfying…","config":"","split":"test","body":"{\"problem\":\"Let $X$ be a set of $100$ elements. Find the smallest possible $n$ satisfying the following condition: Given a sequence of $n$ subsets of $X$, $A_1,A_2,\\\\ldots,A_n$, there exists $1 \\\\leq i < j < k \\\\leq n$ such that\\n$$A_i \\\\subseteq A_j \\\\subseteq A_k \\\\text{ or } A_i \\\\supseteq A_j \\\\supseteq A_k.$$\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/KbsdJames/Omni-MATH","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}