proposition: Lemma lform_rew : forall f, lform f = match f with | LAT i => LAT i | LOP o l => LOP o (lform_app o nil (List.map (nform lform) l)) | LIMPL l r => mk_impl (lform_app LAND nil (List.map (nform lform) l)) (nform lform r) end.
proof: Proof. destruct f ; reflexivity. Qed.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause