SAT solving experiments in Vampire

4 pages•Published: February 23, 2016

Armin Biere, Ioan Dragan, Laura Kovács and Andrei Voronkov

Abstract

In order to better understand how well a state of the art SAT solver would behave in the framework of a first-order automated theorem prover we have decided to integrate Lingeling, best performing SAT solver, inside Vampire’s AVATAR framework. In this paper we propose two ways of integrating a SAT solver inside of Vampire and evaluate overall performance of this combination. Our experiments show that by using a state of the art SAT solver in Vampire we manage to solve more problems. Surprisingly though, there are cases where combination of the two solvers does not always prove to generate best results.

Keyphrases: automated theorem proving, avatar, sat solving, vampire

In: Laura Kovács and Andrei Voronkov (editors). Proceedings of the 1st and 2nd Vampire Workshops, vol 38, pages 29-32.

Links:	https://easychair.org/publications/paper/Ws
	https://doi.org/10.29007/5l47

BibTeX entry

@inproceedings{Vampire2014and2015:SAT_solving_experiments_Vampire,
  author    = {Armin Biere and Ioan Dragan and Laura Kovács and Andrei Voronkov},
  title     = {SAT solving experiments in Vampire},
  booktitle = {Proceedings of the 1st and 2nd Vampire Workshops},
  editor    = {Laura Kovács and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {38},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/Ws},
  doi       = {10.29007/5l47},
  pages     = {29-32},
  year      = {2016}}

Download PDF Open PDF in browser