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.8.2.tar.gz

md5=c02d63bf45357aa1d1b85846da373f48

sha512=e6f0d7f6e4fe69938ec2cc3233b0cb72dd577bfb4cc4824afe8247f5db0b6ffea2d38d73a65e7ede500d21ff8db27ed12f2c4f3245df4451d02864260ae2ddaf

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.