LeanConjecturer: Automatic Generation of Mathematical Conjectures for Theorem Proving
OMRON SINIC X Corporation(OMRON SINIC X公司);Department of Physics, Kyoto University(京都大学物理系);AI Innovation Research Promotion Center, Shiga University(Shiga大学AI创新研究促进中心);Research and Development Center for Large Language Models, National Institute of Informatics(国家信息研究所大型语言模型研究开发中心);National Institute of Science and Technology Policy (NISTEP)(科学技术政策研究所)
We introduce LeanConjecturer, a pipeline for automatically generating university-level mathematical conjectures in Lean 4 using Large Language Models (LLMs). Our hybrid approach combines rule-based context extraction with LLM-based theorem statement generation, addressing the data scarcity challenge in formal theorem proving. Through iterative generation and evaluation, LeanConjecturer produced 12,289 conjectures from 40 Mathlib seed files, with 3,776 identified as syntactically valid and non-trivial, that is, cannot be proven by \texttt{aesop} tactic. We demonstrate the utility of these generated conjectures for reinforcement learning through Group Relative Policy Optimization (GRPO), showing that targeted training on domain-specific conjectures can enhance theorem proving capabilities. Our approach generates 103.25 novel conjectures per seed file on average, providing a scalable solution for creating training data for theorem proving systems. Our system successfully verified several non-trivial theorems in topology, including properties of semi-open, alpha-open, and pre-open sets, demonstrating its potential for mathematical discovery beyond simple variations of existing results.
TheoremBench: Evaluating LLMs on Theorem Proving in Formal Mathematics
Skolkovo Institute of Science and Technology(斯科尔科沃科学技术研究所);HSE University(高等经济大学);Artificial Intelligence Research Institute(人工智能研究所);Sberbank(俄罗斯联邦储蓄银行)
ATG: Benchmarking Automated Theorem Generation for Generative Language Models
Shenzhen Campus of Sun Yat-Sen University(中山大学深圳校区);City University of Hong Kong(香港城市大学);The Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州));DarkMatter AI Research(DarkMatter AI研究)
Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairs
D-CHAB, ETH Zurich, Zurich, Switzerland.;D-INFK, ETH Zurich, Zurich, Switzerland.;ETH AI Center, Zurich, Switzerland.;University of Pennsylvania, PA, USA.;Independent Researcher.
Rango: Adaptive Retrieval-Augmented Proving for Automated Software Verification
University of California San Diego(加利福尼亚大学圣迭戈分校);INESC-ID(INESC-ID(里斯本计算机与系统工程研究所));IST, University of Lisbon(里斯本大学高等技术学院);Imperial College London(伦敦帝国学院);University of Massachusetts Amherst(马萨诸塞大学阿默斯特分校)
Rango 是一个面向 Coq 的全自动证明合成工具,通过在每步证明中利用检索增强技术自适应地引入相关前提和相似证明,在自建基准上比 SOTA 工具 Tactician 多证明 29% 的定理。