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

fs[ri[dentrykey(ino, str0)]].ino = fs[ri[dentrykey(m, str)]].ino, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink = 1, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs = # subdirs(fs[ri[dentrykey(m, str)]].ino, abs-dirs(fs, ri)), fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size = 0, inodekey(mklink(m, str).pino) ∈ ri ∧ fs[ri[inodekey(mklink(m, str).pino)]].directory ∧ dentrykey(mklink(m, str).pino, mklink(m, str).name) ∈ ri ∧ fs[ri[dentrykey(m, str)]].ino = fs[ri[dentrykey(mklink(m, str).pino, mklink(m, str).name)]].ino ↔ mklink(m, str) = alink, abs-children(fs[ri[dentrykey(m, str)]].ino, fs, ri) = ∅, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory, fs[ri[inodekey(ROOT_INO)]].directory, fo.inodes?, orphans(fs, ri).inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(ino) ∈ ri, dentrykey(ino, str0) ∈ ri, dentrykey(m, str) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, inodekey(m) ∈ ri, inodekey(ROOT_INO) ∈ ri, asynced → boolvar, ∀ alink0. inodekey(alink0.pino) ∈ ri ∧ fs[ri[inodekey(alink0.pino)]].directory ∧ dentrykey(alink0.pino, alink0.name) ∈ ri ∧ fs[ri[dentrykey(m, str)]].ino = fs[ri[dentrykey(alink0.pino, alink0.name)]].ino ↔ alink0 = alink, ∀ name. dentrykey(fs[ri[dentrykey(m, str)]].ino, name) ∈ ri → inodekey(fs[ri[dentrykey(fs[ri[dentrykey(m, str)]].ino, name)]].ino) ∈ ri ∧ fs[ri[inodekey(fs[ri[dentrykey(fs[ri[dentrykey(m, str)]].ino, name)]].ino)]].directory ∨ inodekey(fs[ri[dentrykey(fs[ri[dentrykey(m, str)]].ino, name)]].ino) ∈ ri ∧ ¬ fs[ri[inodekey(fs[ri[dentrykey(fs[ri[dentrykey(m, str)]].ino, name)]].ino)]].directory, ∀ ino. (inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory ∧ ino ≠ ROOT_INO ∧ links(ino, abs-dirs(fs, ri)) = ∅ → abs-children(ino, fs, ri) = ∅) ∧ ( inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → fs[ri[inodekey(ino)]].nlink = # links(ino, abs-dirs(fs, ri)) ∧ fs[ri[inodekey(ino)]].nlink ≤ 1 ∧ fs[ri[inodekey(ino)]].size = # abs-children(ino, fs, ri) ∧ fs[ri[inodekey(ino)]].nsubdirs = # subdirs(ino, abs-dirs(fs, ri))) ∧ (inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory → fs[ri[inodekey(ino)]].nlink = # links(ino, abs-dirs(fs, ri))) ∧ (∀ name. inodekey(ino) ∈ ri ∧ dentrykey(ino, name) ∈ ri → inodekey(abs-dirs(fs, ri)[ino].entries[name]) ∈ ri ∧ fs[ri[inodekey(abs-dirs(fs, ri)[ino].entries[name])]].directory ∨ inodekey(abs-dirs(fs, ri)[ino].entries[name]) ∈ ri ∧ ¬ fs[ri[inodekey(abs-dirs(fs, ri)[ino].entries[name])]].directory), links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO ⊦ fs[ri[dentrykey(m, str)]].ino = ROOT_INO, dentrykey(ino, str0) = dentrykey(m, str)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 45:
fs[ri[dentrykey(ino, str0)]].ino = fs[ri[dentrykey(m, str)]].ino, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink = 1, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs = # subdirs(fs[ri[dentrykey(m, str)]].ino, abs-dirs(fs, ri)), fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size = 0, abs-children(fs[ri[dentrykey(m, str)]].ino, fs, ri) = ∅, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory, fs[ri[inodekey(ROOT_INO)]].directory, fo.inodes?, orphans(fs, ri).inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(ino) ∈ ri, dentrykey(ino, str0) ∈ ri, dentrykey(m, str) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, inodekey(m) ∈ ri, inodekey(ROOT_INO) ∈ ri, asynced → boolvar, ∀ name. dentrykey(fs[ri[dentrykey(m, str)]].ino, name) ∈ ri → inodekey(fs[ri[dentrykey(fs[ri[dentrykey(m, str)]].ino, name)]].ino) ∈ ri ∧ fs[ri[inodekey(fs[ri[dentrykey(fs[ri[dentrykey(m, str)]].ino, name)]].ino)]].directory ∨ inodekey(fs[ri[dentrykey(fs[ri[dentrykey(m, str)]].ino, name)]].ino) ∈ ri ∧ ¬ fs[ri[inodekey(fs[ri[dentrykey(fs[ri[dentrykey(m, str)]].ino, name)]].ino)]].directory, ∀ ino. (inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory ∧ ino ≠ ROOT_INO ∧ links(ino, abs-dirs(fs, ri)) = ∅ → abs-children(ino, fs, ri) = ∅) ∧ ( inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory → fs[ri[inodekey(ino)]].nlink = # links(ino, abs-dirs(fs, ri)) ∧ fs[ri[inodekey(ino)]].nlink ≤ 1 ∧ fs[ri[inodekey(ino)]].size = # abs-children(ino, fs, ri) ∧ fs[ri[inodekey(ino)]].nsubdirs = # subdirs(ino, abs-dirs(fs, ri))) ∧ (inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory → fs[ri[inodekey(ino)]].nlink = # links(ino, abs-dirs(fs, ri))) ∧ (∀ name. inodekey(ino) ∈ ri ∧ dentrykey(ino, name) ∈ ri → inodekey(abs-dirs(fs, ri)[ino].entries[name]) ∈ ri ∧ fs[ri[inodekey(abs-dirs(fs, ri)[ino].entries[name])]].directory ∨ inodekey(abs-dirs(fs, ri)[ino].entries[name]) ∈ ri ∧ ¬ fs[ri[inodekey(abs-dirs(fs, ri)[ino].entries[name])]].directory), ∀ alink. inodekey(alink.pino) ∈ ri ∧ dentrykey(alink.pino, alink.name) ∈ ri ∧ fs[ri[dentrykey(m, str)]].ino = fs[ri[dentrykey(alink.pino, alink.name)]].ino → alink = mklink(m, str), links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO ⊦ fs[ri[dentrykey(m, str)]].ino = ROOT_INO, dentrykey(ino, str0) = dentrykey(m, str)

Rule argument

Additional information

Used simplifier rules: ⊦ mklink(m, str).name = str; (s)%⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss)% ⊦ mklink(m, str).pino = m; (s)