[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-gc (previous step)

# kx = # ax, fs0[ri0[inodekey(ino)]].nlink = 0 ∧ ino ≠ ROOT_INO ↔ inodekey(ino) ∈ ro, replay-log(log0, fs0, fi ⊖ fo) = ri0 ⊖ ro, as ∩ range ri0[kx, ax] = ∅, ax.toSet ∩ log0.toSet = ∅, as ∩ log0.toSet = ∅, as ∩ ax.toSet = ∅, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), log-cons(ax, fs0[ax, fs0[ri0[kx]]] \ as), log-cons(log0, fs0[ax, fs0[ri0[kx]]] \ as), new(ax, fs0), orphans-cons(fs0, ri0, ro), replay-safe(log0, fs0, fi ⊖ fo), ri-closed(ri0, fs0, ro), ri-cons(ri0, fs0), ri-cons(ri0[kx, ax], fs0[ax, fs0[ri0[kx]]] \ as), ri-inj(fi), ri-inj(ri0), ri-inj(ri0[kx, ax]), inodekey(ino) ∈ ri0[kx, ax], inodekey(ino) ∈ ri0, fo ⊆ dom fi, ro ⊆ dom ri0, kx.toSet ⊆ dom ri0 ⊦ (fs0[ax, fs0[ri0[kx]]] \ as)[ri0[kx, ax][inodekey(ino)]].nlink = 0 ∧ ino ≠ ROOT_INO ↔ inodekey(ino) ∈ ro, dups(log0), dups(kx), dups(ax), inodekey(0) ∈ ri0

Heuristic nonsplitting cut applied rule cut formula

And closed the goal!

Rule argument

fma: ri0[kx, ax][inodekey(ino)] ∈ as

Additional information

Used simplifier rules: ⊦ ¬ adr ∈ as → (fs \ as)[adr] = fs[adr]; (s)%# ax = # kx ⊦ new(ax, fs) ∧ ¬ dups(ax) ∧ ¬ dups(kx) ∧ ri-cons(ri, fs) ∧ kx.toSet ⊆ dom ri ∧ key ∈ ri → fs[ax, fs[ri[kx]]][ri[kx, ax][key]] = fs[ri[key]]; (s)% ⊦ adr ∈ as → (fs \ as)[adr] = (∅)[adr]; (s)%int-a: ⊦ (as ∩ as0) ∩ as1 = as ∩ as0 ∩ as1; from specification set-union[node-store]%int-c: ⊦ as ∩ as0 = as0 ∩ as; from specification set-union[node-store]% ⊦ key ∈ ri ∧ as ∩ range ri = ∅ → ¬ ri[key] ∈ as; (s) Used formulas: ri0[kx, ax][inodekey(ino)] ∈ as