{"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":"31c56bc0-3dcd-52da-99ad-c4ba6814c8fd","task_key":"test--31c56bc0-3dcd-52da-99ad-c4ba6814c8fd","task_revision_id":"1","upstream_id":"","short_description":"The set of points $\\left(x_{1}, x_{2}, x_{3}, x_{4}\\right)$ in $\\mathbf{R}^{4}$…","config":"","split":"test","body":"{\"problem\":\"The set of points $\\\\left(x_{1}, x_{2}, x_{3}, x_{4}\\\\right)$ in $\\\\mathbf{R}^{4}$ such that $x_{1} \\\\geq x_{2} \\\\geq x_{3} \\\\geq x_{4}$ is a cone (or hypercone, if you insist). Into how many regions is this cone sliced by the hyperplanes $x_{i}-x_{j}=1$ for $1 \\\\leq i<j \\\\leq n$ ?\"}","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":[]}