Author:   Karsten Scheibler
Homepage: http://projects.informatik.uni-freiburg.de/projects/isat3/
eMail:    scheibler@informatik.uni-freiburg.de


  =======================
  [1] GENERAL INFORMATION
  =======================


iSAT3 is a satisfiability checker for Boolean combinations of arithmetic
constraints over real- and integer-valued variables. Those constraints
may contain linear and non-linear arithmetic as well as transcendental
functions. iSAT3 is the third implementation of the iSAT algorithm.
The two preceding implementations are:
    1) HySAT, http://hysat.informatik.uni-oldenburg.de/
    2) iSAT, http://isat.gforge.avacs.org/

All three implementations share the same major core principles of tightly
integrating ICP into the CDCL framework. But while the core solvers of
HySAT and iSAT operate on simple bounds, the core of iSAT3 uses literals
and additionally utilizes an ASG for more advanced formula preprocessing.
iSAT3 understands the same input file format as HySAT and iSAT. 

For more information about the iSAT algorithm you might look at:

    Martin Fraenzle, Christian Herde, Tino Teige, Stefan Ratschan,
    Tobias Schubert: "Efficient Solving of Large Non-Linear Arithmetic
    Constraint Systems with Complex Boolean Structure.",
    Journal on Satisfiability, Boolean Modeling, and Computation,
    Volume 1 (2007), pages 209-236.

For more information about iSAT3 yout might look at:

    Karsten Scheibler, Stefan Kupferschmid, Bernd Becker:
    "Recent Improvements in the SMT Solver iSAT",
    MBMV 2013, pages 231-241.


This archive contains an iSAT3 binary and the library version of iSAT3.
Please consult the iSAT3-Manual for further usage information.
