REFACTOR: Learning to Extract Theorems from Proofs
Jin Peng Zhou, Yuhuai Wu, Qiyang Li, Roger Baker Grosse
摘要
Human mathematicians are often good at recognizing modular and reusable theorems that make complex mathematical results within reach. In this paper, we propose a novel method called theoREm-from-prooF extrACTOR (REFACTOR) for training neural networks to mimic this ability in formal mathematical theorem proving. We show on a set of unseen proofs, REFACTOR is able to extract 19.6% of the theorems that humans would use to write the proofs. When applying the model to the existing Metamath library, REFACTOR extracted 16 new theorems. With newly extracted theorems, we show that the existing proofs in the MetaMath database can be refactored. The new theorems are used very frequently after refactoring, with an average usage of 733.5 times, and help shorten the proof lengths. Lastly, we demonstrate that the prover trained on the new-theorem refactored dataset proves more test theorems and outperforms state-of-the-art baselines by frequently leveraging a diverse set of newly extracted theorems. Code can be found at https://github.com/jinpz/refactor .
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- ProofOptimizer: Training Language Models to Simplify Proofs without Human DemonstrationsAlex Gu, Bartosz Piotrowski, Fabian Gloeckle, Kaiyu Yang 等ICLR 2026 · 被引用 11 次
- Varying Shades of Wrong: Aligning LLMs with Wrong Answers OnlyJihan Yao, Wenxuan Ding, Shangbin Feng, Lucy Lu Wang 等ICLR 2025
- Automated Discovery of Tactic Libraries for Interactive Theorem ProvingYutong Xin, Jimmy Xin, Gabriel Poesia, Noah D. Goodman 等OOPSLA 2025
- BC-Prover: Backward Chaining Prover for Formal Theorem ProvingYuhang He, Jihai Zhang, Jianzhu Bao, Fangquan Lin 等EMNLP 2024
- Divide and Abstract: Autoformalization via Decomposition and Abstraction LearningMarcus J. Min, Yeqi Gao, Wilson Sy, Zhaoyu Li 等ICLR 2026
它引用的顶会 Paper8
- Deep Learning For Symbolic MathematicsGuillaume Lample, François ChartonICLR 2020 · 被引用 477 次
- IsarStep: a Benchmark for High-level Mathematical ReasoningWenda Li, Lei Yu, Yuhuai Wu, Lawrence C. PaulsonICLR 2021 · 被引用 69 次
- Mathematical Reasoning via Self-supervised Skip-tree TrainingMarkus Norman Rabe, Dennis Lee, Kshitij Bansal, Christian SzegedyICLR 2021 · 被引用 65 次
- Compositional generalization through abstract representations in human and artificial neural networksTakuya Ito, Tim Klinger, Douglas Schultz, John Murray 等NeurIPS 2022 · 被引用 65 次
- Learning to Prove Theorems by Learning to Generate TheoremsMingzhe Wang, Jia DengNeurIPS 2020 · 被引用 60 次
相关 Paper
- HyperTree Proof Search for Neural Theorem ProvingGuillaume Lample, Timothée Lacroix, Marie-Anne Lachaux, Aurélien Rodriguez 等NeurIPS 2022 · 被引用 271 次
- NaturalProver: Grounded Mathematical Proof Generation with Language ModelsSean Welleck, Jiacheng Liu, Ximing Lu, Hannaneh Hajishirzi 等NeurIPS 2022 · 被引用 108 次
- ImProver: Agent-Based Automated Proof OptimizationRiyaz Ahuja, Jeremy Avigad, Prasad Tetali, Sean WelleckICLR 2025
- LEGO-Prover: Neural Theorem Proving with Growing LibrariesHaiming Wang, Huajian Xin, Chuanyang Zheng, Zhengying Liu 等ICLR 2024 · 被引用 125 次
- Mathesis: Towards Formal Theorem Proving from Natural LanguagesXuejun Yu, Jianyuan Zhong, Zijin Feng, Pengyi Zhai 等ICLR 2026 · 被引用 15 次
