[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 6 from proof inv-check-commit (previous step)

jvalid ↔ false, fi = fi2, fi0 = fi1, gstore = gstore1, gstore0 = gstore2, jro = jro1, jro0 = jro2, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro1 = ∅, dom remove-refsize0(gstore2) ∩ jro1 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro1, fi2.inos < pmaxino, fi1.inos < jmaxino, p_os < pmaxino, jro2 < jmaxino, inv(gstore1), inv(gstore2 \ jro1), refsize-cons(gstore1, range fi2), refsize-cons(gstore2, range fi1), ri-inj(fi2), ri-inj(fi1), pmaxino ≤ jmaxino, fi1.lebs ⊆ dom remove-refsize0(gstore2), fi2.lebs ⊆ dom gstore1, fi1.lebs ⊆ dom gstore2, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro1) ⊦ ⟪index_requires_commit#(fi0, fi, jro, gstore0, gstore, nx, pmaxino, p_os, jvalid0; ; jvalid); if jvalid then gjournal_commit#(jmaxino, jro0, fi0; fi, jro, gstore0, gstore, nx, pmaxino, p_os, jvalid0; err) else err := ESUCCESS⟫ ( p_os < pmaxino ∧ pmaxino ≤ jmaxino ∧ fi.inos < pmaxino ∧ pmaxino ≠ 0 ∧ (jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore0, jro)) ∧ fi1.lebs ⊆ dom gstore0 ∧ fi.lebs ⊆ dom gstore ∧ refsize-cons(gstore0, range fi1) ∧ refsize-cons(gstore, range fi) ∧ inv(gstore0 \ jro) ∧ inv(gstore) ∧ elems nx ∩ jro = ∅ ∧ ¬ dups(nx) ∧ dom gstore ∪ elems nx = dom gstore0 ∪ jro ∧ remove-refsize0(gstore) = gstore ∧ ri-inj(fi)), jmaxino = 0, pmaxino = 0, dups(nx)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 7:
remove-refsize0(gstore1) = gstore1, dom remove-refsize0(gstore2) ∩ jro1 = ∅, elems nx ∩ jro1 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro1, jmaxino ≠ 0, pmaxino ≠ 0, jro2 < jmaxino, p_os < pmaxino, fi1.inos < jmaxino, fi2.inos < pmaxino, inv(gstore2 \ jro1), inv(gstore1), refsize-cons(gstore2, range fi1), refsize-cons(gstore1, range fi2), ri-inj(fi1), ri-inj(fi2), pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore2, fi2.lebs ⊆ dom gstore1, fi1.lebs ⊆ dom remove-refsize0(gstore2), ¬ dups(nx), jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro1) ⊦ ⟪index_requires_commit#(fi1, fi2, jro1, gstore2, gstore1, nx, pmaxino, p_os, jvalid0; ; jvalid); if jvalid then gjournal_commit#(jmaxino, jro2, fi1; fi2, jro1, gstore2, gstore1, nx, pmaxino, p_os, jvalid0; err) else err := ESUCCESS⟫ ( p_os < pmaxino ∧ pmaxino ≤ jmaxino ∧ fi2.inos < pmaxino ∧ pmaxino ≠ 0 ∧ (jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro1)) ∧ fi1.lebs ⊆ dom gstore2 ∧ fi2.lebs ⊆ dom gstore1 ∧ refsize-cons(gstore2, range fi1) ∧ refsize-cons(gstore1, range fi2) ∧ inv(gstore2 \ jro1) ∧ inv(gstore1) ∧ elems nx ∩ jro1 = ∅ ∧ ¬ dups(nx) ∧ dom gstore1 ∪ elems nx = dom gstore2 ∪ jro1 ∧ remove-refsize0(gstore1) = gstore1 ∧ ri-inj(fi2))

Proof step 6 from proof inv-check-commit (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information