{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"math","formal_name":"MATH","introduction":"MATH organises 12,500 high-school competition problems into seven subjects and five difficulty levels, each with a full worked solution. It underlies much of the later mathematics evaluation work; this catalogue imports the full test split: 5,000 problems across all seven subjects.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/hendrycks/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":"3c727641-bf18-56b3-9654-b7c0d0f15668","task_key":"geometry--test--3c727641-bf18-56b3-9654-b7c0d0f15668","task_revision_id":"1","upstream_id":"","short_description":"An ant travels from the point $A (0,-63)$ to the point $B (0,74)$ as follows. It…","config":"geometry","split":"test","body":"{\"level\":\"Level 5\",\"problem\":\"An ant travels from the point $A (0,-63)$ to the point $B (0,74)$ as follows.  It first crawls straight to $(x,0)$ with $x \\\\ge 0$, moving at a constant speed of $\\\\sqrt{2}$ units per second.  It is then instantly teleported to the point $(x,x)$.  Finally, it heads directly to $B$ at 2 units per second.  What value of $x$ should the ant choose to minimize the time it takes to travel from $A$ to $B$?\",\"type\":\"Geometry\"}","display_format":"math","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/hendrycks/math","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}