Evaluation of LLMs for Mathematical Formalization in Lean
Not on the map. Why?
Abstract (arXiv)
Within the past few years, the ability of Large Language Models (LLMs) to generate formal mathematical proofs has improved drastically. We provide a comparison of various LLMs' effectiveness in producing formal proofs in Lean 4 with the goal of assisting those seeking to use LLMs to support their own projects. We utilize both pass@k and refine@k metrics as the benchmark for our comparison and evaluate on subsets of both miniF2F and miniCTX datasets. Our testing shows that overall, Gemini 3.1 Pro and Claude Opus 4.7 perform best. Gemini 3.1 Pro achieved a 92% success rate on miniF2F via refine@32 whereas Opus 4.7 achieved a 86% success rate on miniCTX via refine@32. When taking cost into account, NVIDIA Nemotron 3 Super and GPT-OSS 120B were the most efficient, with competitive accuracies and average costs of <0.01 per correct proof.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 15 of its 23 references that are in the map. First posted on arXiv 4 Jun 2026.
Builds on
15 of 23 references.
References · 15
- 2021Evaluating Large Language Models Trained on Codecited by 8,320
- 2023Let's Verify Step by Stepcited by 3,789
- 2021MiniF2F: a cross-system benchmark for formal Olympiad-level mathematicscited by 391
- 2025Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learningcited by 180
- 2025Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correctioncited by 154
- 2022Formal Mathematics Statement Curriculum Learningcited by 142
- 2024Does Prompt Formatting Have Any Impact on LLM Performance?cited by 141
- 2025Multi-Agent Design: Optimizing Agents with Better Prompts and Topologiescited by 113
- 2024miniCTX: Neural Theorem Proving with (Long-)Contextscited by 37
- 2025Solving Formal Math Problems by Decomposition and Iterative Reflectioncited by 35
- 2025CombiBench: Benchmarking LLM Capability for Combinatorial Mathematicscited by 31
- 2025DeepTheorem: Advancing LLM Reasoning for Theorem Proving Through Natural Language and Reinforcement Learningcited by 24
Built on by
Citing papers per year: 2026: 3.
3 papers.