{"task": {"agent_timeout": 600, "task": "omnimath_1069", "verifier_timeout": 60, "instruction": "# Mathematical Problem\n\nSix distinguishable players are participating in a tennis tournament. Each player plays one match of tennis against every other player. There are no ties in this tournament; each tennis match results in a win for one player and a loss for the other. Suppose that whenever $A$ and $B$ are players in the tournament such that $A$ wins strictly more matches than $B$ over the course of the tournament, it is also true that $A$ wins the match against $B$ in the tournament. In how many ways could the tournament have gone?\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": []}