TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics
Not on the map. Why?
Abstract (arXiv)
LLMs have recently achieved strong results on formal proving benchmarks. However, existing evaluations remain heavily concentrated on competition-style problems and often fail to capture how models behave on longer, more dependency-rich mathematical developments. We introduce TheoremBench, a Lean4 benchmark designed to evaluate theorem provers beyond contest settings. The benchmark is built from nearly one hundred classical theorems and is released in two complementary forms: a plain main version containing one target theorem per instance, and a premised version that expands each theorem into a structured family of related proving tasks consisting of the main theorem together with automatically extracted supporting subtheorems. This design enables evaluation of not only whether the final theorem was proved from scratch, but also of partial progress through the internal proof structure of a theorem. Our experiments show that explicit premises substantially improve performance for Lean4-capable prover models. To provide a comprehensive evaluation, we introduce theorem-level coverage and token-efficiency metrics that expose qualitative differences in proof behavior. The results show that current provers remain strongly biased toward easy subtheorems and often solve theorems through long and inefficient tactic traces rather than compact proof plans. TheoremBench therefore provides a more fine-grained view of formal reasoning ability and highlights the importance of structural benchmark design for evaluating Lean4 theorem provers.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 32 of its 40 references that are in the map. First posted on arXiv 8 Jun 2026.
Builds on
32 of 40 references.
References · 32
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 414
- 2023Llemma: An Open Language Model For Mathematicscited by 385
- 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 380
- 2020Generative Language Modeling for Automated Theorem Provingcited by 379
- 2022Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofscited by 278
- 2025DeepSeek-Prover-V2: Advancing Formal Mathematical Reasoning via Reinforcement Learning for Subgoal Decompositioncited by 270
- 2022HyperTree Proof Search for Neural Theorem Provingcited by 192
- 2024DeepSeek-Prover-V1.5: Harnessing Proof Assistant Feedback for Reinforcement Learning and Monte-Carlo Tree Searchcited by 189
- 2023ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematicscited by 180
- 2025Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learningcited by 173
- 2024PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competitioncited by 153
- 2025Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correctioncited by 140
20 more
- 2025Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Provingcited by 126
- 2023Baldur: Whole-Proof Generation and Repair with Large Language Modelscited by 118
- 2024Lean Workbook: A large-scale Lean problem set formalized from natural language math problemscited by 115
- 2019Learning to Prove Theorems via Interacting with Proof Assistantscited by 107
- 2022Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Proverscited by 97
- 2025BFS-Prover: Scalable Best-First Tree Search for LLM-based Automatic Theorem Provingcited by 82
- 2023An In-Context Learning Agent for Formal Theorem-Provingcited by 78
- 2024TheoremLlama: Transforming General-Purpose LLMs into Lean4 Expertscited by 58
- 2023Magnushammer: A Transformer-Based Approach to Premise Selectioncited by 50
- 2018GamePad: A Learning Environment for Theorem Provingcited by 48
- 2025FormalMATH: Benchmarking Formal Mathematical Reasoning of Large Language Modelscited by 45
- 2025APOLLO: Automated LLM and Lean Collaboration for Advanced Formal Reasoningcited by 34
- 2024HunyuanProver: A Scalable Data Synthesis Framework and Guided Tree Search for Automated Theorem Provingcited by 32
- 2025CombiBench: Benchmarking LLM Capability for Combinatorial Mathematicscited by 28
- 2019HOList: An Environment for Machine Learning of Higher-Order Theorem Provingcited by 19
- 2025Autoformalization in the Era of Large Language Models: A Surveycited by 19
- 2025REAL-Prover: Retrieval Augmented Lean Prover for Mathematical Reasoningcited by 18
- 2018Learning to Reason with HOL4 tacticscited by 14
- 2025ProofOptimizer: Training Language Models to Simplify Proofs without Human Demonstrationscited by 10
- 2025Generating Millions Of Lean Theorems With Proofs By Exploring State Transition Graphscited by 3
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026When Does Structured Knowledge Help Neural Theorem Proving?28 Sep 2026
Similar, not cited
Close in wording, no citation either way
- 2026MA-ProofBench: A Two-Tiered Evaluation of LLMs for Theorem Proving in Mathematical Analysis
- 2026CAM-Bench: A Benchmark for Computational and Applied Mathematics in Lean
- 2025A Combinatorial Identities Benchmark for Theorem Proving via Automated Theorem Generation
- 2026FormalProofBench: Can Models Write Graduate Level Math Proofs That Are Formally Verified?
- 2026MathAdv: What Theorem Provers Know, Reason, Formalize, and Generalize
- 2026AdvancedMathBench: A Benchmark Suite for Advanced Mathematical Proof Generation and Verification
- 2026Construction-Verification: A Benchmark for Applied Mathematics in Lean 4
- 2025BrokenMath: A Benchmark for Sycophancy in Theorem Proving with LLMs