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

remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom remove-refsize0(gstore2) ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jmaxino ≠ 0, pmaxino ≠ 0, p_os.keys.inodes?, jro1.keys.inodes?, fi1.inos < pmaxino, ri.inos < jmaxino, p_os < pmaxino, jro1 < jmaxino, inv(gstore1), inv(gstore2 \ jro0), log-cons(abs-log(nx, gstore2 ↓), nodes(gstore2 ↓, jro0)), refsize-cons(gstore1, range fi1), refsize-cons(gstore2, range ri), ri-cons(ri, nodes(gstore2 ↓, jro0)), ri-inj(fi1), ri-inj(ri), pmaxino ≤ jmaxino, fi1.lebs ⊆ dom gstore1, ri.lebs ⊆ dom gstore2, ⌊err0⌋ , ¬ dups(nx), jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0), jvalid2 → jvalid3 ⊦ ∃ as. as ∩ range ri = ∅ ∧ ⟨fi := ri, fo := jro1.keys, fs := nodes(gstore2 ↓, jro0) \ as, log := [], err := ESUCCESS; jvalid := true⟩ (p_os.keys = fo ∧ fi1 = fi ∧ log = abs-log(nx, gstore2 ↓) ∧ fs = nodes(gstore2 ↓, jro0) ∧ (jvalid → jvalid0) ∧ err0 = err), ⟨fail#(; ; err); jvalid := ?⟩ ((jvalid → jvalid0) ∧ err0 = err)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 110:
remove-refsize0(gstore1) = gstore1, dom remove-refsize0(gstore2) ∩ jro0 = ∅, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jro1.keys.inodes?, p_os.keys.inodes?, jro1 < jmaxino, p_os < pmaxino, ri.inos < jmaxino, fi1.inos < pmaxino, inv(gstore2 \ jro0), inv(gstore1), log-cons(abs-log(nx, gstore2 ↓), nodes(gstore2 ↓, jro0)), refsize-cons(gstore2, range ri), refsize-cons(gstore1, range fi1), ri-cons(ri, nodes(gstore2 ↓, jro0)), ri-inj(ri), ri-inj(fi1), pmaxino ≤ jmaxino, ri.lebs ⊆ dom gstore2, fi1.lebs ⊆ dom gstore1, ⌊err0⌋ , jvalid2 → jvalid3, jvalid1 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ ⟨choose err0 with ⌊err0⌋ in err := err0; jvalid := ?⟩ ((jvalid → jvalid0) ∧ err0 = err), ∃ as. as ∩ range ri = ∅ ∧ ⟨fi := ri, fo := jro1.keys, fs := nodes(gstore2 ↓, jro0) \ as, log := [], err := ESUCCESS; jvalid := true⟩ (p_os.keys = fo ∧ fi1 = fi ∧ log = abs-log(nx, gstore2 ↓) ∧ fs = nodes(gstore2 ↓, jro0) ∧ (jvalid → jvalid0) ∧ err0 = err), jmaxino = 0, pmaxino = 0, dups(nx)

Rule argument

pos: right 2

Additional information

Used simplifier rules: fail#(; ; ERR){choose ERR0 with ⌊ERR0⌋ in ERR := ERR0};