Lean-STaR: Learning to Interleave Thinking and Proving
Haohan Lin, Zhiqing Sun, Sean Welleck, Yiming Yang
Abstract
Traditional language model-based theorem proving assumes that by training on a sufficient amount of formal proof data, a model will learn to prove theorems. Our key observation is that a wealth of informal information that is not present in formal proofs can be useful for learning to prove theorems. For instance, humans think through steps of a proof, but this thought process is not visible in the resulting code. We present Lean-STaR, a framework for training language models to produce informal thoughts prior to each step of a proof, thereby boosting the model's theorem-proving capabilities. Lean-STaR uses retrospective ground-truth tactics to generate synthetic thoughts for training the language model. At inference time, the trained model directly generates the thoughts prior to the prediction of the tactics in each proof step. Building on the self-taught reasoner framework, we then apply expert iteration to further fine-tune the model on the correct proofs it samples and verifies using the Lean solver. Lean-STaR achieves better results on the miniF2F-test benchmark within the Lean theorem proving environment, significantly outperforming base models (43.4% → 46.3%, Pass@64). We also analyze the impact of the augmented thoughts on various aspects of the theorem proving process, providing insights into their effectiveness.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 79a2b7cd-9e23-413f-a7f6-671af08838c5Cited by top-tier papers23
- BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem ProvingRan Xin, Chenguang Xi, Jie Yang, Feng Chen et al.ACL 2025 · 66 citations
- AgentSynth: Scalable Task Generation for Generalist Computer-Use AgentsJingxu Xie, Dylan Xu, Xuandong Zhao, Dawn SongICLR 2026 · 36 citations
- FATE: A Formal Benchmark Series for Frontier Algebra of Multiple Difficulty LevelsJiedong Jiang, Wanyi He, Yuefeng Wang, Guoxiong Gao et al.ICLR 2026 · 26 citations
- Learning to Reason via Mixture-of-Thought for Logical ReasoningTong Zheng, Lichang Chen, Simeng Han, R. Thomas McCoy et al.ICLR 2026 · 23 citations
- Process-Verified Reinforcement Learning for Theorem Proving via LeanMinsu Kim, Se-Young YunICLR 2026 · 16 citations
Builds on7
- Language Models are Few-Shot LearnersTom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah et al.NeurIPS 2020 · 64,255 citations
- Chain-of-Thought Prompting Elicits Reasoning in Large Language ModelsJason Wei, Xuezhi Wang, Dale Schuurmans, Maarten Bosma et al.NeurIPS 2022 · 22,562 citations
- STaR: Bootstrapping Reasoning With ReasoningEric Zelikman, Yuhuai Wu, Jesse Mu, Noah D. GoodmanNeurIPS 2022 · 1,126 citations
- Llemma: An Open Language Model for MathematicsZhangir Azerbayev, Hailey Schoelkopf, Keiran Paster, Marco Dos Santos et al.ICLR 2024 · 433 citations
- miniF2F: a cross-system benchmark for formal Olympiad-level mathematicsKunhao Zheng, Jesse Michael Han, Stanislas PoluICLR 2022 · 342 citations
Related papers
- STP: Self-play LLM Theorem Provers with Iterative Conjecturing and ProvingKefan Dong, Tengyu MaICML 2025
- ProofOptimizer: Training Language Models to Simplify Proofs without Human DemonstrationsAlex Gu, Bartosz Piotrowski, Fabian Gloeckle, Kaiyu Yang et al.ICLR 2026 · 11 citations
- Learn from Failure: Fine-tuning LLMs with Trial-and-Error Data for Intuitionistic Propositional Logic ProvingChenyang An, Zhibo Chen, Qihao Ye, Emily First et al.ACL 2024 · 1 citation
- DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree SearchHuajian Xin, Z. Z. Ren, Junxiao Song, Zhihong Shao et al.ICLR 2025
- QDTSynth: Quality-Driven Formal Theorem Synthesis for Enhancing Proving Performance of LLMsLei Wang, Ruobing Zuo, Gaolei He, Jianlin Wang et al.ACL 2025 · 1 citation
