Measuring Iterative Temporal Reasoning with Time Puzzles

Zhengxiang Wang, Zeyu Dong
1/12/2026
cs.CLcs.AI

No official code found. Best implementation: jaaack-wang/Time-Puzzles (0 stars, MIT, last commit 2026-01-14).

Abstract

We introduce Time Puzzles, a constraint-based date inference task for evaluating iterative temporal reasoning. Each puzzle combines factual temporal anchors with (cross-cultural) calendar relations, admits one or multiple valid solution dates, and is algorithmically generated for controlled, dynamic, and continual evaluation. Across 13 diverse LLMs, Time Puzzles well distinguishes their iterative temporal reasoning capabilities and remains challenging without tools: GPT-5 reaches only 49.3% accuracy and all other models stay below 31%, despite the dataset's simplicity. Web search consistently yields substantial gains and using code interpreter shows mixed effects, but all models perform much better when constraints are rewritten with explicit dates, revealing a gap in reliable tool use. Overall, Time Puzzles presents a simple, cost-effective diagnostic for tool-augmented iterative temporal reasoning.

View on arXivView PDF

Code Implementations(1)

MIT

Code and datasets for our paper "Measuring Iterative Temporal Reasoning with Time Puzzles"

00Shell, PythonJan 10, 20269 months agoMIT

Similar Papers

Cite this paper

@article{wang2026measuring,
  title  = {Measuring Iterative Temporal Reasoning with Time Puzzles},
  author = {Zhengxiang Wang and Zeyu Dong},
  year   = {2026},
  eprint = {2601.07148},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2601.07148v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2601.07148.svg)](https://codeofpaper.com/paper/2601.07148)

Discussion