A Minimal Agent for Automated Theorem Proving

摘要

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. Our results demonstrate consistent advantages of an iterative approach over multiple single-shot generations, especially in terms of sample efficiency and cost effectiveness. We demonstrate competitive performance compared to state-of-the-art approaches, while using a significantly simpler architecture. We release our open-source implementation as a candidate reference for future research and as an accessible prover for the community.