weird machine
Six Thousand Conjectures Survived the Counterexample Mill
AutoGraphForge grows its own graph table from failures, filters known relations, and sends survivors toward Lean verification.
Summary
AutoGraphForge grows its own graph table from failures, filters known relations, and sends survivors toward Lean verification.
The pipeline begins with a few hundred graphs and adds only counterexamples to its own proposed relations. A novelty filter closes 559 classical and folklore relations under composition and substitution before testing survivors against roughly 348,000 graphs and targeted search algorithms. The authors report 6,522 surviving conjectures, including relations they then proved by hand. A later stage translates candidates into Lean 4 skeletons and places neural provers behind an independent kernel check. The full system is still running, so the result is an implemented research pipeline rather than a completed autonomous-mathematics census.
Why it matters
AutoGraphForge grows its own graph table from failures, filters known relations, and sends survivors toward Lean verification.
Limits and context
- The pipeline begins with a few hundred graphs and adds only counterexamples to its own proposed relations.
Key claims
AutoGraphForge grows its own graph table from failures, filters known relations, and sends survivors toward Lean verification.
Qualification: The pipeline begins with a few hundred graphs and adds only counterexamples to its own proposed relations.
Evidence: source-2026-09-05-008
Sources
- arXiv preprint 2609.03478arXiv · primary research
Corrections
No corrections have been recorded for this story.