package msat

You can search for identifiers within the package.

in-package search v0.2.0

Library containing a SAT solver that can be parametrized by a theory

Install

Dune Dependency

github.com Readme Changelog Edit opam file Versions (16)

Authors

Maintainers

Sources

v0.9.1.tar.gz

md5=ba623630b0b8e0edc016079dd214c80b

sha512=51c133cefe8550125e7b1db18549e893bac15663fdd7a9fac87235c07de755f39eab9fc3cfdf6571612fd79b3d5b22f49f459581b480c7349bacddf2618c8a99

doc/msat.backend/Msat_backend/Coq/Simple/argument-2-A/index.html

Parameter `Simple.A`

Term printing for Coq

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.