Experimenting with SAT solvers in vampire
Paper i proceeding, 2014

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 firstorder 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.


A. Biere

Johannes Kepler Universität Linz (JKU)

I. Dragan

Technische Universität Wien

Laura Kovacs

Chalmers, Data- och informationsteknik, Programvaruteknik

A. Voronkov

University of Manchester

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 8856 431-442


Data- och informationsvetenskap





Mer information

Senast uppdaterat