paper-with-me

Papers

LEGO-Prover: Neural Theorem Proving with Growing Libraries

2023-10-01 · Haiming Wang, Huajian Xin, Chuanyang Zheng, Lin Li, Zhengying Liu, Qingxing Cao, Yinya Huang, Jing Xiong, Han Shi, Enze Xie, Jian Yin, Zhenguo Li, Heng Liao, Xiaodan Liang

Despite the success of large language models (LLMs), the task of theorem proving still remains one of the hardest reasoning tasks that is far from being fully solved. Prior methods using language models have demonstrated promising results, but they still struggle to prove even middle school level theorems. One common limitation of these methods is that they assume a fixed theorem library during the whole theorem proving process. However, as we all know, creating new useful theorems or even new theories is not only helpful but crucial and necessary for advancing mathematics and proving harder and deeper results. In this work, we present LEGO-Prover, which employs a growing skill library containing verified lemmas as skills to augment the capability of LLMs used in theorem proving. By constructing the proof modularly, LEGO-Prover enables LLMs to utilize existing skills retrieved from the library and to create new skills during the proving process. These skills are further evolved (by prompting an LLM) to enrich the library on another scale. Modular and reusable skills are constantly added to the library to enable tackling increasingly intricate mathematical problems. Moreover, the learned library further bridges the gap between human proofs and formal proofs by making it easier to impute missing steps. LEGO-Prover advances the state-of-the-art pass rate on miniF2F-valid (48.0% to 57.0%) and miniF2F-test (45.5% to 47.1%). During the proving process, LEGO-Prover also manages to generate over 20,000 skills (theorems/lemmas) and adds them to the growing library. Our ablation study indicates that these newly added skills are indeed helpful for proving theorems, resulting in an improvement from a success rate of 47.1% to 50.4%. We also release our code and all the generated skills.

📄 PDF Abstract BibTeX arXiv:2310.00656

Code (1)

wiio12/LEGO-Prover 공식 구현

Tasks

Automated Theorem Proving

Methods 이 논문이 사용한 방법론

Library 설명 없음

Similar Papers 제목 키워드 기반

DreamProver: Evolving Transferable Lemma Libraries via a Wake-Sleep Theorem-Proving Agent

2026-04-29 · Youyuan Zhang, Jialiang Sun, Hangrui Bi, Chuqin Geng 외 arxiv

We introduce DreamProver, an agentic framework that leverages a "wake-sleep" program induction paradigm to discover reusable lemmas for formal theorem proving. Existing approaches either rely on fixed lemma libraries, wh…

Proof Recommendation System for the HOL4 Theorem Prover

2024-12-31 · Nour Dekhil, Adnan Rashid, Sofiene Tahar

We introduce a proof recommender system for the HOL4 theorem prover. Our tool is built upon a transformer-based model [2] designed specifically to provide proof assistance in HOL4. The model is trained to discern theorem…

Automated Theorem ProvingRecommendation Systems

Proof Artifact Co-training for Theorem Proving with Language Models

2021-02-11 · ICLR 2022 4 · Jesse Michael Han, Jason Rute, Yuhuai Wu, Edward W. Ayers 외

Labeled data for imitation learning of theorem proving in large libraries of formalized mathematics is scarce as such libraries require years of concentrated effort by human specialists to be built. This is particularly …

Automated Theorem ProvingImitation LearningLanguage ModelingLanguage Modelling

Sharing HOL4 and HOL Light proof knowledge

2015-09-11 · Thibault Gauthier, Cezary Kaliszyk

New proof assistant developments often involve concepts similar to already formalized ones. When proving their properties, a human can often take inspiration from the existing formalized proofs available in other provers…

Hammering Mizar by Learning Clause Guidance

2019-04-02 · Jan Jakubův, Josef Urban

We describe a very large improvement of existing hammer-style proof automation over large ITP libraries by combining learning and theorem proving. In particular, we have integrated state-of-the-art machine learners into …

Automated Theorem Proving