SPASS Version 3.5

SPASS is an automated theorem prover for full first-order logic with equality and a number of non-classical logics. This system description provides an overview of our recent developments in SPASS 3.5 including subterm contextual rewriting, improved split backtracking, a significantly faster FLOTTER implementation with additional control flags, completely symmetric implementation of forward and backward redundancy criteria, faster parsing with improved support for big files, faster and extended sort module, and support for include commands in input files. Finally, SPASS 3.5 can now parse files in TPTP syntax, comes with a new converter tptp2dfg and is distributed under a BSD style license.

[1]  Christoph Weidenbach,et al.  Contextual Rewriting in SPASS , 2008, PAAR/ESHOL.

[2]  Harald Ganzinger,et al.  Inductive Theorem Proving by Consistency for First-Order Clauses , 1992, CTRS.

[3]  Christoph Weidenbach,et al.  Labelled splitting , 2008, Annals of Mathematics and Artificial Intelligence.

[4]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[5]  Harald Ganzinger,et al.  Rewrite-Based Equational Theorem Proving with Selection and Simplification , 1994, J. Log. Comput..

[6]  Christoph Weidenbach,et al.  Unification in sort theories and its applications , 1996, Annals of Mathematics and Artificial Intelligence.

[7]  Christoph Weidenbach,et al.  Superposition for Finite Domains , 2007 .

[8]  Geoff Sutcliffe,et al.  The TPTP Problem Library , 1994, Journal of Automated Reasoning.

[9]  Christoph Weidenbach,et al.  Soft Typing for Ordered Resolution , 1997, CADE.

[10]  Christoph Weidenbach,et al.  System Description: SpassVersion 3.0 , 2007, CADE.

[11]  Christoph Weidenbach,et al.  Decidability Results for Saturation-Based Model Building , 2009, CADE.

[12]  Christoph Weidenbach,et al.  Combining Superposition, Sorts and Splitting , 2001, Handbook of Automated Reasoning.