{"slug": "proofevolve-neuro-symbolic-evolution-for-formal-automated-theorem-proving", "title": "ProofEvolve: Neuro-Symbolic Evolution for Formal Automated Theorem Proving", "summary": "ProofEvolve, a neuro-symbolic framework proposed in a new arXiv paper, achieves the highest average solve rate across three competition-level Lean benchmarks by evolving formally verified symbolic proof structures with neural models. The framework uses neural models to propose variation operators and the Lean kernel to verify every proof transition, preserving verified results from incomplete attempts for later proofs.", "body_md": "arXiv:2608.26334v1 Announce Type: new\nAbstract: Automated theorem proving offers a natural foundation for recursive self-improvement in scientific discovery. However, existing neural provers do not fully preserve this recursive structure, where the learning process should be self-improving over time. Existing methods either embed proof experience into model parameters through expensive weight updates, or keep verified intermediate deductions only within the current problem. In addition, these methods also heavily rely on sparse whole-proof feedback, even when unsuccessful partial attempts contain useful discoveries. To close the gap, we propose ProofEvolve, a neuro-symbolic framework that evolves explicit, formally verified symbolic proof structures with neural models to decisively expand the knowledge boundary. In this framework, the neural model proposes variation operators, including decompositions, repairs, and schema recombinations. The symbolic Lean kernel verifies every proof transition. Over the evolution loops, ProofEvolve computes verified closure over the resulting proof directed acyclic graphs (DAGs). Within each problem, ProofEvolve evolves partial AND-OR proof DAGs in a behaviorally indexed archive. Across problems, kernel-checked schema extraction adds newly proved sub-DAGs to a persistent schema library. Proof DAGs inherit the solved results through typed schema recombination, with every residual premise exposed as a new subgoal. This evolutionary process preserves verified results from incomplete attempts and makes them available for later proofs without weakening formal soundness. Across three competition-level Lean benchmarks, ProofEvolve achieves the highest average solve rate among the evaluated proof systems.", "url": "https://wpnews.pro/news/proofevolve-neuro-symbolic-evolution-for-formal-automated-theorem-proving", "canonical_source": "https://www.machinebrief.com/news/proofevolve-neuro-symbolic-evolution-for-formal-automated-th-i36r", "published_at": "2026-08-28 04:00:00+00:00", "updated_at": "2026-08-28 06:19:38.985336+00:00", "lang": "en", "topics": ["artificial-intelligence", "machine-learning", "ai-research"], "entities": ["ProofEvolve", "Lean"], "alternates": {"html": "https://wpnews.pro/news/proofevolve-neuro-symbolic-evolution-for-formal-automated-theorem-proving", "markdown": "https://wpnews.pro/news/proofevolve-neuro-symbolic-evolution-for-formal-automated-theorem-proving.md", "text": "https://wpnews.pro/news/proofevolve-neuro-symbolic-evolution-for-formal-automated-theorem-proving.txt", "jsonld": "https://wpnews.pro/news/proofevolve-neuro-symbolic-evolution-for-formal-automated-theorem-proving.jsonld"}}