Documentation

Lean.Meta.Tactic.Grind.Arith.Cutsat.Proof

  • ctx : Expr
  • ctx' : Expr

    Variables before reordering

  • natCtx : Expr
  • ringCtx : Expr
  • unordered : Bool

    unordered is true if we entered a .reorder c justification. The variables in c and its dependencies are unordered.

Instances For
    @[reducible, inline]

    Auxiliary monad for constructing cutsat proofs.

    Equations
      Instances For

        A cutsat proof may depend on decision variables. We collect them and perform non chronological backtracking.