A Minimalist Proof Language for Neural Theorem Proving over Isabelle/HOL
Qiyuan Xu, Renxi Wang, Peixin Wang, Haonan Li, Conrad Watt
摘要
Neural Theorem Proving (NTP) employs Large Language Models (LLMs) to automate formal proofs in proof assistants. While LLMs have achieved relatively remarkable success in informal reasoning tasks using natural languages, the transition to mechanized formal theorem proving presents persistent challenges. Mechanized proof languages often contain many syntactic constructs and diverse, specialized proof tactics, which facilitate expert use but have no direct counterpart in informal mathematical proofs. These prover-specific idioms represent an additional burden for LLM-based NTPs that might be otherwise successful in generating informal proofs. Seeking to bridge this gap between formal proof construction and informal reasoning, in order to better facilitate NTP, this work approaches these challenges from a language design perspective. We look at common reasoning patterns in informal proofs and in existing mechanized proofs, and design Minilang (formally named Isabelle/Minilang), a minimalist proof language that captures these reasoning patterns. In contrast to proof languages (informal and formal) that often feature a large collection of operations with unclear semantic boundaries, Minilang is deliberately kept minimalist – its core design comprises only 10 proof operations, each with clear semantic distinctions. We further develop a rule-based translator from Isabelle’s proof language (Isar) to Minilang, translating ∼340,000 existing Isabelle proofs with an ∼85% success rate. Using this translated corpus, we finetune two LLMs to compare machine learning performance on Minilang versus the original Isar language. Experiments show Minilang benefits the two LLMs by improving the pass@1 success rate on the PISA benchmark by up to 20/29 percentage points in comparison to the Isar-based LLMs w/wo Sledgehammer. The pass@1 rate reaches 69.1%, exceeding the prior work Baldur’s pass@64 (65.7%); the pass@8 rate reaches 79.2%, exceeding the state-of-the-art on PISA (71.0%) achieved by Magnushammer.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper10
- Llemma: An Open Language Model for MathematicsZhangir Azerbayev, Hailey Schoelkopf, Keiran Paster, Marco Dos Santos 等ICLR 2024 · 被引用 433 次
- Thor: Wielding Hammers to Integrate Language Models and Automated Theorem ProversAlbert Qiaochu Jiang, Wenda Li, Szymon Tworkowski, Konrad Czechowski 等NeurIPS 2022 · 被引用 154 次
- Graph Representations for Higher-Order Logic and Theorem ProvingAditya Paliwal, Sarah M. Loos, Markus N. Rabe, Kshitij Bansal 等AAAI 2020 · 被引用 110 次
- Baldur: Whole-Proof Generation and Repair with Large Language ModelsEmily First, Markus N. Rabe, Talia Ringer, Yuriy BrunFSE 2023 · 被引用 89 次
- IsarStep: a Benchmark for High-level Mathematical ReasoningWenda Li, Lei Yu, Yuhuai Wu, Lawrence C. PaulsonICLR 2021 · 被引用 69 次
相关 Paper
- Autoformalization with Large Language ModelsYuhuai Wu, Albert Qiaochu Jiang, Wenda Li, Markus N. Rabe 等NeurIPS 2022 · 被引用 364 次
- Enhancing Neural Theorem Proving via High-Quality Proof Selection and Verifier FeedbackXiaoxue Zhu, Jilin Hu, Fuyuan Zhang, Jianyu Zhang 等ICML 2026
- Magnushammer: A Transformer-Based Approach to Premise SelectionMaciej Mikula, Szymon Tworkowski, Szymon Antoniak, Bartosz Piotrowski 等ICLR 2024 · 被引用 62 次
- ProofAug: Efficient Neural Theorem Proving via Fine-grained Proof Structure AnalysisHaoxiong Liu, Jiacheng Sun, Zhenguo Li, Andrew C. YaoICML 2025
- Don't Trust: Verify - Grounding LLM Quantitative Reasoning with AutoformalizationJin Peng Zhou, Charles Staats, Wenda Li, Christian Szegedy 等ICLR 2024 · 被引用 72 次
