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

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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information