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

gndx1.last = mkgnode(nd0, m8, boolvar1, false), 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), gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)][nx.last] = groupblock(gndx1, lax1, m7), 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, nx.last ∈ gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)], m0 ∈ dom gstore3 ∪ jro0, m3 ∈ gstore3, key ∈ fi2, @(m0, m1, m2) ∈ gstore3, m0 ∈ gstore3[m3, groupblock(gndx, lax, n1)], pmaxino ≤ max(key.ino + 1, jmaxino), pmaxino ≤ jmaxino, fi2.lebs ⊆ dom gstore3, fi1.lebs ⊆ dom gstore2, gndx2 = [] ∨ gndx2.last.end ⊦ #(dom gstore3 ∪ jro0) = 0, gndx1 = [], jmaxino = 0, max(key.ino + 1, jmaxino) = 0, nx = [], pmaxino = 0, dom gstore3 ∪ jro0 = ∅, dups(nx), @(m0, m1, m2) ∈ fi2

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 92:
gndx1.last = mkgnode(nd0, m8, boolvar1, false), gndx2.last = mkgnode(nd1, m10, boolvar2, boolvar3), gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)][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[m3, groupblock(gndx, lax, n1)][m0] = groupblock(gndx0, lax0, m6), gstore3[nx.last] = groupblock(gndx2, lax2, m9), 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 ∈ gstore3[m3, groupblock(gndx, lax, n1)], @(m0, m1, m2) ∈ gstore3, key ∈ fi2, m3 ∈ gstore3, m0 ∈ dom gstore3 ∪ jro0, nx.last ∈ gstore3[m3, groupblock(gndx, lax, n1)][m0, groupblock(gndx0, lax0, m6 + m2)], nx.last ∈ gstore3, pmaxino ≤ jmaxino, pmaxino ≤ max(key.ino + 1, jmaxino), fi1.lebs ⊆ dom gstore2, fi2.lebs ⊆ dom gstore3, gndx2 = [] ∨ boolvar3 ⊦ #(dom gstore3 ∪ jro0) = 0, gndx1 = [], jmaxino = 0, max(key.ino + 1, jmaxino) = 0, nx = [], pmaxino = 0, dom gstore3 ∪ jro0 = ∅, dups(nx), @(m0, m1, m2) ∈ fi2

Rule argument

spec: groupnode name: elim seq: ⊦ ((nd = gnd.nd ∧ m = gnd.sqnum) ∧ (boolvar ↔ gnd.start)) ∧ (boolvar0 ↔ gnd.end) ↔ gnd = mkgnode(nd, m, boolvar, boolvar0) subst: [gnd, nd, m, boolvar, boolvar0] → [gndx2.last, nd1, m10, boolvar2, boolvar3]

Additional information

Used simplifier rules: ⊦ ((nd = gnd.nd ∧ m = gnd.sqnum) ∧ (boolvar ↔ gnd.start)) ∧ (boolvar0 ↔ gnd.end) ↔ gnd = mkgnode(nd, m, boolvar, boolvar0); (elim) Used terms: gndx2.last, nd1, m10, boolvar2, boolvar3