law fhit2

lawful-bytes@0.1.1.0 · proof_fast_find2.bend:312

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-bytes@0.1.1.0/proof_fast_find.bend as FF
import lawful-arrays@0.1.0.0/proof_tree.bend as P

312law fhit2:
313  for +len: U32
314  for +t: P.Tree<U32>
315  for +d: Nat
316  for +to: U32
317  for +c1: U32
318  for +c2: U32
319  for +wi: U32
320  for +o: Nat
321  for +v1: U32
322  for +v2: U32
323  for +h: {D.ok(C.BT(len, t), d) == True{} : Bool}
324  for +ht: {Nat.is_le(U32.to_nat(to), U32.to_nat(len)) == True{} : Bool}
325  for +ho: {Nat.is_lt(o, 4n) == True{} : Bool}
326  for +hs: {Nat.is_le(FF.SS(wi, o), U32.to_nat(to)) == True{} : Bool}
327  for +hk: {Nat.is_lt(U32.to_nat(wi), Nat.pow(2n, d)) == True{} : Bool}
328  for +hv: {Nat.min(FW.P0(v1), FW.P0(v2)) == Nat.add(o, D.run_len2(FF.AW(t, wi, o), c1, c2)) : Nat}
329  for +hz: {U32.is_zero(U32.or(FA.zb(v1), FA.zb(v2))) == False{} : Bool}
330  {U32.to_nat(U32.min(((wi << 2n : U32) + FA.bidx(U32.or(FA.zb(v1), FA.zb(v2))) : U32), to)) == D.first2(FF.UB(t), FF.SS(wi, o), U32.to_nat(to), c1, c2) : Nat}