Satallax is an automated theorem prover for higher-order logic. The particular form of higher-order logic supported by Satallax is Church’s simple type theory with extensionality and choice operators. The SAT solver MiniSat is responsible for much of the search for a proof. Satallax generates propositional clauses corresponding to rules of a complete tableau calculus and calls MiniSat periodically to test satisfiability of these clauses. Satallax is implemented in Objective Caml. You can run Satallax online at the System On TPTP website.

References in zbMATH (referenced in 14 articles , 2 standard articles )

Showing results 1 to 14 of 14.
Sorted by year (citations)

  1. Blanchette, Jasmin Christian; Böhme, Sascha; Fleury, Mathias; Smolka, Steffen Juilf; Steckermeier, Albert: Semi-intelligible Isar proofs from machine-generated proofs (2016)
  2. Brown, Chad E.; Urban, Josef: Extracting higher-order goals from the Mizar Mathematical Library (2016)
  3. Benzmüller, Christoph; Sultana, Nik; Paulson, Lawrence C.; Theiß, Frank: The higher-order prover Leo-II (2015)
  4. Kühlwein, Daniel; Urban, Josef: MaLeS: A framework for automatic tuning of automated theorem provers (2015)
  5. Wisniewski, Max; Steen, Alexander; Benzmüller, Christoph: LeoPARD -- a generic platform for the implementation of higher-order reasoners (2015)
  6. Kaliszyk, Cezary; Urban, Josef: Learning-assisted automated reasoning with $\mathsfFlyspeck$ (2014)
  7. Brown, Chad E.: Reducing higher-order theorem proving to a sequence of SAT problems (2013)
  8. Sultana, Nik; Blanchette, Jasmin Christian; Paulson, Lawrence C.: LEO-II and Satallax on the Sledgehammer test bench (2013)
  9. Benzmüller, Christoph; Gabbay, Dov; Genovese, Valerio; Rispoli, Daniele: Embedding and automating conditional logics in classical higher-order logic (2012)
  10. Brown, Chad E.: Satallax: An automatic higher-order prover (2012)
  11. Backes, Julian; Brown, Chad Edward: Analytic tableaux for higher-order logic with choice (2011)
  12. Benzmüller, Christoph: Combining and automating classical and non-classical logics in classical higher-order logics (2011)
  13. Brown, Chad E.: Reducing higher-order theorem proving to a sequence of SAT problems (2011)
  14. Sutcliffe, Geoff; Benzmüller, Christoph: Automated reasoning in higher-order logic using the TPTP THF infrastructure (2010)