arXiv:2507.15225cs.AIcs.LG2025-07被引 39

用通用大模型+智能代理,无需微调就能高效证明数学定理。

Solving Formal Math Problems by Decomposition and Iterative Reflection

  • 设计智能代理框架,分步分解问题并迭代修正证明
  • 在miniF2F测试集上达到95.9%成功率,超越所有现有方法
  • 适合想低成本实现自动定理证明的研究者和开发者

通用大语言模型(LLMs)在复杂推理任务中表现卓越,但在专用语言如Lean 4中生成形式化证明仍面临挑战,限制了其在自动定理证明与验证中的应用。现有方法通常需在特定语料上微调模型,成本高昂。本文提出Delta Prover,一种基于智能体的框架,通过通用LLM与Lean 4证明环境的交互,构建形式化证明,无需模型专门化。该框架核心包含两个相互依赖的新组件:用于反思性分解与迭代修复的算法框架,以及基于Lean 4的定制领域特定语言(DSL),用于简化子问题管理。Delta Prover在miniF2F测试集上达到95.9%的成功率,优于所有现有方法,包括需要模型专门化的方案。此外,其在测试时展现出更强的缩放规律。结果表明,通用大模型在有效智能体结构引导下,具备显著未被挖掘的定理证明能力,为形式化环境中鲁棒自动推理提供了一种计算高效的替代方案。

原文摘要 · Abstract (English)

General-purpose Large Language Models (LLMs) have achieved remarkable success in intelligence, performing comparably to human experts on complex reasoning tasks such as coding and mathematical reasoning. However, generating formal proofs in specialized languages like Lean 4 remains a significant challenge for these models, limiting their application in complex theorem proving and automated verification. Current approaches typically require specializing models through fine-tuning on dedicated formal corpora, incurring high costs for data collection and training. In this work, we introduce \textbf{Delta Prover}, an agent-based framework that orchestrates the interaction between a general-purpose LLM and the Lean 4 proof environment. Delta Prover leverages the reflection and reasoning capabilities of general-purpose LLMs to interactively construct formal proofs in Lean 4, circumventing the need for model specialization. At its core, the agent integrates two novel, interdependent components: an algorithmic framework for reflective decomposition and iterative proof repair, and a custom Domain-Specific Language (DSL) built upon Lean 4 for streamlined subproblem management. \textbf{Delta Prover achieves a state-of-the-art 95.9\% success rate on the miniF2F-test benchmark, surpassing all existing approaches, including those requiring model specialization.} Furthermore, Delta Prover exhibits a significantly stronger test-time scaling law compared to standard Best-of-N proof strategies. Crucially, our findings demonstrate that general-purpose LLMs, when guided by an effective agentic structure, possess substantial untapped theorem-proving capabilities. This presents a computationally efficient alternative to specialized models for robust automated reasoning in formal environments.

定理证明智能体Lean 4大模型

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。