Previous | 
Home
Section: New Software and Platforms
SPASS-SATT
Keywords: Automated deduction - Decision
Scientific Description: SPASS -SATT is an SMT solver for the theories of linear integer arithmetic, linear rational arithmetic and mixed linear arithmetic. It features new tests for the satisfiability of unbounded systems, as well as new algorithms for the detection of integer solutions.
We further investigated the use of redundancy elimination in SAT solving and underlying implementation techniques. Our aim is a new approach to SAT solving that needs fewer conflicts (on average) and is faster than the current state-of-the art solvers. Furthermore, we have developed a new calculus and first prototypical implementation of a SAT solver with mixed OR/XOR clauses.
Functional Description: SPASS-SATT is an SMT solver for linear integer arithmetic, mixed linear arithmetic and rational linear arithmetic.
News Of The Year: The first version of SPASS-SATT was released in June 2018. It participated in SMTCOMP-2018 in the quantifier free integer and rational linear arithmetic categories. In both categories it solved more problems in a shorter period of time than any other SMT solver. With respect to the weighted bucket ranking it scored first in the linear integer category and second in the linear rational category.
-
Participants: Martin Bromberger, Mathias Fleury and Christoph Weidenbach
-
URL: https://www.mpi-inf.mpg.de/departments/automation-of-logic/software/spass-workbench/spass-satt/