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

old_child_inode.ino = fs[ri[dentrykey(old_parent_inode.ino, str)]].ino, new_parent_inode.nlink = fs[ri[inodekey(new_parent_inode.ino)]].nlink, old_parent_inode.nlink = fs[ri[inodekey(old_parent_inode.ino)]].nlink, new_parent_inode.nsubdirs = fs[ri[inodekey(new_parent_inode.ino)]].nsubdirs, old_parent_inode.nsubdirs = fs[ri[inodekey(old_parent_inode.ino)]].nsubdirs, new_parent_inode.size = fs[ri[inodekey(new_parent_inode.ino)]].size, old_parent_inode.size = fs[ri[inodekey(old_parent_inode.ino)]].size, new_child_inode = mkinode(m, md, boolvar, m0, m1, m2), new_parent_inode.directory, fs[ri[inodekey(new_parent_inode.ino)]].directory, old_parent_inode.directory, fs[ri[inodekey(old_parent_inode.ino)]].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(old_parent_inode.ino) ∈ ri, inodekey(new_parent_inode.ino) ∈ ri, dentrykey(old_parent_inode.ino, str) ∈ ri, new_parent_inode.ino = old_parent_inode.ino → new_parent_inode.meta = old_parent_inode.meta, inodekey(old_child_inode.ino) ∈ ri ∧ fs[ri[inodekey(old_child_inode.ino)]].directory ∧ old_child_inode.nlink = fs[ri[inodekey(old_child_inode.ino)]].nlink ∧ old_child_inode.size = fs[ri[inodekey(old_child_inode.ino)]].size ∧ old_child_inode.nsubdirs = fs[ri[inodekey(old_child_inode.ino)]].nsubdirs ∧ old_child_inode.directory ∨ inodekey(old_child_inode.ino) ∈ ri ∧ ¬ fs[ri[inodekey(old_child_inode.ino)]].directory ∧ old_child_inode.nlink = fs[ri[inodekey(old_child_inode.ino)]].nlink ∧ old_child_inode.nsubdirs = 0 ∧ ¬ old_child_inode.directory, inodekey(old_child_inode.ino) ∈ ri ∧ fs[ri[inodekey(old_child_inode.ino)]].directory ∨ inodekey(old_child_inode.ino) ∈ ri ∧ ¬ fs[ri[inodekey(old_child_inode.ino)]].directory, links(old_parent_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ old_parent_inode.ino = ROOT_INO, (links(new_parent_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ new_parent_inode.ino = ROOT_INO) ∧ ¬ dentrykey(new_parent_inode.ino, new_dent.name) ∈ ri ∧ new_dent.negdentry? ∨ (links(new_parent_inode.ino, abs-dirs(fs, ri)) ≠ ∅ ∨ new_parent_inode.ino = 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(new_parent_inode.ino, new_dent.name) ∈ ri ∧ new_dent.ino = fs[ri[dentrykey(new_parent_inode.ino, new_dent.name)]].ino ∧ new_dent.dentry? ∧ ( inodekey(m) ∈ ri ∧ fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m2 = fs[ri[inodekey(m)]].size ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar ∨ inodekey(m) ∈ ri ∧ ¬ fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar) ∧ m = new_dent.ino ∧ ( inodekey(new_dent.ino) ∈ ri ∧ ¬ fs[ri[inodekey(new_dent.ino)]].directory ↔ inodekey(old_child_inode.ino) ∈ ri ∧ ¬ fs[ri[inodekey(old_child_inode.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? ∧ (new_parent_inode.nlink ≠ 0 ∨ new_parent_inode.ino = ROOT_INO) ∧ ¬ dentrykey(new_parent_inode.ino, new_dent.name) ∈ ri ∨ new_dent.dentry? ∧ (new_parent_inode.nlink ≠ 0 ∨ new_parent_inode.ino = ROOT_INO) ∧ inodekey(new_dent.ino) ∈ ri ∧ dentrykey(new_parent_inode.ino, new_dent.name) ∈ ri ∧ fs[ri[dentrykey(new_parent_inode.ino, new_dent.name)]].ino = new_dent.ino ∧ ( inodekey(m) ∈ ri ∧ ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∨ inodekey(m) ∈ ri ∧ fs[ri[inodekey(m)]].directory ∧ boolvar ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ m2 = fs[ri[inodekey(m)]].size) ∧ m = new_dent.ino ∧ (¬ fs[ri[inodekey(new_dent.ino)]].directory ↔ ¬ fs[ri[inodekey(old_child_inode.ino)]].directory) ∧ (fs[ri[inodekey(new_dent.ino)]].directory → new_dent.ino ≠ ROOT_INO ∧ dentrykeys(inodekey(new_dent.ino), ri) = ∅) ∧ m ≠ ROOT_INO ∧ m0 ≠ 0 ∧ (m0 = 1 → links(m, fs, ri) = ∅ ++ dentrykey(new_parent_inode.ino, new_dent.name))) ∧ (old_parent_inode.nlink ≠ 0 ∨ old_parent_inode.ino = ROOT_INO) ∧ inodekey(old_child_inode.ino) ∈ ri ∧ ( ¬ fs[ri[inodekey(old_child_inode.ino)]].directory ∧ ¬ old_child_inode.directory ∧ old_child_inode.nlink = fs[ri[inodekey(old_child_inode.ino)]].nlink ∧ old_child_inode.nsubdirs = fs[ri[inodekey(old_child_inode.ino)]].nsubdirs ∨ fs[ri[inodekey(old_child_inode.ino)]].directory ∧ old_child_inode.directory ∧ old_child_inode.nlink = fs[ri[inodekey(old_child_inode.ino)]].nlink ∧ old_child_inode.nsubdirs = fs[ri[inodekey(old_child_inode.ino)]].nsubdirs ∧ old_child_inode.size = fs[ri[inodekey(old_child_inode.ino)]].size) ∧ 1 ≤ old_parent_inode.size ∧ (old_child_inode.directory → 1 ≤ old_parent_inode.nsubdirs)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information