[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 5 from proof inv-addn (previous step)

jvalid ↔ jvalid2, jvalid0 ↔ jvalid4, jvalid1 ↔ jvalid3, fi = fi1, fi0 = fi2, gstore1 = gstore, jro0 = jro, nx0 = nx, remove-refsize0(gstore0) = gstore0, elems nx ∩ jro = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ jro, p_os < pmaxino, fi2.inos < jmaxino1, fi1.inos < pmaxino, inv(gstore \ jro), inv(gstore0), refsize-cons(gstore, range fi2), refsize-cons(gstore0, range fi1), ri-inj(fi2), ri-inj(fi1), pmaxino ≤ jmaxino1, fi2.lebs ⊆ dom gstore, fi1.lebs ⊆ dom gstore0, jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro) ⊦ ⟪gjournal_journal_transaction#(ndx, jmaxino0; ; gndx, jmaxino); gjournal_journal_allocate#(jmaxino, fi0, fi, gstore0, pmaxino, p_os; jvalid0, jro, gstore, nx, jvalid; err0); if err0 = ESUCCESS then index_add_gnds#(gndx, fi0, fi, jro, gstore0, nx, pmaxino, p_os; ax, gstore; jvalid, err0); if err0 = ESUCCESS then {jmaxino0 := jmaxino0 + # ndx; if jvalid1 then let err = ? in index_sync#(fi0, fi, jro, gstore, gstore0, nx, pmaxino, p_os; ; jvalid, err)} else jvalid0 := false⟫ ( (jvalid0 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro)) ∧ fi2.lebs ⊆ dom gstore ∧ refsize-cons(gstore, range fi2) ∧ inv(gstore \ jro) ∧ elems nx ∩ jro = ∅ ∧ ¬ dups(nx) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ jro ∧ (err0 = ESUCCESS ∨ ⌊err0⌋ ) ∧ dom gstore1 ⊆ dom gstore ∧ (nx.toSet \ nx0.toSet) ∩ dom gstore1 = ∅ ∧ ( err0 = ESUCCESS → # ax = # ndx ∧ ¬ dups(ax) ∧ nodes-cons(ax, ndx, gstore, jro) ∧ abs-log(nx, gstore ↓) = abs-log(nx0, gstore1 ↓) + ax ∧ nodes(gstore ↓, jro) = nodes(gstore1 ↓, jro0)[ax, ndx] ∧ new(ax, nodes(gstore1 ↓, jro0))) ∧ (err0 ≠ ESUCCESS → abs-log(nx, gstore ↓) = abs-log(nx0, gstore1 ↓) ∧ nodes(gstore ↓, jro) = nodes(gstore1 ↓, jro0))), pmaxino = 0, dups(nx)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 6:
remove-refsize0(gstore0) = gstore0, elems nx ∩ jro = ∅, dom gstore0 ∪ elems nx = dom gstore ∪ jro, pmaxino ≠ 0, fi1.inos < pmaxino, fi2.inos < jmaxino1, p_os < pmaxino, inv(gstore0), inv(gstore \ jro), refsize-cons(gstore0, range fi1), refsize-cons(gstore, range fi2), ri-inj(fi1), ri-inj(fi2), pmaxino ≤ jmaxino1, fi1.lebs ⊆ dom gstore0, fi2.lebs ⊆ dom gstore, ¬ dups(nx), jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro) ⊦ ⟪gjournal_journal_transaction#(ndx, jmaxino0; ; gndx, jmaxino); nx1 := nx; jro1 := jro; gstore2 := gstore; gjournal_journal_allocate#(jmaxino, fi2, fi1, gstore0, pmaxino, p_os; jvalid4, jro, gstore, nx, jvalid; err0); fi0 := fi2; if err0 = ESUCCESS then index_add_gnds#(gndx, fi0, fi1, jro, gstore0, nx, pmaxino, p_os; ax, gstore; jvalid, err0); if err0 = ESUCCESS then {jmaxino0 := jmaxino0 + # ndx; if jvalid1 then let err = ? in index_sync#(fi0, fi1, jro, gstore, gstore0, nx, pmaxino, p_os; ; jvalid, err)} else jvalid4 := false⟫ ( (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro)) ∧ fi2.lebs ⊆ dom gstore ∧ refsize-cons(gstore, range fi2) ∧ inv(gstore \ jro) ∧ elems nx ∩ jro = ∅ ∧ ¬ dups(nx) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ jro ∧ (err0 = ESUCCESS ∨ ⌊err0⌋ ) ∧ dom gstore2 ⊆ dom gstore ∧ (nx.toSet \ nx1.toSet) ∩ dom gstore2 = ∅ ∧ ( err0 = ESUCCESS → # ax = # ndx ∧ ¬ dups(ax) ∧ nodes-cons(ax, ndx, gstore, jro) ∧ abs-log(nx, gstore ↓) = abs-log(nx1, gstore2 ↓) + ax ∧ nodes(gstore ↓, jro) = nodes(gstore2 ↓, jro1)[ax, ndx] ∧ new(ax, nodes(gstore2 ↓, jro1))) ∧ (err0 ≠ ESUCCESS → abs-log(nx, gstore ↓) = abs-log(nx1, gstore2 ↓) ∧ nodes(gstore ↓, jro) = nodes(gstore2 ↓, jro1)))

Proof step 5 from proof inv-addn (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information