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

gndx2.last = mkgnode(nd1, m10, boolvar2, boolvar3), gndx1.last = mkgnode(nd0, m8, boolvar1, false), gstore3[m3, groupblock(gndx, lax, n1)][nx.last] = groupblock(gndx1, lax1, m7), gstore3[nx.last] = groupblock(gndx2, lax2, m9), gstore3[m3, groupblock(gndx, lax, n1)][m0] = groupblock(gndx0, lax0, m6), gstore3[@(m0, m1, m2)] = mkgnode(nd, m, boolvar, boolvar0), fi2[key] = @(m3, m4, m5), gstore3[m3] = groupblock(gndx, lax, n1 + m5), remove-refsize0(gstore2) = gstore2, elems nx ∩ jro0 = ∅, dom gstore2 ∪ elems nx = dom gstore3 ∪ jro0, jro1 < jmaxino, p_os < pmaxino, fi2.inos < jmaxino, fi1.inos < pmaxino, inv(gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)] \ jro0), inv(gstore3 \ jro0), inv(gstore2), inv(gstore3[m3, groupblock(gndx, lax, n1)] \ jro0), inv(groupblock(gndx2, lax2, m9)), key-cons(key, nd), refsize-cons(gstore3, range fi2), refsize-cons(gstore2, range fi1), ri-inj(fi2), ri-inj(fi2[key, @(m0, m1, m2)]), ri-inj(fi1), nx.last ∈ gstore3[m3, groupblock(gndx, lax, n1)], m0 ∈ dom gstore3 ∪ jro0, m3 ∈ gstore3, key ∈ fi2, @(m0, m1, m2) ∈ gstore3, m0 ∈ gstore3[m3, groupblock(gndx, lax, n1)], nx.last ∈ gstore3, pmaxino ≤ max(key.ino + 1, jmaxino), pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore3, fi1.lebs ⊆ dom gstore2, gndx2 = [] ∨ boolvar3 ⊦ #(dom gstore3 ∪ jro0) = 0, nx.last = m0, gndx1 = [], jmaxino = 0, m0 = m3, max(key.ino + 1, jmaxino) = 0, nx = [], pmaxino = 0, dom gstore3 ∪ jro0 = ∅, dups(nx), @(m0, m1, m2) ∈ fi2

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 98:
gndx1.last = mkgnode(nd0, m8, boolvar1, false), gndx2.last = mkgnode(nd1, m10, boolvar2, boolvar3), gstore3[nx.last] = groupblock(gndx2, lax2, m9), gstore3[m3, groupblock(gndx, lax, n1)][nx.last] = groupblock(gndx1, lax1, m7), gstore3[m3] = groupblock(gndx, lax, n1 + m5), fi2[key] = @(m3, m4, m5), gstore3[@(m0, m1, m2)] = mkgnode(nd, m, boolvar, boolvar0), gstore3[m0] = groupblock(gndx0, lax0, m6), remove-refsize0(gstore2) = gstore2, elems nx ∩ jro0 = ∅, dom gstore2 ∪ elems nx = dom gstore3 ∪ jro0, fi1.inos < pmaxino, fi2.inos < jmaxino, p_os < pmaxino, jro1 < jmaxino, inv(groupblock(gndx2, lax2, m9)), inv(gstore3[m3, groupblock(gndx, lax, n1)] \ jro0), inv(gstore2), inv(gstore3 \ jro0), inv(gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)] \ jro0), key-cons(key, nd), refsize-cons(gstore2, range fi1), refsize-cons(gstore3, range fi2), ri-inj(fi1), ri-inj(fi2[key, @(m0, m1, m2)]), ri-inj(fi2), @(m0, m1, m2) ∈ gstore3, key ∈ fi2, m3 ∈ gstore3, m0 ∈ dom gstore3 ∪ jro0, nx.last ∈ gstore3[m3, groupblock(gndx, lax, n1)], nx.last ∈ gstore3, m0 ∈ gstore3, pmaxino ≤ jmaxino, pmaxino ≤ max(key.ino + 1, jmaxino), fi1.lebs ⊆ dom gstore2, fi2.lebs ⊆ dom gstore3, gndx2 = [] ∨ boolvar3 ⊦ #(dom gstore3 ∪ jro0) = 0, nx.last = m0, gndx1 = [], jmaxino = 0, m0 = m3, max(key.ino + 1, jmaxino) = 0, nx = [], pmaxino = 0, dom gstore3 ∪ jro0 = ∅, dups(nx), @(m0, m1, m2) ∈ fi2

Rule argument

Additional information

Used simplifier rules: ⊦ n ≠ n0 → (n ∈ gstore[n0, gblock] ↔ n ∈ gstore); (s)% ⊦ n ≠ n0 → gstore[n0, gblock][n] = gstore[n]; (s)