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

gndx0.last = mkgnode(nd, m3, boolvar, boolvar0), gstore2[m] = groupblock(gndx, lax, n1 + m1), gstore2[m, groupblock(gndx, lax, n1)][nx.last] = groupblock(gndx0, lax0, m2), dom gstore2 = dom gstore3, remove-refsize0(gstore1) = gstore1, as0 ∩ range(fi1 \ datakeys(key, n0, fi1)) = ∅, elems nx ∩ jro = ∅, dom gstore1 ∪ elems nx = dom gstore3 ∪ jro, fi2.inos < pmaxino, fi1.inos < jmaxino, p_os < pmaxino, gstore2 =○refsize gstore3, inv(gstore3[nx.last]), inv(gstore2[m, groupblock(gndx, lax, n1)] \ jro), inv(gstore2 \ jro), inv(gstore1), inv(gstore3 \ jro), refsize-cons(gstore2, range(fi1 \ datakeys(key, n0, fi1)) ∪ as0), refsize-cons(gstore1, range fi2), refsize-cons(gstore3, range fi1), ri-inj(fi2), ri-inj(fi1 \ datakeys(key, n0, fi1)), ri-inj(fi1), nx.last ∈ gstore3, m ∈ gstore2, @(m, m0, m1) ∈ as0, nx.last ∈ gstore2, pmaxino ≤ jmaxino, as0.lebs ⊆ dom gstore3, fi2.lebs ⊆ dom gstore1, fi1.lebs ⊆ dom gstore3, gstore2[nx.last].gndlist = [] ∨ gstore2[nx.last].gndlist.last.end ⊦ # as0 = 0, as0 = ∅, nx = [], pmaxino = 0, dups(nx), nx.last ∈ jro, nx.last ∈ gstore2[m, groupblock(gndx, lax, n1)] ∧ (gndx0 = [] ∨ boolvar0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 46:
gndx0.last = mkgnode(nd, m3, boolvar, false), gstore2[m, groupblock(gndx, lax, n1)][nx.last] = groupblock(gndx0, lax0, m2), gstore2[m] = groupblock(gndx, lax, n1 + m1), dom gstore2 = dom gstore3, remove-refsize0(gstore1) = gstore1, elems nx ∩ jro = ∅, as0 ∩ range(fi1 \ datakeys(key, n0, fi1)) = ∅, dom gstore1 ∪ elems nx = dom gstore3 ∪ jro, p_os < pmaxino, fi1.inos < jmaxino, fi2.inos < pmaxino, gstore2 =○refsize gstore3, inv(gstore3 \ jro), inv(gstore1), inv(gstore2 \ jro), inv(gstore2[m, groupblock(gndx, lax, n1)] \ jro), inv(gstore3[nx.last]), refsize-cons(gstore3, range fi1), refsize-cons(gstore1, range fi2), refsize-cons(gstore2, range(fi1 \ datakeys(key, n0, fi1)) ∪ as0), ri-inj(fi1), ri-inj(fi1 \ datakeys(key, n0, fi1)), ri-inj(fi2), nx.last ∈ gstore2[m, groupblock(gndx, lax, n1)], nx.last ∈ gstore2, @(m, m0, m1) ∈ as0, m ∈ gstore2, nx.last ∈ gstore3, pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore3, fi2.lebs ⊆ dom gstore1, as0.lebs ⊆ dom gstore3, gstore2[nx.last].gndlist = [] ∨ gstore2[nx.last].gndlist.last.end ⊦ # as0 = 0, as0 = ∅, gndx0 = [], nx = [], pmaxino = 0, dups(nx)

Rule argument

Additional information

Used simplifier rules: ⊦ n ∈ gstore[n0, gblock] ↔ n = n0 ∨ n ∈ gstore; (ws)% ⊦ ¬ n ∈ gstore → gstore[n] = (∅)[n]; (s)% ⊦ elems nx ∩ ginval = ∅ ∧ nx ≠ [] → ¬ nx.last ∈ ginval; (s)%int-c: ⊦ ns ∩ ns0 = ns0 ∩ ns; from specification set-union[nat-set]%int-a: ⊦ (ns ∩ ns0) ∩ ns1 = ns ∩ ns0 ∩ ns1; from specification set-union[nat-set]