Article · Wikipedia archive · Last revised Jun 5, 2026

SPASS

SPASS is an automated theorem prover for first-order logic with equality developed at the Max Planck Institute for Computer Science and using the superposition calculus. The name originally stood for Synergetic Prover Augmenting Superposition with Sorts. The theorem-proving system is released under the FreeBSD license.

Last revised
Jun 5, 2026
Read time
≈ 1 min
Length
184 w
Citations
3
Source
Wikipedia ↗

SPASS is an automated theorem prover for first-order logic with equality developed at the Max Planck Institute for Computer Science and using the superposition calculus. The name originally stood for Synergetic Prover Augmenting Superposition with Sorts. The theorem-proving system is released under the FreeBSD license.1

An extension of SPASS called SPASS-XDB added support for on-the-fly retrieval of positive unit axioms from external sources.2 SPASS-XDB can thus incorporate facts coming from relational databases, web services, or linked data servers. Support for arithmetic using Mathematica was also added.3

References

References

  1. "Max-Planck-Institut für Informatik - Automation of Logic: Spass". Spass-prover.org. 2010-05-28. Retrieved 2016-08-10.
  2. Suda, Martin; Sutcliffe, Geoff; Wischnewski, Patrick; Lamotte-Schubert, Manuel; De Melo, Gerard (2009). "External Sources of Axioms in Automated Theorem Proving". KI 2009: Advances in Artificial Intelligence. Lecture Notes in Computer Science. Vol. 5803. pp. 281–288. doi:10.1007/978-3-642-04617-9_36. ISBN 978-3-642-04616-2. Retrieved 2016-08-10.
  3. David Stanovsky; Martin Suda; Geoff Sutcliffe. "SPASS-XDB goes Mathematical" (PDF). Karlin.mff.cuni.cz. Retrieved 2016-08-10.
Sources

Sources

  • Weidenbach, Christoph; Dimova, Dilyana; Fietzke, Arnaud; Kumar, Rohit; Suda, Martin; Wischnewski, Patrick (2009), "SPASS Version 3.5", CADE-22: 22nd International Conference on Automated Deduction, Springer, pp. 140–145.
External links