The Isabelle ENIGMA

05/04/2022
by   Zarathustra A. Goertzel, et al.
0

We significantly improve the performance of the E automated theorem prover on the Isabelle Sledgehammer problems by combining learning and theorem proving in several ways. In particular, we develop targeted versions of the ENIGMA guidance for the Isabelle problems, targeted versions of neural premise selection, and targeted strategies for E. The methods are trained in several iterations over hundreds of thousands untyped and typed first-order problems extracted from Isabelle. Our final best single-strategy ENIGMA and premise selection system improves the best previous version of E by 25.3 seconds, outperforming also all other previous ATP and SMT systems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/26/2016

BliStrTune: Hierarchical Invention of Theorem Proving Strategies

Inventing targeted proof search strategies for specific problem sets is ...
research
04/02/2019

Hammering Mizar by Learning Clause Guidance

We describe a very large improvement of existing hammer-style proof auto...
research
03/07/2019

ENIGMA-NG: Efficient Neural and Gradient-Boosted Inference Guidance for E

We describe an efficient implementation of clause guidance in saturation...
research
01/28/2020

Subsumption Demodulation in First-Order Theorem Proving

Motivated by applications of first-order theorem proving to software ana...
research
02/10/2021

Learning Equational Theorem Proving

We develop Stratified Shortest Solution Imitation Learning (3SIL) to lea...
research
01/06/2018

Multilabeled versions of Sperner's and Fan's lemmas and applications

We propose a general technique related to the polytopal Sperner lemma fo...
research
03/08/2023

Magnushammer: A Transformer-based Approach to Premise Selection

Premise selection is a fundamental problem of automated theorem proving....

Please sign up or login with your details

Forgot password? Click here to reset