Experimenting with SAT Solvers in Vampire

  • Armin Biere
  • Ioan Dragan
  • Laura Kovács
  • Andrei Voronkov
Conference paper

DOI: 10.1007/978-3-319-13647-9_39

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8856)
Cite this paper as:
Biere A., Dragan I., Kovács L., Voronkov A. (2014) Experimenting with SAT Solvers in Vampire. In: Gelbukh A., Espinoza F.C., Galicia-Haro S.N. (eds) Human-Inspired Computing and Its Applications. MICAI 2014. Lecture Notes in Computer Science, vol 8856. Springer, Cham

Abstract

Recently, a new reasoning framework, called AVATAR, integrating first-order theorem proving with SAT solving has been proposed. In this paper, we experimentally analyze the behavior of various SAT solvers within first-order proving. For doing so, we first integrate the Lingeling SAT solver within the first-order theorem prover Vampire and compare the behavior of such an integration with Vampire using a less efficient SAT solver. Interestingly, our experiments on first-order problems show that using the best SAT solvers within AVATAR does not always give best performance. There are some problems that could be solved only by using a less efficient SAT solver than Lingeling. However, the integration of Lingeling with Vampire turned out to be the best when it came to solving most of the hard problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Armin Biere
    • 1
  • Ioan Dragan
    • 2
  • Laura Kovács
    • 2
    • 3
  • Andrei Voronkov
    • 4
  1. 1.Johannes Kepler UniversityLinzAustria
  2. 2.Vienna University of TechnologyViennaAustria
  3. 3.Chalmers University of TechnologyGothenburgSweden
  4. 4.The University of ManchesterManchesterUK

Personalised recommendations