The paper presents Lean-SMT, a tactic that translates Lean proof goals into SMT-LIB, obtains cvc5 proofs, and reconstructs them as kernel-checked Lean proofs, with promising results on Sledgehammer and SMT-LIB benchmarks.
Machine-Learned Premise Selection for Lean
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We introduce a machine-learning-based tool for the Lean proof assistant that suggests relevant premises for theorems being proved by a user. The design principles for the tool are (1) tight integration with the proof assistant, (2) ease of use and installation, (3) a lightweight and fast approach. For this purpose, we designed a custom version of the random forest model, trained in an online fashion. It is implemented directly in Lean, which was possible thanks to the rich and efficient metaprogramming features of Lean 4. The random forest is trained on data extracted from mathlib -- Lean's mathematics library. We experiment with various options for producing training features and labels. The advice from a trained model is accessible to the user via the suggest_premises tactic which can be called in an editor while constructing a proof interactively.
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Lean-SMT: An SMT tactic for discharging proof goals in Lean
The paper presents Lean-SMT, a tactic that translates Lean proof goals into SMT-LIB, obtains cvc5 proofs, and reconstructs them as kernel-checked Lean proofs, with promising results on Sledgehammer and SMT-LIB benchmarks.