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

gndx0.last = mkgnode(nd0, m5, boolvar1, false), gndx1.last = mkgnode(nd1, m7, boolvar2, boolvar3), gstore3[m0, groupblock(gndx, lax, m3 + m2)][nx.last] = groupblock(gndx0, lax0, m4), gstore3[m0] = groupblock(gndx, lax, m3), gstore3[@(m0, m1, m2)] = mkgnode(nd, m, boolvar, boolvar0), gstore3[nx.last] = groupblock(gndx1, lax1, 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(gndx1, lax1, m6)), inv(gstore2), inv(gstore3 \ jro0), inv(gstore3[m0, groupblock(gndx, lax, m3 + 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, m0 ∈ gstore3, nx.last ∈ gstore3[m0, groupblock(gndx, lax, m3 + m2)], nx.last ∈ gstore3, pmaxino ≤ jmaxino, pmaxino ≤ max(key.ino + 1, jmaxino), fi1.lebs ⊆ dom gstore2, fi2.lebs ⊆ dom gstore3, gndx1 = [] ∨ boolvar3 ⊦ gndx0 = [], jmaxino = 0, max(key.ino + 1, jmaxino) = 0, nx = [], pmaxino = 0, dups(nx), key ∈ fi2, @(m0, m1, m2) ∈ fi2

Heuristic nonsplitting cut applied rule cut formula

And closed the goal!

Rule argument

fma: nx.last = m0

Additional information

Used simplifier rules: ⊦ n ≠ n0 → gstore[n0, gblock][n] = gstore[n]; (s)% ⊦ n ≠ n0 → (n ∈ gstore[n0, gblock] ↔ n ∈ gstore); (s)%⊦ groupblock(gndx, lax, m) = groupblock(gndx0, lax0, m0) ↔ gndx = gndx0 ∧ lax = lax0 ∧ m = m0; (ws)%⊦ mkgnode(nd, m, boolvar, boolvar0) = mkgnode(nd0, m0, boolvar1, boolvar2) ↔ nd = nd0 ∧ m = m0 ∧ (boolvar ↔ boolvar1) ∧ (boolvar0 ↔ boolvar2); (ws)% ⊦ gstore[n, gblock][n] = gblock; (s)% ⊦ n ∈ gstore[n, gblock]; (s) Used formulas: nx.last = m0