fact: Fixpoint prover (thy: ThyP) (use_prover: bool) (n:nat) (st:state) (g : option HFormula) : result state (hmap * list conflict_clause * LitSet.t) := match n with | O => Fail OutOfFuel | S n => let ProverTRec := prover thy use_prover n in seq_prover (prover_unit_propagation n) (seq_prover (prover_case_split ProverTRec) (seq_prover (prover_impl_arrows ProverTRec) (prover_thy ProverTRec thy use_prover))) st g end.
imports: Cdcl.PatriciaR Cdcl.KeyInt Cdcl.ReifClasses Cdcl.Lib Bool Setoid ZifyBool ZArith Uint63 Lia List Cdcl.Syntax Cdcl.Clause