VeriSoftBench: Repository-Scale Formal Verification Benchmarks for Lean
cs.SE, cs.CL, cs.LG, cs.PL
Submitted: 2026-02-20
Updated: 2026-09-22
Comments: COLM 2026
Code: https://github.com/utopia-group/VeriSoftBench
License: http://creativecommons.org/licenses/by/4.0/
The gist: Large language models have achieved striking results in interactive theorem proving, particularly in Lean.
Terminology
Abstract
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.
Sources
- Evaluating Large Language Models Trained on Code
- Aristotle: IMO-level Automated Theorem Proving
- Proving the Coding Interview: A Benchmark for Formally Verified Code Generation
- Small Scale Reflection for the Working Lean User
- ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics
- miniCTX: Neural Theorem Proving with (Long-)Contexts
- Thor: Wielding Hammers to Integrate Language Models and Automated Theorem Provers
- Llemma: An Open Language Model For Mathematics
- Draft, Sketch, and Prove: Guiding Formal Theorem Provers with Informal Proofs
- Seed-Prover 1.5: Mastering Undergraduate-Level Theorem Proving via Learning from Experience
- Generative Language Modeling for Automated Theorem Proving
- HyperTree Proof Search for Neural Theorem Proving
- An In-Context Learning Agent for Formal Theorem-Proving
- Goedel-Prover-V2: Scaling Formal Theorem Proving with Scaffolded Data Synthesis and Self-Correction
- CLEVER: A Curated Benchmark for Formally Verified Code Generation
- miniCodeProps: a Minimal Benchmark for Proving Code Properties
- MiniF2F: a cross-system benchmark for formal Olympiad-level mathematics
- PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition
- Kimina-Prover Preview: Towards Large Formal Reasoning Models with Reinforcement Learning
- VERINA: Benchmarking Verifiable Code Generation
Related papers
- Falsification-Based Verification of LLM-Generated Optimization Models: Sound Test Batteries and Their Detection Limits
- GitSkills: A Dataset of Agent Skills on GitHub
- SABER: Benchmarking Operational Safety of LLM Coding Agents in Stateful Project Workspaces
- PackMonitor: Enabling Zero Package Hallucinations Through Decoding-Time Monitoring
- IntentCoding: Amplifying User Intent in Code Generation
- Incentives and Outcomes in Bug Bounties