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

# lax = # gndx0, gstore2[n1] = groupblock(gndx0, lax, m0), ndx = nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), fi2)], remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, fi1.inos < pmaxino, fi2.inos < jmaxino, p_os < pmaxino, jro1 < jmaxino, inv(groupblock(gndx0, lax, m0)), inv(gstore1), inv(gstore2 \ jro0), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range fi2), ri-cons(fi2, nodes(gstore2 ↓, jro0)), ri-inj(fi1), ri-inj(fi2), n1 ∈ gstore1, n1 ∈ gstore2, pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore1, fi2.lebs ⊆ dom gstore2, jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ jmaxino = 0, m0 = 0, pmaxino = 0, dups(nx), n1 ∈ nx, n1 ∈ jro0, jro1 < jmaxino ∧ p_os < pmaxino ∧ pmaxino ≤ jmaxino ∧ fi2.inos < jmaxino ∧ fi1.inos < pmaxino ∧ jmaxino ≠ 0 ∧ pmaxino ≠ 0 ∧ (jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0)) ∧ fi2.lebs ⊆ dom gstore2 ∧ fi1.lebs ⊆ dom gstore1 ∧ refsize-cons(gstore2, range fi2) ∧ refsize-cons(gstore1, range fi1) ∧ inv-journal(nx, gstore2, gstore1, jro0) ∧ ri-inj(fi2) ∧ ri-inj(fi1) ∧ ndx.keys.toSet ⊆ dom fi2 ∧ ¬ dups(ndx.keys) ∧ range fi2 ⊆ dom nodes(gstore2 ↓, jro0) ∧ key-cons(ndx) ∧ jmaxino = jmaxino ∧ gstore2 = gstore2 ∧ nx = nx ∧ ndx = ndx ∧ jro0 = jro0 ∧ fi2 = fi2

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 61:
# lax = # gndx0, gstore2[n1] = groupblock(gndx0, lax, m0), remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jro1 < jmaxino, p_os < pmaxino, fi2.inos < jmaxino, fi1.inos < pmaxino, dups(nodes(gstore2 ↓, jro0)[referenced-adrs(lax.to-adr(n1), fi2)].keys), inv(gstore2 \ jro0), inv(gstore1), inv(groupblock(gndx0, lax, m0)), refsize-cons(gstore2, range fi2), refsize-cons(gstore1, range fi1), ri-cons(fi2, nodes(gstore2 ↓, jro0)), ri-inj(fi2), ri-inj(fi1), n1 ∈ gstore2, n1 ∈ gstore1, pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, jvalid4 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ jmaxino = 0, m0 = 0, pmaxino = 0, dups(nx), n1 ∈ jro0, n1 ∈ nx

Rule argument

Additional information

Used simplifier rules: ⊦ ri-cons(ri, fs) → key-cons(fs[referenced-adrs(ax, ri)]); (s)% ⊦ ri-cons(ri, fs) → range ri ⊆ dom fs; (ss)% ⊦ ri-cons(ri, fs) → fs[referenced-adrs(ax, ri)].keys.toSet ⊆ dom ri; (s)% ⊦ ri-cons(ri, fs) → ri-inj(ri); (ss)%⊦ inv-journal(nx, gstore, gstore0, ginval) ↔ inv(gstore \ ginval) ∧ inv(gstore0) ∧ elems nx ∩ ginval = ∅ ∧ ¬ dups(nx) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval ∧ remove-refsize0(gstore0) = gstore0; (s)