arXiv Computation and Language By Zhuo Liu, Ding Yu, Hangfeng He

Compiler-Guided Adaptive Proof Search with Cross-Model Synergy on Context-Dependent Theorem Proving

Read the original on arXiv Computation and Language →

The paper introduces a compiler-guided adaptive proof search framework for Lean 4 theorem proving, addressing the challenge of context-dependent proofs in real-world projects. It balances exploration and exploitation by generating diverse starting points via dual-model generation and resampling when stagnation occurs, while refining promising states using compiler-grounded pairwise comparison. Experiments on seven Lean 4 projects from miniCTX‑v2 demonstrate that the method improves average pass rates by 12.8 percentage points within a pass@32 budget and reduces LLM calls by 21.9 % compared to pass@k baselines.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Computation and Language.

arXiv AI
Aug 28

HybridProver: Augmenting Theorem Proving with LLM-Driven Proof Synthesis and Refinement

HybridProver is a unified framework that combines whole-proof synthesis and tactic-based generation using proof sketches as an intermediate representation. Implemented in Isabelle/HOL, it employs two 7B-scale LLMs trained on optimized Isabelle datasets. On the miniF2F Isabelle benchmark, HybridProver achieved a 73.8% success rate, surpassing the previous state of the art of 61.9%, and ablation studies examined the effects of dataset quality, training settings, and sampling strategies.

By Jilin Hu, Jianyu Zhang, Yongwang Zhao, Talia Ringer
arXiv AI
Oct 9

LEVER: Adaptive Cost-Aware Proof Search Over AND/OR Graphs

LEVER is a new proof‑search algorithm that lets users program the objective over correct proofs and optimizes it during search. It scores partial proofs on an AND/OR graph, combining achieved objective values with predictions for open subgoals, so the objective guides search before a proof is complete. On the PutnamBench in Lean 4, LEVER reduces computational cost by 34 % and raises the solve rate from 80 % to 96 %, while also improving topical impurity and approaching refactoring for proof length.

By Nihal Jain, Shuangjie Yao, Begum Cicekdag, Zhuo Zhang, Suman Jana