Skip to main content
Search

# Proving Impossibility

1 related articles

Subscribe to updates
  1. arXiv

    An agent learns the rules, then proves a sealed level unwinnable: AWM returns Lean-checked proofs where twelve baseline runs return none

    In game environments whose rules and goals are not disclosed, AWM turns hypotheses gathered through interaction into an explicit algebraic world model and then produces kernel-checked Lean 4 proofs of reachability and impossibility. On two sealed levels whose budgets sit below the minimum winning cost, all six AWM runs yield closed, kernel-checked proofs excluding every legal winning sequence within budget, while twelve baseline runs of Claude Opus 5.5 and GPT-6 Astra produce no such proofs. Across 25 public ARC-AGI-3 games, these models let Lean replay the winning trajectories of all 183 levels.

You’re all caught up