msat
Library containing a SAT solver that can be parametrized by a theory
1024" x-on:close-sidebar="sidebar=window.innerWidth > 1024 && true">
package msat
-
msat
-
-
msat.backend
-
-
msat.backtrack
-
msat.tseitin
Legend:
Library
Module
Module type
Parameter
Class
Class type
Library
Module
Module type
Parameter
Class
Class type
Library msat.backend
type hyp = S.formula list
val prove_hyp : Format.formatter -> string -> hyp -> unit
val prove_lemma : Format.formatter -> string -> S.lemma -> unit
val prove_assumption : Format.formatter -> string -> S.formula -> unit
Proving function for hypotheses, lemmas and assumptions. prove_x fmt name x
should prove x
, and be such that after executing it, x
is among the coq hypotheses under the name name
. The hypothesis should be the encoding of the given clause, i.e for a clause a \/ not b \/ c
, the proved hypothesis should be: ~ a -> ~ ~ b -> ~ c -> False
, keeping the same order as the one in the atoms array of the clause.
ON THIS PAGE
No table of contents