{"task": {"agent_timeout": 600, "task": "omnimath_3600", "verifier_timeout": 60, "instruction": "# Mathematical Problem\n\n( Elgin Johnston ) Legs $L_1, L_2, L_3, L_4$ of a square table each have  length $n$ , where $n$ is a positive integer.  For how many ordered  4-tuples $(k_1, k_2, k_3, k_4)$ of nonnegative integers can we cut  a piece of length $k_i$ from the end of leg $L_i \\; (i = 1,2,3,4)$ and still have a stable table?\n(The table is stable if it can be placed so that  all four of the leg ends touch the floor. Note that a cut leg of length 0 is permitted.)\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": []}