[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 inv-recover (previous step)

remove-refsize0(gstore3) = gstore3, elems nx3 ∩ jro3 = ∅, dom gstore3 ∪ elems nx3 = dom gstore2 ∪ jro3, jmaxino0 ≠ 0, jmaxino3 ≠ 0, fi4.inos < jmaxino0, fi1.inos < jmaxino3, jro5 < jmaxino0, jro2 < jmaxino3, inv(gstore3), inv(gstore2 \ jro3), refsize-cons(gstore3, range fi4), refsize-cons(gstore2, range fi1), ri-inj(fi4), ri-inj(fi1), jmaxino0 ≤ jmaxino3, fi4.lebs ⊆ dom gstore3, fi1.lebs ⊆ dom gstore2, ¬ dups(nx3), jvalid0 ∧ nx3 ≠ [] → valid-journal-head(nx3, gstore2, jro3) ⊦ ⟪gjournal_restore_log#(nx3, fi4, fi4, jro3, crash(gstore2, gstore3, jro3, nx3), gstore3, nx3, jmaxino0, jro5, true; log; err); ks := jro5.keys⟫ (err = ESUCCESS → fi4.lebs ⊆ dom gstore2 ∪ jro3 ∧ dom gstore3 ∪ elems nx3 = (dom gstore2 ∪ jro3) ∪ jro3)

User applied rule insert program lemma

And obtained the following new goals

Rule argument

spec: <toplevel> name: term-restore-log seq: elems nx ∩ ginval = ∅, elems nx ⊆ dom gstore, inv(gstore) ⊦ ⟪gjournal_restore_log# (nx, ri, fi, ginval, gstore, gstore0, nx0, maxino, ns, boolvar0 ; log ; err)⟫ true subst: [boolvar0, ns, maxino, nx0, gstore0, gstore, ginval, fi, ri, nx, log, err] → [true, jro5, jmaxino0, nx3, gstore3, crash(gstore2, gstore3, jro3, nx3), jro3, fi4, fi4, nx3, log, err] flags: <all paths>

Additional information