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

fi0 = ri, fs = nodes(gstore2 ↓, jro0), log = abs-log(nx, gstore2 ↓), remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jro1.keys.inodes?, p_os.keys.inodes?, ri.inos < jmaxino, fi1.inos < pmaxino, p_os < pmaxino, jro1 < jmaxino, 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, jvalid3 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0), jvalid5 → jvalid4 ⊦ ∃ kx, ax. (¬ dups(kx) ∧ ¬ dups(ax) ∧ new(ax, fs) ∧ kx.toSet ⊆ dom ri ∧ # kx = # ax ∧ ax.toSet ∩ log.toSet = ∅) ∧ ⟨fs[ax] := fs[ri[kx]], log := log + ax; ri[kx] := ax; aubifs_core_gc_drop#(ri, log; fs); jvalid := ?⟩ (fi0 = ri ∧ log = abs-log(nx, gstore2 ↓) ∧ fs = nodes(gstore2 ↓, jro0) ∧ (jvalid → jvalid4)), jmaxino = 0, pmaxino = 0, dups(nx)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 31:
remove-refsize0(gstore1) = gstore1, elems nx ∩ jro0 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ jro0, jmaxino ≠ 0, pmaxino ≠ 0, p_os.keys.inodes?, jro1.keys.inodes?, jro1 < jmaxino, p_os < pmaxino, fi1.inos < pmaxino, ri.inos < 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, ¬ dups(nx), jvalid5 → jvalid4, jvalid3 ∧ nx ≠ [] → valid-journal-head(nx, gstore2, jro0) ⊦ ∃ kx, ax. ¬ dups(kx) ∧ ¬ dups(ax) ∧ new(ax, nodes(gstore2 ↓, jro0)) ∧ kx.toSet ⊆ dom ri ∧ # kx = # ax ∧ ax.toSet ∩ abs-log(nx, gstore2 ↓).toSet = ∅ ∧ ⟨fs := nodes(gstore2 ↓, jro0)[ax, nodes(gstore2 ↓, jro0)[ri[kx]]], log := abs-log(nx, gstore2 ↓) + ax; ri0 := ri[kx, ax]; aubifs_core_gc_drop#(ri0, log; fs); jvalid := ?⟩ (ri = ri0 ∧ log = abs-log(nx, gstore2 ↓) ∧ fs = nodes(gstore2 ↓, jro0) ∧ (jvalid → jvalid4))

Proof step 30 from proof refine-gc (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information