{"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":"72ee1b58-15f6-5c16-80a4-41a04bafd44e","task_key":"test--72ee1b58-15f6-5c16-80a4-41a04bafd44e","task_revision_id":"1","upstream_id":"","short_description":"Let $\\mathcal{F}$ be the set of all the functions $f : \\mathcal{P}(S)…","config":"","split":"test","body":"{\"problem\":\"Let $\\\\mathcal{F}$ be the set of all the functions $f : \\\\mathcal{P}(S) \\\\longrightarrow \\\\mathbb{R}$ such that for all $X, Y \\\\subseteq S$, we have $f(X \\\\cap Y) = \\\\min (f(X), f(Y))$, where $S$ is a finite set (and $\\\\mathcal{P}(S)$ is the set of its subsets). Find\\n\\\\[\\\\max_{f \\\\in \\\\mathcal{F}}| \\\\textrm{Im}(f) |. \\\\]\"}","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":[]}