[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 15 from proof rename-precond-abs (previous step)

fs[ri[inodekey(m4)]].directory, fs[ri[inodekey(m3)]].directory, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), 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(fs[ri[dentrykey(m4, str)]].ino) ∈ ri, dentrykey(m4, str) ∈ ri, inodekey(m3) ∈ ri, inodekey(m4) ∈ ri, m3 = m4 → md = md0, links(m4, abs-dirs(fs, ri)) ≠ ∅ ∨ m4 = ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m8 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].size ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∧ boolvar0 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m7 = 0 ∧ ¬ boolvar0, (links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO) ∧ ¬ dentrykey(m3, new_dent.name) ∈ ri ∧ new_dent.negdentry? ∨ (links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO) ∧ (inodekey(new_dent.ino) ∈ ri ∧ fs[ri[inodekey(new_dent.ino)]].directory ∨ inodekey(new_dent.ino) ∈ ri ∧ ¬ fs[ri[inodekey(new_dent.ino)]].directory) ∧ dentrykey(m3, new_dent.name) ∈ ri ∧ new_dent.ino = fs[ri[dentrykey(m3, new_dent.name)]].ino ∧ new_dent.dentry? ∧ ( inodekey(new_dent.ino) ∈ ri ∧ fs[ri[inodekey(new_dent.ino)]].directory ∧ m0 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m2 = fs[ri[inodekey(new_dent.ino)]].size ∧ m1 = fs[ri[inodekey(new_dent.ino)]].nsubdirs ∧ boolvar ∨ inodekey(new_dent.ino) ∈ ri ∧ ¬ fs[ri[inodekey(new_dent.ino)]].directory ∧ m0 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar) ∧ m = new_dent.ino ∧ (inodekey(new_dent.ino) ∈ ri ∧ ¬ fs[ri[inodekey(new_dent.ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory) ∧ (inodekey(new_dent.ino) ∈ ri ∧ fs[ri[inodekey(new_dent.ino)]].directory → new_dent.ino ≠ ROOT_INO ∧ abs-children(new_dent.ino, fs, ri) = ∅) ⊦ ( new_dent.negdentry? ∧ (fs[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO) ∧ ¬ dentrykey(m3, new_dent.name) ∈ ri ∨ new_dent.dentry? ∧ (fs[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO) ∧ inodekey(new_dent.ino) ∈ ri ∧ dentrykey(m3, new_dent.name) ∈ ri ∧ fs[ri[dentrykey(m3, new_dent.name)]].ino = new_dent.ino ∧ ( ¬ fs[ri[inodekey(new_dent.ino)]].directory ∧ ¬ boolvar ∧ m0 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m1 = fs[ri[inodekey(new_dent.ino)]].nsubdirs ∨ fs[ri[inodekey(new_dent.ino)]].directory ∧ boolvar ∧ m0 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m1 = fs[ri[inodekey(new_dent.ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(new_dent.ino)]].size) ∧ m = new_dent.ino ∧ (¬ fs[ri[inodekey(new_dent.ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory) ∧ (fs[ri[inodekey(new_dent.ino)]].directory → dentrykeys(inodekey(new_dent.ino), ri) = ∅) ∧ new_dent.ino ≠ ROOT_INO ∧ m0 ≠ 0 ∧ (m0 = 1 → links(new_dent.ino, fs, ri) = ∅ ++ dentrykey(m3, new_dent.name))) ∧ (fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO) ∧ ( ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ ¬ boolvar0 ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ boolvar0 ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∧ m8 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].size) ∧ 1 ≤ fs[ri[inodekey(m4)]].size ∧ (boolvar0 → 1 ≤ fs[ri[inodekey(m4)]].nsubdirs)

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 16:
m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink, fs[ri[inodekey(m3)]].directory, fs[ri[inodekey(m4)]].directory, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m4) ∈ ri, inodekey(m3) ∈ ri, dentrykey(m4, str) ∈ ri, inodekey(fs[ri[dentrykey(m4, str)]].ino) ∈ ri, m3 = m4 → md = md0, (links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO) ∧ ¬ dentrykey(m3, new_dent.name) ∈ ri ∧ new_dent.negdentry? ∨ (links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO) ∧ (inodekey(new_dent.ino) ∈ ri ∧ fs[ri[inodekey(new_dent.ino)]].directory ∨ inodekey(new_dent.ino) ∈ ri ∧ ¬ fs[ri[inodekey(new_dent.ino)]].directory) ∧ dentrykey(m3, new_dent.name) ∈ ri ∧ new_dent.ino = fs[ri[dentrykey(m3, new_dent.name)]].ino ∧ new_dent.dentry? ∧ ( inodekey(new_dent.ino) ∈ ri ∧ fs[ri[inodekey(new_dent.ino)]].directory ∧ m0 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m2 = fs[ri[inodekey(new_dent.ino)]].size ∧ m1 = fs[ri[inodekey(new_dent.ino)]].nsubdirs ∧ boolvar ∨ inodekey(new_dent.ino) ∈ ri ∧ ¬ fs[ri[inodekey(new_dent.ino)]].directory ∧ m0 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar) ∧ m = new_dent.ino ∧ (inodekey(new_dent.ino) ∈ ri ∧ ¬ fs[ri[inodekey(new_dent.ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory) ∧ (inodekey(new_dent.ino) ∈ ri ∧ fs[ri[inodekey(new_dent.ino)]].directory → new_dent.ino ≠ ROOT_INO ∧ abs-children(new_dent.ino, fs, ri) = ∅), fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m8 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].size ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∧ boolvar0 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m7 = 0 ∧ ¬ boolvar0, links(m4, abs-dirs(fs, ri)) ≠ ∅ ∨ m4 = ROOT_INO ⊦ ( new_dent.negdentry? ∧ (fs[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO) ∧ ¬ dentrykey(m3, new_dent.name) ∈ ri ∨ new_dent.dentry? ∧ (fs[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO) ∧ inodekey(new_dent.ino) ∈ ri ∧ dentrykey(m3, new_dent.name) ∈ ri ∧ fs[ri[dentrykey(m3, new_dent.name)]].ino = new_dent.ino ∧ ( ¬ fs[ri[inodekey(new_dent.ino)]].directory ∧ ¬ boolvar ∧ m0 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m1 = fs[ri[inodekey(new_dent.ino)]].nsubdirs ∨ fs[ri[inodekey(new_dent.ino)]].directory ∧ boolvar ∧ m0 = fs[ri[inodekey(new_dent.ino)]].nlink ∧ m1 = fs[ri[inodekey(new_dent.ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(new_dent.ino)]].size) ∧ m = new_dent.ino ∧ (¬ fs[ri[inodekey(new_dent.ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory) ∧ (fs[ri[inodekey(new_dent.ino)]].directory → dentrykeys(inodekey(new_dent.ino), ri) = ∅) ∧ new_dent.ino ≠ ROOT_INO ∧ m0 ≠ 0 ∧ (m0 = 1 → links(new_dent.ino, fs, ri) = ∅ ++ dentrykey(m3, new_dent.name))) ∧ (fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO) ∧ ( ¬ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ ¬ boolvar0 ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].directory ∧ boolvar0 ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nsubdirs ∧ m8 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].size) ∧ 1 ≤ fs[ri[inodekey(m4)]].size ∧ (boolvar0 → 1 ≤ fs[ri[inodekey(m4)]].nsubdirs)

Rule argument

fma: m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink

Additional information

Used formulas: m6 = fs[ri[inodekey(fs[ri[dentrykey(m4, str)]].ino)]].nlink