{"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":"66664be2-cd64-5ccc-bbbb-89d1c807acfa","task_key":"test--66664be2-cd64-5ccc-bbbb-89d1c807acfa","task_revision_id":"1","upstream_id":"","short_description":"Let $S$ be a subset with four elements chosen from \\{1,2, \\ldots, 10\\}$. Michael…","config":"","split":"test","body":"{\"problem\":\"Let $S$ be a subset with four elements chosen from \\\\{1,2, \\\\ldots, 10\\\\}$. Michael notes that there is a way to label the vertices of a square with elements from $S$ such that no two vertices have the same label, and the labels adjacent to any side of the square differ by at least 4 . How many possibilities are there for the subset $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":[]}