ProofWatch Meets ENIGMA: First Experiments

8 pages•Published: November 18, 2018

Zarathustra Goertzel, Jan Jakubuv and Josef Urban

Abstract

Watchlist (also hint list) is a technique that allows lemmas from related proofs to guide a saturation-style proof search for a new conjecture. ProofWatch is a recent watchlist-style method that loads many previous proofs inside the ATP, maintains their completion ratios during the proof search and focuses the search by following the most completed proofs. In this work, we start to use the dynamically changing vector of proof completion ratios as additional information about the saturation-style proof state for statistical machine learning methods that evaluate the generated clauses. In particular, we add the proof completion vectors to ENIGMA (efficient learning-based inference guiding machine) and evaluate the new method on the MPTP Challenge benchmark, showing moderate improvement in E’s performance over ProofWatch and ENIGMA.

In: Gilles Barthe, Konstantin Korovin, Stephan Schulz, Martin Suda, Geoff Sutcliffe and Margus Veanes (editors). LPAR-22 Workshop and Short Paper Proceedings, vol 9, pages 15-22.

Links:	https://easychair.org/publications/paper/28xp
	https://doi.org/10.29007/z7qx

BibTeX entry

@inproceedings{LPAR-IWIL2018:ProofWatch_Meets_ENIGMA_First,
  author    = {Zarathustra Goertzel and Jan Jakubuv and Josef Urban},
  title     = {ProofWatch Meets ENIGMA: First Experiments},
  booktitle = {LPAR-22 Workshop and Short Paper Proceedings},
  editor    = {Gilles Barthe and Konstantin Korovin and Stephan Schulz and Martin Suda and Geoff Sutcliffe and Margus Veanes},
  series    = {Kalpa Publications in Computing},
  volume    = {9},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2515-1762},
  url       = {/publications/paper/28xp},
  doi       = {10.29007/z7qx},
  pages     = {15-22},
  year      = {2018}}

Download PDF Open PDF in browser