{"task": {"agent_timeout": 600, "task": "omnimath_2001", "verifier_timeout": 60, "instruction": "# Mathematical Problem\n\nAn $n \\times m$ maze is an $n \\times m$ grid in which each cell is one of two things: a wall, or a blank. A maze is solvable if there exists a sequence of adjacent blank cells from the top left cell to the bottom right cell going through no walls. (In particular, the top left and bottom right cells must both be blank.) Determine the number of solvable $2 \\times 2$ mazes.\n\n## Instructions\n\nSolve the mathematical problem above and write your final answer to `/workspace/answer.txt`.\n\n**Important**: Write only your final answer to the file, not the full solution process.\n\n### Guidelines\n\n- Provide your final numerical answer or mathematical expression\n- Write the answer as plain text (no special formatting needed)\n- Be precise and clear in your answer\n- The answer should directly respond to what the problem asks for\n\n### Example\n\nIf the problem asks \"What is 2 + 2?\", your answer file should contain:\n\n```\n4\n```\n\nYour answer will be evaluated against the correct solution using an automated grading system.\n", "memory": "", "runnable": false, "difficulty": "hard", "language": "", "cpus": "", "instruction_truncated": false, "category": "math", "compose": false, "has_solution": true, "oracle": null, "docker_image": "", "taskset": "omnimath", "tags": ["omni-math"]}, "runs": []}