ProofWatch: Watchlist Guidance for Large Theories in E

Watchlist (also hint list) is a mechanism that allows related proofs to guide a proof search for a new conjecture. This mechanism has been used with the Otter and Prover9 theorem provers, both for interactive formalizations and for human-assisted proving of open conjectures in small theories. In this work we explore the use of watchlists in large theories coming from first-order translations of large ITP libraries, aiming at improving hammer-style automation by smarter internal guidance of the ATP systems. In particular, we (i) design watchlist-based clause evaluation heuristics inside the E ATP system, and (ii) develop new proof guiding algorithms that load many previous proofs inside the ATP and focus the proof search using a dynamically updated notion of proof matching. The methods are evaluated on a large set of problems coming from the Mizar library, showing significant improvement of E’s standard portfolio of strategies, and also of the previous best set of strategies invented for Mizar by evolutionary methods.

[1]  Cezary Kaliszyk,et al.  Monte Carlo Tableau Proof Search , 2017, CADE.

[2]  Robert Veroff,et al.  Using hints to increase the effectiveness of an automated reasoning program: Case studies , 1996, Journal of Automated Reasoning.

[3]  Cezary Kaliszyk,et al.  System Description: E.T. 0.1 , 2015, CADE.

[4]  Adam Naumowicz,et al.  Mizar in a Nutshell , 2010, J. Formaliz. Reason..

[5]  Stephan Schulz.  Learning Search Control Knowledge for Equational Theorem Proving , 2001, KI/ÖGAI.

[6]  Michael Norrish,et al.  A Brief Overview of HOL4 , 2008, TPHOLs.

[7]  Demis Hassabis,et al.  Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm , 2017, ArXiv.

[8]  Josef Urban,et al.  DeepMath - Deep Sequence Models for Premise Selection , 2016, NIPS.

[9]  Josef Urban,et al.  Extending E Prover with Similarity Based Clause Selection Strategies , 2016, CICM.

[10]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[11]  Peter F. Patel-Schneider,et al.  DLP System Description , 1998, Description Logics.

[12]  Josef Urban,et al.  BliStrTune: hierarchical invention of theorem proving strategies , 2017, CPP.

[13]  Cezary Kaliszyk,et al.  Efficient Semantic Features for Automated Reasoning over Large Theories , 2015, IJCAI.

[14]  Josef Urban,et al.  MPTP 0.2: Design, Implementation, and Initial Experiments , 2006, Journal of Automated Reasoning.

[15]  Stephan Schulz,et al.  Breeding Theorem Proving Heuristics with Genetic Algorithms , 2015, GCAI.

[16]  Larry Wos,et al.  Otter - The CADE-13 Competition Incarnations , 1997, Journal of Automated Reasoning.

[17]  Cezary Kaliszyk,et al.  FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover , 2015, LPAR.

[18]  Cezary Kaliszyk,et al.  Deep Network Guided Proof Search , 2017, LPAR.

[19]  LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017 , 2017, LPAR.

[20]  Stephan Schulz,et al.  Simple and Efficient Clause Subsumption with Feature Vector Indexing , 2013, Automated Reasoning and Mathematics.

[21]  Cezary Kaliszyk,et al.  Random Forests for Premise Selection , 2015, FroCos.

[22]  Thibault Gauthier,et al.  Learning to Reason with HOL4 tactics , 2017, ICLP 2017.

[23]  Jesse Alama,et al.  Premise Selection for Mathematics by Corpus Analysis and Kernel Methods , 2011, Journal of Automated Reasoning.

[24]  Demis Hassabis,et al.  Mastering the game of Go with deep neural networks and tree search , 2016, Nature.

[25]  Andrei Voronkov,et al.  First-Order Theorem Proving and Vampire , 2013, CAV.

[26]  Stephan Schulz,et al.  Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving , 2016, IJCAR.

[27]  Rajeev Raman,et al.  SEPIA: Search for Proofs Using Inferred Automata , 2015, CADE.

[28]  Wolfgang Bibel,et al.  leanCoP: lean connection-based theorem proving , 2003, J. Symb. Comput..

[29]  Cezary Kaliszyk,et al.  A Learning-Based Fact Selector for Isabelle/HOL , 2016, Journal of Automated Reasoning.

[30]  Stephan Schulz,et al.  System Description: E 1.8 , 2013, LPAR.

[31]  Josef Urban,et al.  ENIGMA: Efficient Learning-Based Inference Guiding Machine , 2017, CICM.

[32]  Cezary Kaliszyk,et al.  Learning-Assisted Automated Reasoning with Flyspeck , 2012, Journal of Automated Reasoning.

[33]  Thibault Gauthier,et al.  Matching Concepts across HOL Libraries , 2014, CICM.

[34]  Robert Veroff,et al.  Loops with Abelian Inner Mapping Groups: An Application of Automated Deduction , 2015, Automated Reasoning and Mathematics.

[35]  Cezary Kaliszyk,et al.  Hammering towards QED , 2016, J. Formaliz. Reason..

[36]  Josef Urban,et al.  MaLeCoP Machine Learning Connection Prover , 2011, TABLEAUX.

[37]  Cezary Kaliszyk,et al.  MizAR 40 for Mizar 40 , 2013, Journal of Automated Reasoning.