Section: New Software and Platforms

SPASS

Keyword: First-order logic

Scientific Description: The classic SPASS is an automated theorem prover based on superposition that handles first-order logic with equality and several extensions for particular classes of theories. With version SPASS 3.9 we have stopped the development of the classic prover and have started the bottom-up development of SPASS 4.0 that will actually be a workbench of automated reasoning tools. Furthermore, we use SPASS 3.9 as a test bed for the development of new calculi.

Meanwhile we have released the second version of SPASS-IQ, our solver for linear integer arithmetic that we are currently extending to real and mixed real-integer arithmetic. We didn't release SPASS-SATT yet, instead we further investigated the use of redundency 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.

SPASS 3.9 has been used as the basis for SPASS-AR, an new approximation refinement theorem proving approach.

Functional Description: SPASS is an automated theorem prover based on superposition that handles first-order logic with equality and several extensions for particular classes of theories.

• Contact: Christoph Weidenbach

• URL: http://www.spass-prover.org/