{"task": {"agent_timeout": 600, "task": "omnimath_3822", "verifier_timeout": 60, "instruction": "# Mathematical Problem\n\nEsmeralda has created a special knight to play on quadrilateral boards that are identical to chessboards. If a knight is in a square then it can move to another square by moving 1 square in one direction and 3 squares in a perpendicular direction (which is a diagonal of a $2\\times4$ rectangle instead of $2\\times3$ like in chess). In this movement, it doesn't land on the squares between the beginning square and the final square it lands on.\n\nA trip of the length $n$ of the knight is a sequence of $n$ squares $C1, C2, ..., Cn$ which are all distinct such that the knight starts at the $C1$ square and for each $i$ from $1$ to $n-1$ it can use the movement described before to go from the $Ci$ square to the $C(i+1)$.\n\nDetermine the greatest $N \\in \\mathbb{N}$ such that there exists a path of the knight with length $N$ on a $5\\times5$ board.\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": []}