| # entries0 = m + 1, dirs0[ino1] = mkdir(m + 1, md2, # links(ino1, dirs0), m2, entries0), root[q] = dnode(md2, sdt), root[q + str '] = dnode(md1, ∅), dirs0[entries0[str]] = mkdir(0, md, # links(entries0[str], dirs0), m3, ∅), dirs1[entries0[str]] = mkdir(m0, md0, m1, m4, entries), dirs[entries0[str]] = mkdir(# entries2, md3, # links(entries0[str], dirs), m7, entries2), (( abs(sdt[str], entries0[str]) * abs(sdt -- str, entries0 -- str) * ino1 => mkdir(m, md2, # links(ino1, dirs0), m2 - 1, entries0 -- str) * abs|(root, ROOT_INO, q, ino1)) )(dirs1), root.dir?, dom of < ino0, afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files), of-cons(of, dirs, files), of-cons(of, dirs0, files), pw(user, md2), px(user, md2), px-parent(user, q, ROOT_INO, dirs0, files), ROOT_INO ∈ dirs0, entries0[str] ∈ dirs, str ∈ sdt, entries0[str] ∈ dirs1, entries0[str] ∈ dirs0, str ∈ entries0, ino1 ∈ dirs2, entries0[str] ∈ dirs3, q ∈ root, ino1 ∈ dirs0, dirs ≡ dirs3[entries0[str], dirs3[entries0[str]].meta:= md], dirs3 ≡ dirs2[ino1, dirs2[ino1].meta:= md2], dirs1 ≡ dirs0[ino1, mkdir(m, md2, # links(ino1, dirs0), m2 - 1, entries0 -- str)], dirs2 ≡ dirs1[entries0[str], mkdir(m0, md0, m1 - 1, m4, entries)], 1 ≤ m2, 1 ≤ m1, psynced0 → asynced0, entries0[str] ∈ dirs0 ∧ entries0[str] ≠ ROOT_INO ∧ links(entries0[str], dirs0) = ∅ → dirs0[entries0[str]].entries = ∅, entries0[str] ∈ dirs0 → ¬ entries0[str] ∈ files ∧ dirs0[entries0[str]].nlink = # links(entries0[str], dirs0) ∧ dirs0[entries0[str]].nlink ≤ 1 ∧ dirs0[entries0[str]].size = # dirs0[entries0[str]].entries ∧ dirs0[entries0[str]].nsubdirs = # subdirs(entries0[str], dirs0), entries0[str] ∈ files → ¬ entries0[str] ∈ dirs0 ∧ files[entries0[str]].nlink = # links(entries0[str], dirs0), ∀ ino. (ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links(ino, dirs0) = ∅ → dirs0[ino].entries = ∅) ∧ ( ino ∈ dirs0 → ¬ ino ∈ files ∧ dirs0[ino].nlink = # links(ino, dirs0) ∧ dirs0[ino].nlink ≤ 1 ∧ dirs0[ino].size = # dirs0[ino].entries ∧ dirs0[ino].nsubdirs = # subdirs(ino, dirs0)) ∧ (ino ∈ files → ¬ ino ∈ dirs0 ∧ files[ino].nlink = # links(ino, dirs0)) ∧ (∀ name. ino ∈ dirs0 ∧ name ∈ dirs0[ino].entries → dirs0[ino].entries[name] ∈ dirs0 ∨ dirs0[ino].entries[name] ∈ files) ∧ (∀ n. ino ∈ files ∧ n ∈ files[ino].content → # files[ino].content[n] = VFS_PAGE_SIZE), ∀ name. entries0[str] ∈ dirs0 ∧ name ∈ dirs0[entries0[str]].entries → dirs0[entries0[str]].entries[name] ∈ dirs0 ∨ dirs0[entries0[str]].entries[name] ∈ files, ∀ n. entries0[str] ∈ files ∧ n ∈ files[entries0[str]].content → # files[entries0[str]].content[n] = VFS_PAGE_SIZE, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ # links(entries0[str], dirs) = 0, entries0[str] = ROOT_INO, entries0 = ∅, links(entries0[str], dirs) = ∅, m1 = 0, m2 = 0, abs(root -- (q + str '), ROOT_INO)(dirs) |
# entries0 = m + 1, dirs[entries0[str]] = mkdir(# entries2, md3, # links(entries0[str], dirs), m7, entries2), dirs1[entries0[str]] = mkdir(m0, md0, m1, m4, entries), dirs0[entries0[str]] = mkdir(0, md, # links(entries0[str], dirs0), # subdirs(entries0[str], dirs0), ∅), root[q + str '] = dnode(md1, ∅), root[q] = dnode(md2, sdt), dirs0[ino1] = mkdir(m + 1, md2, # links(ino1, dirs0), m2, entries0), (( abs(sdt[str], entries0[str]) * abs(sdt -- str, entries0 -- str) * ino1 => mkdir(m, md2, # links(ino1, dirs0), m2 - 1, entries0 -- str) * abs|(root, ROOT_INO, q, ino1)) )(dirs1), root.dir?, dom of < ino0, afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files), of-cons(of, dirs0, files), of-cons(of, dirs, files), pw(user, md2), px(user, md2), px-parent(user, q, ROOT_INO, dirs0, files), ino1 ∈ dirs0, q ∈ root, entries0[str] ∈ dirs3, ino1 ∈ dirs2, str ∈ entries0, entries0[str] ∈ dirs0, entries0[str] ∈ dirs1, str ∈ sdt, entries0[str] ∈ dirs, ROOT_INO ∈ dirs0, dirs2 ≡ dirs1[entries0[str], mkdir(m0, md0, m1 - 1, m4, entries)], dirs1 ≡ dirs0[ino1, mkdir(m, md2, # links(ino1, dirs0), m2 - 1, entries0 -- str)], dirs3 ≡ dirs2[ino1, dirs2[ino1].meta:= md2], dirs ≡ dirs3[entries0[str], dirs3[entries0[str]].meta:= md], 1 ≤ m1, 1 ≤ m2, # links(entries0[str], dirs0) ≤ 1, # links(entries0[str], dirs0) ≤ m1, # links(entries0[str], dirs0) ≤ m2, psynced0 → asynced0, ∀ ino. (ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links(ino, dirs0) = ∅ → dirs0[ino].entries = ∅) ∧ ( ino ∈ dirs0 → ¬ ino ∈ files ∧ dirs0[ino].nlink = # links(ino, dirs0) ∧ dirs0[ino].nlink ≤ 1 ∧ dirs0[ino].size = # dirs0[ino].entries ∧ dirs0[ino].nsubdirs = # subdirs(ino, dirs0)) ∧ (ino ∈ files → ¬ ino ∈ dirs0 ∧ files[ino].nlink = # links(ino, dirs0)) ∧ (∀ name. ino ∈ dirs0 ∧ name ∈ dirs0[ino].entries → dirs0[ino].entries[name] ∈ dirs0 ∨ dirs0[ino].entries[name] ∈ files) ∧ (∀ n. ino ∈ files ∧ n ∈ files[ino].content → # files[ino].content[n] = VFS_PAGE_SIZE), links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ # links(entries0[str], dirs) = 0, entries0[str] = ROOT_INO, entries0 = ∅, links(entries0[str], dirs) = ∅, m1 = 0, m2 = 0, abs(root -- (q + str '), ROOT_INO)(dirs)
Used simplifier rules: ⊦ ¬ str ∈ ∅; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ # ∅ = 0; (s)% ⊦ mkdir(m, md, m0, m1, entries).entries = entries; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)%let: ⊦ n ≤ n0 ∧ n0 ≤ n1 → n ≤ n1; (forward) from specification nat%⊦ p_ino ∈ dirs ∧ dirs[p_ino] = mkdir(m, md, n, n0, entries) ∧ str ∈ entries → links(entries[str], dirs) ≠ ∅; (s)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)