Section: New Software and Platforms

SPASS: An Automated Theorem Prover for First-Order Logic With Equality

Participants : Martin Bromberger, Arnaud Fietzke, Thomas Sturm, Marco Voigt, Uwe Waldmann, Christoph Weidenbach [contact] .

SPASS is an automated theorem prover based on superposition that handles first-order logic with equality and several extensions for particular classes of theories. It has been developed since the mid-1990s at the Max-Planck Institut für Informatik in Saarbrücken. Version 3.7 is the current stable release; it is distributed under the FreeBSD license at http://www.spass-prover.org .

The next major release of SPASS will mainly focus on improved theory support: many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of arithmetic. In 2014, we have continued our efforts to improve the superposition calculus as well as to develop dedicated arithmetic decision procedures for various arithmetic theories. Our results are:

  • specialized reasoning support for finite subsets,

  • specialized decision procedures for linear real arithmetic with one quantifier alternation,

  • new efficient and complete procedures for (mixed) linear integer arithmetic,

  • decidability results and respective procedures for various combinations of linear arithmetic with first-order logic.