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

gstore[adr] = mkgnode(nd0, m0, boolvar1, boolvar2), fi = fi1, fo = p_os.keys, fs = nodes(gstore ↓, jro0), log = abs-log(nx, gstore ↓), remove-refsize0(gstore0) = gstore0, ri0 = ri, ro = jro.keys, elems nx ∩ jro0 = ∅, dom gstore ∪ jro0 = dom gstore1 ∪ jro0, dom gstore0 ∪ elems nx = dom gstore1 ∪ jro0, p_os.keys.inodes?, jro.keys.inodes?, jro < jmaxino0, ri.inos ∪ (key.inode? ⊃ ∅ ++ key.ino;∅) < jmaxino0, jro < jmaxino, p_os < pmaxino, ri.inos < jmaxino, fi1.inos < pmaxino, gstore1 =○refsize gstore, inv(gstore1 \ jro0), inv(gstore0), inv(gstore \ jro0), key-cons(key, nd0), log-cons(abs-log(nx, gstore ↓), nodes(gstore ↓, jro0)), refsize-cons(gstore1, range ri[key, adr]), refsize-cons(gstore, range ri), refsize-cons(gstore0, range fi1), ri-inj(ri[key, adr]), ri-inj(ri), ri-inj(fi1), adr ∈ nodes(gstore ↓, jro0), adr ∈ gstore, pmaxino ≤ jmaxino0, pmaxino ≤ jmaxino, ri[key, adr].lebs ⊆ dom gstore1, ri.lebs ⊆ dom gstore, fi1.lebs ⊆ dom gstore0, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore1, jro0), jvalid → jvalid0, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore, jro0), ¬ adr ∈ ri → adr ∈ fs → adr ∈ fs ⊦ jmaxino = 0, jmaxino0 = 0, pmaxino = 0, dups(nx), adr ∈ ri, ¬ adr ∈ ri ∧ adr ∈ fs ∧ key-cons(key, fs[adr])

Heuristic simplifier applied rule simplifier

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ mkgnode(nd, m, boolvar, boolvar0).nd = nd; (s)%⊦ adr ∈ nodes(gstore ↓, ginval) ∧ gstore[adr] = gnd → gstore ↓[adr] = gstore[adr]; (s)%⊦ adr ∈ nodes(gstore, ginval) → nodes(gstore, ginval)[adr] = gstore[adr].nd; (s)