[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 72 from proof refine-check-commit (previous step)

remove-refsize0(gstore1) = gstore1, elems nx ∩ jro2 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro2, jro1.keys.inodes?, p_os.keys.inodes?, jro1 < jmaxino, p_os < pmaxino, ri.inos < jmaxino, fi1.inos < pmaxino, inv(gstore2 \ jro2), inv(gstore1), log-cons(abs-log(nx, gstore2 ↓), nodes(gstore2 ↓, jro2)), refsize-cons(gstore2, range ri), refsize-cons(gstore1, range fi1), ri-cons(ri, nodes(gstore2 ↓, jro2)), ri-inj(ri), ri-inj(fi1), n ∈ gstore2, n ∈ jro2, pmaxino ≤ jmaxino, ri.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, jvalid → jvalid0, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro2) ⊦ #(dom remove-refsize0(gstore2) ∩ jro2) = 0, # jro2 = 0, gstore2[n].ref-size = 0, jmaxino = 0, jro2 = ∅, pmaxino = 0, dups(nx)

Heuristic elimination applied rule insert elim lemma

And closed the goal!

Rule argument

spec: ablock, inst: group-store name: elim seq: ⊦ (gndx = gblock.gndlist ∧ lax = gblock.ladrlist) ∧ m = gblock.ref-size ↔ gblock = groupblock(gndx, lax, m) subst: [gblock, gndx, lax, m] → [gstore2[n], gndx, lax, m]

Additional information

Used simplifier rules: refsize-nonzero-notin-ginval: ⊦ gstore[n] = groupblock(gndx, lax, m2) ∧ n ∈ gstore ∧ m2 ≠ 0 ∧ refsize-cons(gstore, range ri) ∧ ri-cons(ri, nodes(gstore ↓, ginval)) ∧ inv(gstore \ ginval) → ¬ n ∈ ginval; (forward) from specification gjournal-abs%⊦ (gndx = gblock.gndlist ∧ lax = gblock.ladrlist) ∧ m = gblock.ref-size ↔ gblock = groupblock(gndx, lax, m); (elim) Used terms: gstore2[n], gndx, lax, m