List your company

Theorem Proving on MiniF2F (val)

63.9Success RateInternLM2-StepProver
7.251221.958136.66551.3719May 22, 2022Nov 16, 2022May 14, 2023Nov 8, 2023May 5, 2024Oct 30, 2024Apr 27, 2025

Evaluation results

MethodLinks
InternLM2-StepProverLanguage=Lean-based, Base=InternLM2-Math-plus, Synthetic Size=1.155B Tokens, Search Budget=64 x 3200, Tree search strategy=true2024.0863.9———
SubgoalXLBase model=Llama-3-8B, Use human-written informal proofs=true2024.0861.9———
SubgoalXLLanguage=Isabelle-based, Base=Llama-3, Synthetic Size=38k Theorems, Search Budget=16384, Tree search strategy=true2024.0861.9———
HTPSLanguage=Lean-based, Tree search strategy=true2024.0858.6———
LEGO-ProverBase model=GPT-3.5-Turbo, Use human-written informal proofs=true2024.0855.3———
LyraBase model=GPT-4, Use human-written informal proofs=true2024.0855.3———
LEGO-ProverLanguage=Isabelle-based, Base=GPT-3.5-Turbo, Search Budget=100, Tree search strategy=true2024.0855.3———
LyraLanguage=Isabelle-based, Base=GPT-4, Search Budget=200, Human-written informal proofs integration=true2024.0855.3———
Subgoal-ProverBase model=GPT-3.5-Turbo, Use human-written informal proofs=false2024.0848———
Subgoal-ProverLanguage=Isabelle-based, Base=GPT-3.5-Turbo, Search Budget=1002024.0848———
DSPBase model=Codex, Use human-written informal proofs=true2024.0842.6———
DSPLanguage=Isabelle-based, Base=Codex, Search Budget=100, Human-written informal proofs integration=true2024.0842.6———
M2Expert iteration=22022.0537.3———
Thor + expert iterationUse human-written informal proofs=false2024.0837.3———
Thor + expert iterationLanguage=Isabelle-based, Tree search strategy=true2024.0837.3———
M1Expert iteration=12022.0536.1———
Hierarchical AttentionK=32, Search Strategy=best-first search2025.0434.0220.6412
Hierarchical AttentionK=64, Search Strategy=best-first search2025.0434.0220.6412.68
Expert iteration2022.0533.6———
FMSCL2022.0533.6———
Hierarchical AttentionK=16, Search Strategy=best-first search2025.0433.21.890.6513.89
BaselineK=32, Search Strategy=best-first search2025.0431.563.11——
BaselineK=64, Search Strategy=best-first search2025.0431.563.11——
BaselineK=16, Search Strategy=best-first search2025.0431.152.89——
Hierarchical AttentionK=8, Search Strategy=best-first search2025.0429.512.670.949.68
Thorsampling temperature=1.22022.0528.3———
Base model (M0)2022.0528.3———
ThorUse human-written informal proofs=false2024.0828.3———
ThorLanguage=Isabelle-based, Search Budget=300, Tree search strategy=true2024.0828.3———
Language model ∪ Sledgehammer2022.0527.1———
BaselineK=8, Search Strategy=best-first search2025.0427.052.83——
Hierarchical AttentionK=64, Search Strategy=single-pass sampling strategy2025.0426.642.381.1216.33
Hierarchical AttentionK=32, Search Strategy=single-pass sampling strategy2025.0425.411.92127.66
Language model2022.0525———
Hierarchical AttentionK=16, Search Strategy=single-pass sampling strategy2025.0424.591.890.9743.18
PACT2022.0523.9———
PACT2022.0523.9———
Hierarchical AttentionK=4, Search Strategy=best-first search2025.0423.77———
BaselineK=64, Search Strategy=single-pass sampling strategy2025.0421.722.12——
Hierarchical AttentionK=8, Search Strategy=single-pass sampling strategy2025.0421.131.730.7437.5
BaselineK=4, Search Strategy=best-first search2025.0420.49———
Hierarchical AttentionK=4, Search Strategy=single-pass sampling strategy2025.0420.08———
BaselineK=32, Search Strategy=single-pass sampling strategy2025.0420.081.92——
BaselineK=16, Search Strategy=single-pass sampling strategy2025.0418.441.95——
BaselineK=8, Search Strategy=single-pass sampling strategy2025.0418.032.33——
Sledgehammer+heuristicUse human-written informal proofs=false2024.0818———
Sledgehammer+heuristicLanguage=Isabelle-based2024.0818———
BaselineK=4, Search Strategy=single-pass sampling strategy2025.0416.8———
Hierarchical AttentionK=2, Search Strategy=single-pass sampling strategy2025.0415.16———
BaselineK=2, Search Strategy=best-first search2025.0415.16———
Hierarchical AttentionK=1, Search Strategy=single-pass sampling strategy2025.0414.75———
Hierarchical AttentionK=2, Search Strategy=best-first search2025.0414.75———
Hierarchical AttentionK=1, Search Strategy=best-first search2025.0413.52———
BaselineK=1, Search Strategy=best-first search2025.0412.7———
BaselineK=2, Search Strategy=single-pass sampling strategy2025.0412.3———
Sledgehammer2022.059.9———
SledgehammerUse human-written informal proofs=false2024.089.9———
SledgehammerLanguage=Isabelle-based2024.089.9———
BaselineK=1, Search Strategy=single-pass sampling strategy2025.049.43———