VeriSoftBench: Repository-Scale Formal Verification Benchmarks for Lean
Not on the map. Why?
Abstract (arXiv)
Large language models have achieved striking results in interactive theorem proving, particularly in Lean. However, most benchmarks for LLM-based proof automation are drawn from mathematics in the Mathlib ecosystem, whereas proofs in software verification are developed inside definition-rich codebases with substantial project-specific libraries. We introduce VeriSoftBench, a benchmark of 500 Lean 4 proof obligations drawn from open-source formal-methods developments and packaged to preserve realistic repository context and cross-file dependencies. Our evaluation of frontier LLMs and specialized provers yields three observations. First, provers tuned for Mathlib-style mathematics transfer poorly to this repository-centric setting. Second, success is strongly correlated with transitive repository dependence: tasks whose proofs draw on large, multi-hop dependency closures are less likely to be solved. Third, providing curated context restricted to a proof's dependency closure improves performance relative to exposing the full repository, but nevertheless leaves substantial room for improvement. Our benchmark and evaluation suite are released at https://github.com/utopia-group/VeriSoftBench.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 25 of its 61 references that are in the map. First posted on arXiv 20 Feb 2026.
Builds on
25 of 61 references.
References · 25
- 2021Evaluating Large Language Models Trained on Codecited by 8,053
- 2021Program Synthesis with Large Language Modelscited by 3,509
- 2023LeanDojo: Theorem Proving with Retrieval-Augmented Language Modelscited by 414
- 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
- 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
- 2019Learning to Prove Theorems via Interacting with Proof Assistantscited by 107
13 more
- 2022Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Proverscited by 97
- 2023An In-Context Learning Agent for Formal Theorem-Provingcited by 78
- 2025Hilbert: Recursively Building Formal Proofs with Informal Reasoningcited by 55
- 2024DafnyBench: A Benchmark for Formal Software Verificationcited by 54
- 2023Verus: Verifying Rust Programs using Linear Ghost Types (extended version)cited by 50
- 2024miniCTX: Neural Theorem Proving with (Long-)Contextscited by 35
- 2025CLEVER: A Curated Benchmark for Formally Verified Code Generationcited by 27
- 2025Ax-Prover: A Deep Reasoning Agentic Framework for Theorem Proving in Mathematics and Quantum Physicscited by 27
- 2024Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verificationcited by 25
- 2024miniCodeProps: a Minimal Benchmark for Proving Code Propertiescited by 18
- 2025Proving the Coding Interview: A Benchmark for Formally Verified Code Generationcited by 18
- 2025Lean-SMT: An SMT tactic for discharging proof goals in Leancited by 9
- 2024Small Scale Reflection for the Working Lean Usercited by 1
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026s2n-bignum-bench: A practical benchmark for evaluating low-level code reasoning of LLMscited by 1
- 2026AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Languagecited by 1
- 2026Vero: Can AI Agents Build Formally Verified Software Repositories?cited by 1
- 2026AxQM: A Textbook-Scale Benchmark for Formal Proof Synthesis in a Library of Finite-Dimensional Quantum Mechanicscited by 0
- 2026FORALL-LEAN-AGENT for Auditable Reasoning in Formal Mathematics and Software Verificationcited by 0
- 2026Cost-Efficient Theorem Proving via Agent Orchestration in Program Verificationcited by 0
- 2026Cost-Efficient Theorem Proving via Agent Orchestration in Program Verification7 Oct 2026
- 2026FORALL-LEAN-AGENT for Auditable Reasoning in Formal Mathematics and Software Verification1 Oct 2026
- 2026AxQM: A Textbook-Scale Benchmark for Formal Proof Synthesis in a Library of Finite-Dimensional Quantum Mechanics4 Sep 2026
- 2026Vero: Can AI Agents Build Formally Verified Software Repositories?13 Aug 2026
- 2026AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language17 Jul 2026
- 2026s2n-bignum-bench: A practical benchmark for evaluating low-level code reasoning of LLMs15 Mar 2026