Documentation

Std.Sat.CNF.RelabelFin

Obtain the literal with the largest identifier in c.

Equations
Instances For
    theorem Std.Sat.CNF.Clause.of_maxLiteral_eq_some {maxLit : Nat} (c : Clause Nat) (h : c.maxLiteral = some maxLit) (lit : Nat) :
    Mem lit clit maxLit

    Obtain the literal with the largest identifier in f.

    Equations
    Instances For
      theorem Std.Sat.CNF.of_maxLiteral_eq_some' {maxLit localMax : Nat} (f : CNF Nat) (h : f.maxLiteral = some maxLit) (clause : Clause Nat) :
      clause fclause.maxLiteral = some localMaxlocalMax maxLit
      theorem Std.Sat.CNF.of_maxLiteral_eq_some {maxLit : Nat} (f : CNF Nat) (h : f.maxLiteral = some maxLit) (lit : Nat) :
      Mem lit flit maxLit

      An upper bound for the amount of distinct literals in f.

      Equations
      Instances For
        theorem Std.Sat.CNF.lt_numLiterals {v : Nat} {f : CNF Nat} (h : Mem v f) :
        theorem Std.Sat.CNF.numLiterals_pos {v : Nat} {f : CNF Nat} (h : Mem v f) :

        Relabel f to a CNF formula with a known upper bound for its literals.

        This operation might be useful when e.g. using the literals to index into an array of known size without conducting bounds checks.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For