[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 26 from proof prepost-gc-referenced-nodes (previous step)

# lax = # gndx0 + # gndx2 + 1, # ax2 = # gndx2, lax.to-adr(lnum) = ax + adr1 ' + ax2, jvalid ↔ nd.key ∈ ri, gstore2[lnum] = groupblock(gndx0 + mkgnode(nd, m0, boolvar, boolvar0) ' + gndx2, lax, m), err = err0, err = ESUCCESS, inv(groupblock(gndx0 + mkgnode(nd, m0, boolvar, boolvar0) ' + gndx2, lax, m)), inv(gstore2 \ ginval), ri-cons(ri, nodes(gstore2 ↓, ginval)), lnum ∈ gstore2, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if jvalid then adr := ri[nd.key] else adr := ?; ndx := nodes(gstore2 ↓, ginval)[referenced-adrs(ax, ri)]; if err = ESUCCESS ∧ jvalid ∧ adr = adr1 then ndx := ndx + nd '; ax := adr1 ' + ax2; gndx1 := gndx0 + mkgnode(nd, m0, boolvar, boolvar0) ' + gndx2; gndx := mkgnode(nd, m0, boolvar, boolvar0) ' + gndx2; if err = ESUCCESS then {ax := ax.tail; gndx := gndx.tail}⟫ ( (err = ESUCCESS ∨ ⌊err⌋ ) ∧ ( err = ESUCCESS → (∃ ax0, gndx0. lax.to-adr(lnum) = ax0 + ax ∧ gndx1 = gndx0 + gndx ∧ # ax = # gndx ∧ ndx = nodes(gstore2 ↓, ginval)[referenced-adrs(ax0, ri)])) ∧ ¬ # ax2 < (err = ESUCCESS ⊃ # ax;0)), lnum ∈ ginval

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information