{"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":"e43abb29-8a8c-5c55-904b-2661ee3a9b65","task_key":"test--e43abb29-8a8c-5c55-904b-2661ee3a9b65","task_revision_id":"1","upstream_id":"","short_description":"In the sum shown, each letter represents a different digit with $T \\neq 0$ and…","config":"","split":"test","body":"{\"problem\":\"In the sum shown, each letter represents a different digit with $T \\\\neq 0$ and $W \\\\neq 0$. How many different values of $U$ are possible? \\n\\n\\\\begin{tabular}{rrrrr} \\n& $W$ & $X$ & $Y$ & $Z$ \\\\\\\\ \\n+ & $W$ & $X$ & $Y$ & $Z$ \\\\\\\\ \\n\\\\hline & $W$ & $U$ & $Y$ & $V$ \\n\\\\end{tabular}\"}","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":[]}