A modular library for CDCL(T) SMT solvers, with [wip] proof generation.
Find a file
Guillaume Bury 9dadb67fc9 [bugfix] Sort false atoms by levels in new clauses
When a new clauses is added and it is a conflict (i.e all atoms
are false), one must take care of which literals to watch.
In order to work, the watched literals must be those with the higher
decision levels, or else the watched literals might not react when
needed. This is fixed by sorting the literals in decreasing order of
decision level when adding a new clause which happens to be false in the
current trail.
2016-07-16 15:55:26 +02:00
backend Res now includes solver type 2015-10-02 13:30:32 +02:00
docs added minisat paper 2014-11-03 23:28:27 +01:00
sat Update for compatibility with ocaml 4.00.1 2016-02-29 13:43:46 +01:00
smt Update for compatibility with ocaml 4.00.1 2016-02-29 13:43:46 +01:00
solver [bugfix] Sort false atoms by levels in new clauses 2016-07-16 15:55:26 +02:00
tests Cleaned makefile a bit + moved the testing binary 2016-01-30 17:02:24 +01:00
util [bugfix] termination check after full slice was wrong 2016-03-04 16:30:51 +01:00
.gitignore Cleaned makefile a bit + moved the testing binary 2016-01-30 17:02:24 +01:00
.header copyright header in .header; authors in opam file 2014-11-04 17:59:58 +01:00
.merlin Changed internal representation of proofs 2015-07-09 16:29:57 +02:00
.ocp-indent Everything has now been properly indented with ocp-indent. 2014-10-31 16:40:59 +01:00
_tags Remember more added clauses 2016-07-13 16:23:34 +02:00
LICENSE update of license 2014-10-29 13:42:53 +01:00
main.ml Small update to tool doc 2016-02-12 14:08:27 +01:00
Makefile Cleaned makefile a bit + moved the testing binary 2016-01-30 17:02:24 +01:00
META get rid of dependency on unix 2016-01-20 20:13:32 +01:00
msat.mlpack Big cleanup of interfaces. Breaks retro-compat ! 2016-01-31 02:09:16 +01:00
msat.odocl Fixed documentation generation 2016-02-05 14:32:31 +01:00
opam Propagation reasons are now far more explicit 2016-04-15 12:09:23 +02:00
README.md Update to Msat.Solver arguments in readme 2016-04-15 13:41:41 +02:00
TODO.md A bit of restructuring to have cleaner dependencies between fonctors 2015-07-21 19:20:40 +02:00

MSAT

MSAT is an OCaml library that features a modular SAT-solver and some extensions (including SMT). This is work in progress.

It derives from Alt-Ergo Zero.

This program is distributed under the Apache Software License version 2.0. See the enclosed file LICENSE.

USAGE

Generic SAT/SMT Solver

A modular implementation of the SMT algorithm can be found in the Msat.Solver module, as a functor which takes two modules :

  • A representation of formulas (which implements the Formula_intf.S signature)

  • A theory (which implements the Theory_intf.S signature) to check consistence of assertions.

  • A dummy empty module to ensure generativity of the solver (solver modules heavily relies on side effects to their internal state)

Sat Solver

A ready-to-use SAT solver is available in the Sat module. It can be used as shown in the following code :

    (* Module initialization *)
    module F = Msat.Sat.Tseitin
    module Sat = Msat.Sat.Make()

    (* We create here two distinct atoms *)
    let a = Sat.new_atom () (* A 'new_atom' is always distinct from any other atom *)
    let b = Sat.make 1      (* Atoms can be created from integers *)

    (* Let's create some formulas *)
    let p = F.make_atom a
    let q = F.make_atom b
    let r = F.make_and [p; q]
    let s = F.make_or [F.make_not p; F.make_not q]

    (* We can try and check the satisfiability of the given formulas *)
    Sat.assume (F.make_cnf r)
    let _ = Sat.solve ()        (* Should return Sat.Sat *)

    (* The Sat solver has an incremental mutable state, so we still have
     * the formula 'r' in our assumptions *)
    Sat.assume (F.make_cnf s)
    let _ = Sat.solve ()        (* Should return Sat.Unsat *)

INSTALLATION

Via opam

Once the package is on opam, just opam install msat. For the development version, use:

opam pin add msat https://github.com/Gbury/mSAT.git

Manual installation

You will need ocamlfind. The command is:

make install