Module SPredLems := SPredLemmas VSM. Import SPredLems.
Proof with simpl; auto.
induction atms... intros s [H1 H2]. split...
Qed.

Theorem cnf_correct : forall (e : entailment),
entailment_denote e =
forall s, ~ list_denote clause_denote (@andp state) TT (cnf e) s.