[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 12 from proof crash-neutral-recovery (previous step)

adr1 = adr3, ginval4 = ginval3, ginval5 = ginval2, gstore1 = crash(gstore0, gstore3, ginval3, nx1), gstore2 = gstore3, istore1 = istore4, istore2 = istore3, maxino1 = maxino3, nx2 = nx1, remove-refsize0(istore3) = istore3, remove-refsize0(gstore3) = gstore3, elems nx1 ∩ ginval3 = ∅, dom gstore3 ∪ elems nx1 = dom gstore0 ∪ ginval3, inv(istore3), inv(istore4), inv(gstore3), inv(gstore0 \ ginval3), istore3 ⊑ istore4, pstate0.index? → pstate0.lnum ∈ istore4, pstate0.journal? → nx1 ≠ [] ∧ pstate0.lnum = nx1.last ∧ pstate0.lnum ∈ gstore0 ⊦ dups(nx1), ∃ pstate, syn, adr, istore0, istore, ginval, gstore4, gstore, nx, maxino, ginval0, adr0, maxino0, nx0, ginval1. syn ∧ adr3 = adr ∧ remove-refsize0(crash(istore4, istore)) = remove-refsize0(crash(istore0, istore)) ∧ istore3 = istore ∧ ginval4 = ginval ∧ gstore1 = crash(gstore4, gstore, ginval, nx) ∧ gstore3 = gstore ∧ nx2 = nx ∧ maxino3 = maxino ∧ ginval2 = ginval0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information