{"task": {"agent_timeout": 600, "task": "omnimath_3993", "verifier_timeout": 60, "instruction": "# Mathematical Problem\n\nDetermine the greatest positive integer $k$ that satisfies the following property: The set of positive integers can be partitioned into $k$ subsets $A_1, A_2, \\ldots, A_k$ such that for all integers $n \\geq 15$ and all $i \\in \\{1, 2, \\ldots, k\\}$ there exist two distinct elements of $A_i$ whose sum is $n.$\n\n[i]\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": []}