| # links(entries0[str], dirs0) = m1 + 1, (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str) ;mkdir(# entries, md3, # links(ino, dirs0), # subdirs(ino, dirs0), entries) ) = mkdir(m11, md4, m12, m13, entries1), dirs0[ino] = mkdir(# entries, md3, # links(ino, dirs0), # subdirs(ino, dirs0), entries), dirs0[m] = mkdir(m2 + 1, md2, # links(m, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m0, md1, m1 + 1, content), files0[ino] = mkfile(m4, md, m5, content0), afs-cons(dirs0, files0), ROOT_INO ∈ dirs0, entries0[str] ∈ files0, str ∈ entries0, m ∈ dirs0, ino ∈ dirs0, # links(ino, dirs0) ≤ 1, name ∈ entries → entries[name] ∈ dirs0 ∨ entries[name] ∈ files0, ino ≠ ROOT_INO ∧ links(ino, dirs0) = ∅ → entries = ∅, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ ino = entries0[str], m12 = # links(ino, dirs0) ∧ m11 = # entries1 ∧ m13 = # subdirs(ino, dirs0[m, mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str)]) |
Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)% ⊦ ino0 ≠ ino1 → subdirs(ino0, dirs[ino1, ad]) = subdirs(ino0, dirs); (s)%⊦ p_ino ∈ dirs ∧ dirs[p_ino] = mkdir(m, md, n0, n1, entries) → subdirs (p_ino, dirs[p_ino, mkdir(m0, md, n0, n2, entries -- str)]) = (str ∈ entries ∧ entries[str] ∈ dirs ⊃ subdirs(p_ino, dirs) -- str ;subdirs(p_ino, dirs) ); (s)% ⊦ # ∅ = 0; (s)% ⊦ m + n = 0 ↔ m = 0 ∧ n = 0; (ws)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic% ⊦ str ∈ entries → #(entries -- str) = (# entries)-1; (s)% ⊦ n -1 = n - 1; (s)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)%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% ⊦ n ≤ m → m + n0 - n = (m - n) + n0; (s)% ⊦ n + 0 = n; (s) Used formulas: ino = m