{"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":"9509aceb-3207-5b3b-a624-a7f74e10b60c","task_key":"test--9509aceb-3207-5b3b-a624-a7f74e10b60c","task_revision_id":"1","upstream_id":"","short_description":"Philena and Nathan are playing a game. First, Nathan secretly chooses an ordered…","config":"","split":"test","body":"{\"problem\":\"Philena and Nathan are playing a game. First, Nathan secretly chooses an ordered pair $(x, y)$ of positive integers such that $x \\\\leq 20$ and $y \\\\leq 23$. (Philena knows that Nathan's pair must satisfy $x \\\\leq 20$ and $y \\\\leq 23$.) The game then proceeds in rounds; in every round, Philena chooses an ordered pair $(a, b)$ of positive integers and tells it to Nathan; Nathan says YES if $x \\\\leq a$ and $y \\\\leq b$, and NO otherwise. Find, with proof, the smallest positive integer $N$ for which Philena has a strategy that guarantees she can be certain of Nathan's pair after at most $N$ rounds.\"}","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":[]}