[Imprint][Data Privacy Statement][E-Mail]



View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 8 from proof refine-add-gnds (previous step)

gstore0[maxino] = groupblock(gndlist0, lax, m, m0, m1, false), remove-refsize0(istore0) = istore0, remove-refsize0(gstore2) = gstore2, dom gstore2 ∪ elems nx0 = dom gstore0 ∪ ginval0, elems nx0 ∩ ginval0 = ∅, inv(groupblock(gndlist0, lax, m, m0, m1, false)), maxino ∈ gstore0, istore0 ⊑ istore, flushed(istore0), inv(istore0), inv(istore), btree-inv(rp, adr, gstore0 \ ginval0, istore, istore0, zh, ri, fi1, ld0), ri-inj(fi0), ri-inj(fi), gstore2 \ ginval0 lpt= gstore0 \ elems nx0, flushed(gstore0 \ (ginval0 ∪ elems nx0)), inv(gstore2), inv(gstore0 \ ginval0), btree-inv(rp, adr, gstore0 \ ginval0, istore, istore0, zh, fi, fi0, ld), m0 + gndlist.flashsize ≤ LEB_SIZE, maxino ∈ nx0, ∀ ri, fi, ld. ¬ btree-inv(rp, adr, gstore0 \ ginval0, istore, istore0, zh, ri, fi, ld) ⊦ dups(nx0), maxino ∈ ginval0

Heuristic quantifier closing applied rule all left

And closed the goal!

Rule argument

pos: left 22 terms: fi, fi0, ld

Additional information

Used terms: fi, fi0, ld