Proof step 12 from proof afs-cons-rename-dentry (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

• Proof step 13:

  old_child_inode.ino = dirs[m0].entries[str0], dirs[m].entries[str] ∈ files ↔ old_child_inode.ino ∈ files, new_child_inode = mkinode(dirs[m].entries[str], md1, boolvar, m2, m3, m4), new_dent = mkdentry(str, dirs[m].entries[str]), new_parent_inode = mkinode(m, md, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size), old_dent = mkdentry(str0, old_child_inode.ino), old_parent_inode = mkinode(m0, md0, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size), afs-cons(dirs, files), str ∈ dirs[m].entries, str0 ∈ dirs[m0].entries, m ∈ dirs, m0 ∈ dirs, dirs[m].entries[str] ∈ dirs → dirs[m].entries[str] ≠ ROOT_INO ∧ dirs[dirs[m].entries[str]].entries = ∅, m = m0 → md = md0, dirs[m].entries[str] ∈ dirs ∨ old_child_inode.ino ∈ files, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, old_child_inode.ino ∈ dirs ∨ old_child_inode.ino ∈ files, links(m0, dirs) ≠ ∅ ∨ m0 = ROOT_INO, dirs[m].entries[str] ∈ dirs ∧ m2 = dirs[dirs[m].entries[str]].nlink ∧ m4 = dirs[dirs[m].entries[str]].size ∧ m3 = dirs[dirs[m].entries[str]].nsubdirs ∧ boolvar ∨ old_child_inode.ino ∈ files ∧ m2 = files[dirs[m].entries[str]].nlink ∧ m3 = 0 ∧ ¬ boolvar, old_child_inode.ino ∈ dirs ∧ old_child_inode.nlink = dirs[old_child_inode.ino].nlink ∧ old_child_inode.size = dirs[old_child_inode.ino].size ∧ old_child_inode.nsubdirs = dirs[old_child_inode.ino].nsubdirs ∧ old_child_inode.directory ∨ old_child_inode.ino ∈ files ∧ old_child_inode.nlink = files[old_child_inode.ino].nlink ∧ old_child_inode.nsubdirs = 0 ∧ ¬ old_child_inode.directory ⊦ ⟪afs_rename#(; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, dirs, files; asynced)⟫ afs-cons(dirs, files)

Rule argument

Additional information