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.
KeywordsReduction Rule Automate Theorem Prover Small Clause Empty Clause Soft Typing
Unable to display preview. Download preview PDF.
- Ganzinger, H., Nieuwenhuis, R.: The saturate system 1994 (1994), http://www.mpi-sb.mpg.de/SATURATE/Saturate.html
- Hillenbrand, T., Weidenbach, C.: Superposition for finite domains. Research Report MPI-I-2007-RG1-002, Max-Planck Institute for Informatics, Saarbruecken, Germany (April 2007)Google Scholar
- Horbach, M., Weidenbach, C.: Decidability results for saturation-based model building. In: Schmidt, R.A. (ed.) CADE 2009. LNCS (LNAI), vol. 5663, pp. 404–420. Springer, Heidelberg (2009)Google Scholar
- Weidenbach, C., Wischnewski, P.: Contextual rewriting in Spass. In: PAAR/ESHOL, Sydney, Australien. CEUR Workshop Proceedings, vol. 373, pp. 115–124 (2008)Google Scholar