[2602.24273] A Minimal Agent for Automated Theorem Proving

Computer Science > Artificial Intelligence arXiv:2602.24273 (cs) [Submitted on 27 Feb 2026] Title:A Minimal Agent for Automated Theorem Proving Authors:Borja Requena Pozo, Austin Letson, Krystian Nowakowski, Izan Beltran Ferreiro, Leopoldo Sarra View a PDF of the paper titled A Minimal Agent for Automated Theorem Proving, by Borja Requena Pozo and 4 other authors View PDF HTML (experimental) Abstract:We propose a minimal agentic baseline that enables systematic comparison across different AI-based theorem prover architectures. This design implements the core features shared among state-of-the-art systems: iterative proof refinement, library search and context management. We evaluate our baseline using qualitatively different benchmarks and compare various popular models and design choices, and demonstrate competitive performance compared to state-of-the-art approaches, while using a significantly simpler architecture. Our results demonstrate consistent advantages of an iterative approach over multiple single-shot generations, especially in terms of sample efficiency and cost effectiveness. The implementation is released open-source as a candidate reference for future research and as an accessible prover for the community. Subjects: Artificial Intelligence (cs.AI) Cite as: arXiv:2602.24273 [cs.AI]   (or arXiv:2602.24273v1 [cs.AI] for this version)   https://doi.org/10.48550/arXiv.2602.24273 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission ...