Thought without systematicity? Evaluating reasoning models on rule induction tasks
Organizations: Princeton University
Abstract
A central tenet of human cognition is systematicity, the principle that understanding one concept is inherently tied to understanding close variations of that concept. Do reasoning models robustly exhibit such systematicity? If so, we would expect consistent performance on structurally equivalent variants of the same task. Here, we extend established rule induction tasks from cognitive science to assess the systematicity of thought in current reasoning models. Each task family has compositional structure that we use to create structurally equivalent task variations through task isomorphisms such as recombination and substitution. We find that despite being able to correctly solve a task, models often fail on structurally equivalent variants of the same task. These findings suggest that many model behaviors lack systematicity, rendering it difficult to robustly establish the cognitive abilities of reasoning models beyond the particular contexts they were evaluated in.
Figures & tables
Appendix figures & tables4 assets
Supplementary material from the paper’s appendix.
Appendix
| Model | Metric | Task family | |||||||
|---|---|---|---|---|---|---|---|---|---|
| Integer list | Grammar-based instruction | Raven | Boolean concept | ||||||
| Substitution | Reordering | Recomposition | Reordering | Substitution | Rebinding | Substitution | Reordering | ||
| Claude Opus 4.7 | 0.20 | 0.17 | 0.12 | 0.17 | 0.20 | 0.62 | - | - | |
| 0.16 | 0.17 | 0.18 | 0.17 | 0.16 | 0.08 | - | - | ||
| 0.04 | 0.00 | 0.00 | 0.01 | 0.04 | 0.54 | - | - | ||
| GPT-5.5 | 0.19 | 0.15 | 0.17 | 0.17 | - | 0.19 | - | - | |
Reasoning Consistency in Language Models
Reasoning consistency in language models measures whether conclusions and reasoning remain reliable across equivalent prompts, samples, steps, and contexts.
See all 112 papers