[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 29 from proof inv-renam (previous step)

entries[str0] ∈ files ↔ entries0[str] ∈ files, dirs[entries0[str]] = mkdir(m15, md7, m17, m18, entries1), dirs[m] = mkdir(m12, md5, # links(m, dirs), m14, entries), files[entries0[str]] = mkfile(m5, md3, m9, content), files[entries[str0]] = mkfile(m10, md4, m11, content0), dirs[m4] = mkdir(m13, md6, # links(m4, dirs), m16, entries0), dirs[entries[str0]] = mkdir(m19, md8, m20, m21, entries2), new_child_inode = mkinode(entries[str0], md0, boolvar, m1, m2, m3), new_dent = mkdentry(str0, entries[str0]), new_parent_inode = mkinode(m, md, true, # links(m, dirs), m14, m12), old_child_inode = mkinode(entries0[str], md2, boolvar0, m6, m7, m8), old_dent = mkdentry(str, entries0[str]), old_parent_inode = mkinode(m4, md1, true, # links(m4, dirs), m16, m13), afs-cons(dirs, files), str0 ∈ entries, m4 ∈ dirs, str ∈ entries0, m ∈ dirs, entries[str0] ∈ dirs → entries[str0] ≠ ROOT_INO ∧ entries2 = ∅, m = m4 → md = md1, entries[str0] ∈ dirs ∧ m1 = m20 ∧ m3 = m19 ∧ m2 = m21 ∧ boolvar ∨ entries0[str] ∈ files ∧ m1 = m11 ∧ m2 = 0 ∧ ¬ boolvar, entries[str0] ∈ dirs ∨ entries0[str] ∈ files, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, links(m4, dirs) ≠ ∅ ∨ m4 = ROOT_INO, entries0[str] ∈ dirs ∨ entries0[str] ∈ files, entries0[str] ∈ dirs ∧ m6 = m17 ∧ m8 = m15 ∧ m7 = m18 ∧ boolvar0 ∨ entries0[str] ∈ files ∧ m6 = m9 ∧ m7 = 0 ∧ ¬ boolvar0 ⊦ ⟪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)

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 30:
entries[str0] ∈ files ↔ entries0[str] ∈ files, dirs[entries[str0]] = mkdir(m19, md8, m20, m21, entries2), dirs[m4] = mkdir(m13, md6, # links(m4, dirs), m16, entries0), files[entries[str0]] = mkfile(m10, md4, m11, content0), files[entries0[str]] = mkfile(m5, md3, m9, content), dirs[m] = mkdir(m12, md5, # links(m, dirs), m14, entries), dirs[entries0[str]] = mkdir(m15, md7, m17, m18, entries1), new_child_inode = mkinode(entries[str0], md0, boolvar, m1, m2, m3), new_dent = mkdentry(str0, entries[str0]), new_parent_inode = mkinode(m, md, true, # links(m, dirs), m14, m12), old_child_inode = mkinode(entries0[str], md2, boolvar0, m6, m7, m8), old_dent = mkdentry(str, entries0[str]), old_parent_inode = mkinode(m4, md1, true, # links(m4, dirs), m16, m13), afs-cons(dirs, files), m ∈ dirs, str ∈ entries0, m4 ∈ dirs, str0 ∈ entries, m = m4 → md = md1, entries[str0] ∈ dirs → entries[str0] ≠ ROOT_INO ∧ entries2 = ∅, entries0[str] ∈ dirs ∧ m6 = m17 ∧ m8 = m15 ∧ m7 = m18 ∧ boolvar0 ∨ entries0[str] ∈ files ∧ m6 = m9 ∧ m7 = 0 ∧ ¬ boolvar0, entries0[str] ∈ dirs ∨ entries0[str] ∈ files, links(m4, dirs) ≠ ∅ ∨ m4 = ROOT_INO, links(m, dirs) ≠ ∅ ∨ m = ROOT_INO, entries[str0] ∈ dirs ∨ entries0[str] ∈ files, entries[str0] ∈ dirs ∧ m1 = m20 ∧ m3 = m19 ∧ m2 = m21 ∧ boolvar ∨ entries0[str] ∈ files ∧ m1 = m11 ∧ m2 = 0 ∧ ¬ boolvar ⊦ ⟪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), entries[str0] = ROOT_INO

Rule argument

fma: entries[str0] = ROOT_INO

Additional information

Used simplifier rules: afs-cons-file-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ files ∧ files[ino] = mkfile(m, md, n, content) → # links(ino, dirs) = n; (forward) from specification afs-base% ⊦ afs-cons(dirs, files) → ¬ ROOT_INO ∈ files; (s) Used formulas: entries[str0] = ROOT_INO