law fskip

lawful-bytes@0.1.1.0 · proof_fast_find.bend:641

import Base
import lawful-bytes@0.1.1.0/defs.bend as D
import lawful-bytes@0.1.1.0/fast.bend as FA
import lawful-bytes@0.1.1.0/proof_core.bend as C
import lawful-bytes@0.1.1.0/proof_fast_word.bend as FW
import lawful-arrays@0.1.0.0/proof_tree.bend as P

641# An unflagged word that is not the last: the search goes on at the next word.
642law fskip:
643  for +len: U32
644  for +t: P.Tree<U32>
645  for +d: Nat
646  for +to: U32
647  for +c: U32
648  for +wi: U32
649  for +o: Nat
650  for +v: U32
651  for +k: Nat
652  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
653  for +ho: {Nat.is_lt(o, 4n) == True{} : Bool}
654  for +hs: {Nat.is_le(SS(wi, o), U32.to_nat(to)) == True{} : Bool}
655  for +hk: {Nat.is_lt(U32.to_nat(wi), Nat.pow(2n, d)) == True{} : Bool}
656  for +hv: {FW.P0(v) == Nat.add(o, D.run_len(AW(t, wi, o), c)) : Nat}
657  for +hz: {U32.is_zero(FA.zb(v)) == True{} : Bool}
658  for +hs1: {Nat.is_le(Nat.mul(Nat.add(U32.to_nat(wi), 1n), 4n), U32.to_nat(to)) == True{} : Bool}
659  {D.first(UB(t), SS(wi, o), U32.to_nat(to), c) == D.first(UB(t), Nat.mul(Nat.add(U32.to_nat(wi), 1n), 4n), U32.to_nat(to), c) : Nat}