{"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":"48358997-af99-5fef-8f6e-d71be13aee1d","task_key":"test--48358997-af99-5fef-8f6e-d71be13aee1d","task_revision_id":"1","upstream_id":"","short_description":"Let $X_1, X_2, \\ldots, X_{100}$ be a sequence of mutually distinct nonempty…","config":"","split":"test","body":"{\"problem\":\"Let $X_1, X_2, \\\\ldots, X_{100}$ be a sequence of mutually distinct nonempty subsets of a set $S$ . Any two sets $X_i$ and $X_{i+1}$ are disjoint and their union is not the whole set $S$ , that is, $X_i\\\\cap X_{i+1}=\\\\emptyset$ and $X_i\\\\cup X_{i+1}\\\\neq S$ , for all $i\\\\in\\\\{1, \\\\ldots, 99\\\\}$ . Find the smallest possible 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":[]}