--- license: mit ---

Paper Link👁️

# Goedel-Prover: A New Frontier in Open-source Automated Theorem Proving ## 1. Introduction We introduce Goedel-Prover, an open-source large language model (LLM) that achieves the state-of-the-art (SOTA) performance in automated formal proof generation for mathematical problems. The key challenge in this field is the scarcity of formalized math statements and proofs, which we tackle in the following ways. We train statement formalizers to translate the natural language math problems from Numina into formal language (Lean 4), creating a dataset of 1.64 million formal statements. LLMs are used to check that the formal statements accurately preserve the content of the original natural language problems. We then iteratively build a large dataset of formal proofs by training a series of provers. Each prover succeeds in proving many statements that the previous ones could not, and these new proofs are added to the training set for the next prover. The final prover outperforms all existing open-source models in whole-proof generation. On the miniF2F benchmark, it achieves a 57.6% success rate (Pass@32), exceeding the previous best open-source model by 7.6%. On PutnamBench, Goedel-Prover successfully solves 7 problems (Pass@512), ranking first on the leaderboard. Furthermore, it generates 29.7K formal proofs for Lean Workbook problems, nearly doubling the 15.7K produced by earlier works.

**Caption:** The Pass@N metric indicates that we generate N proofs for a single problem; if any one of these N proofs successfully solves the problem, it is considered solved. (Left): The performance of Pass@32 for full proof generation on miniF2F. Due to limited compute, we compare with DeepSeek-Prover-v1.5 on the Pass@32 metric. (Middle): This sub-figure presents a comparison of Goedel-Prover-SFT and Deepseek-Prover-v1.5 in terms of miniF2F performance across different inference budgets, ranging from Pass@32, 64, 128, ..., 4 \* 6400, to 16 \* 6400. The performance numbers of Deepseek-Prover-v1.5 are directly taken from Table 1 of Xin et al. (2024b). Due to computational resource constraints, we tested Goedel-Prover-SFT only up to Pass@4 × 6400. Notably, Goedel-Prover-SFT's Pass@256 already exceeds the Pass@16 \* 6400 performance of Deepseek-Prover-v1.5-RL (without inference time tree search). (Right): The number of problems solved in Lean-workbook by Goedel-Prover-SFT compared to prior works. InternLM2.5-Step-Prover and InternLM-Math-Plus collectively solve and open-source 15.7K samples, while we solve and open-source 29.7K samples. ## 2. Evaluation Results

| Model |Compute (Pass)| miniF2F-test | |------------------------|------------------|------------------| | TheoremLamma | 128 | 33.6% | | DeepSeek-Prover-V1 | 32 | 46.1% | | DeepSeek-Prover-V1.5-SFT | 32 | 48.2% | | DeepSeek-Prover-V1.5-RL | 32 | 50.0% | | **Goedel-Prover-SFT** | **32** | **57.6%** | |------------------------|------------------|------------------| | DeepSeek-Prover-V1.5-SFT | 3200 | 53.3% | | DeepSeek-Prover-V1.5-RL | 3200 | 54.9% | | **Goedel-Prover-SFT** | **3200** | **62.7%** | |------------------------|------------------|------------------| | DeepSeek-Prover-V1.5-SFT | 25600 | 55.8% | | DeepSeek-Prover-V1.5-RL | 25600 | 58.5% | | **Goedel-Prover-SFT** | **25600** | **64.7%** |

**Caption:** Comparison of Goedel-Prover-SFT with existing methods for whole proof generation on miniF2F, assessing performance across various inference time computations.

MultiDataset | | miniF2F | ProofNet | FormalNumina | Lean-workbook | |-----------------------|------------|------------|--------------|---------------| | Deepseek-Prover-v1.5-RL | 50.0% | **16.0%** | 54.0% | 14.7% | | **Goedel-Prover-SFT** | **57.6%** | 15.2% | **61.2%** | **21.2%** |

**Caption:** Comparison of Goedel-Prover-SFT with Deepseek-Prover-v1.5-RL for whole proof generation on miniF2F, ProofNet,FormalNumina,Lean-workbook. We report the Pass@32 performance for miniF2F, ProofNet, and FormalNumina datasets. For the Lean-workbook, we evaluate performance using Pass@16 due to the large number of problems (140K) it contains, allowing us to save on computational costs. FormalNumina is a private test set created by formalizing a randomly sampled collection of 250 problems from Numina.

Putnam | Ranking | Model | Type | Num-solved | Compute | |---------|-------------------------------------------------------|-----------------------|------------|---------------------| | 1 | **Goedel-Prover-SFT** 🟩 | Whole Proof Generation | 7 | 512 | | 1 | ABEL | Tree Search Method | 7 | 596 | | 3 | **Goedel-Prover-SFT** 🟩 | Whole Proof Generation | 6 | 32 | | 3 | InternLM2.5-StepProver 🟩 | Tree Search Method | 6 | 2×32×600 | | 5 | InternLM 7B | Whole Proof Generation | 4 | 4096 | | 6 | GPT-4o | Whole Proof Generation | 1 | 10 | | 7 | COPRA (GPT-4o) 🟩 | Whole Proof Generation | 1 | 1 | | 8 | ReProver w/ retrieval 🟩 | Whole Proof Generation | 0 | 1 | | 9 | ReProver w/o retrieval 🟩 | Whole Proof Generation | 0 | 1 |

**Caption:** Our model rank the 1st on [Putnam Leaderboard](https://trishullab.github.io/PutnamBench/leaderboard.html). The performance numbers for existing works are taken from the leaderboard. 🟩 indicates open sourced models. ## 3. Dataset Downloads We are also releasing 29,7K proofs of the problems in Lean-workbook found by our Goedel-Prover-SFT.

## 4. Citation ```latex @misc{lin2025goedelproverfrontiermodelopensource, title={Goedel-Prover: A Frontier Model for Open-Source Automated Theorem Proving}, author={Yong Lin and Shange Tang and Bohan Lyu and Jiayun Wu and Hongzhou Lin and Kaiyu Yang and Jia Li and Mengzhou Xia and Danqi Chen and Sanjeev Arora and Chi Jin}, year={2025}, eprint={2502.07640}, archivePrefix={arXiv}, primaryClass={cs.LG}, url={https://arxiv.org/abs/2502.07640}, } ```