[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 272 from proof refine-unlink (previous step)

⟨vfs_put_inode#(getinode(entries0[str], dirs, files), of, asynced; err, dirs, files)⟩ (err = err0 ∧ dirs = dirs1 ∧ files = files1), # entries0 = m0 + 1, # links(entries0[str], dirs0) = m + 1, files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), err = ESUCCESS, files = files0[entries0[str], mkfile(m1, md1, m, content0)], fs = abs-files(files0), entries0 ≠ ∅, root[q].dir?, root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs0), afs-cons(dirs1, files1), afs-cons(dirs0, files0), fids-cons(root, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs1, files1), of-cons(of, dirs0, files0), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), entries0[str] ∈ files0, ino1 ∈ dirs0, str ∈ entries0, dirs ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], ¬ root[q + str '].dir?, ¬ entries0[str] ∈ dirs0, psynced → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ ⟨posix_unlink#(q + str ', user, abs-of(of); err1, root, fs; psynced)⟩ (fs = abs-files(files1) ∧ abs(root, ROOT_INO)(dirs1) ∧ (psynced → asynced) ∧ err0 = err1)

User applied rule cut formula

And obtained the following new goals

Proof step 273:
⟨vfs_put_inode#(getinode(entries0[str], dirs, files), of, asynced; err, dirs, files)⟩ (err = err0 ∧ dirs = dirs1 ∧ files = files1), # links(entries0[str], dirs0) = m + 1, # entries0 = m0 + 1, dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), dirs = dirs1, err = ESUCCESS, files = files0[entries0[str], mkfile(m1, md1, m, content0)], fs = abs-files(files0), root.dir?, root[q].dir?, dom of < ino0, abs(root, ROOT_INO)(dirs0), afs-cons(dirs0, files0), afs-cons(dirs1, files1), fids-cons(root, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs0, files0), of-cons(of, dirs1, files1), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), str ∈ entries0, ino1 ∈ dirs0, entries0[str] ∈ files0, dirs ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ ⟨posix_unlink#(q + str ', user, abs-of(of); err1, root, fs; psynced)⟩ (fs = abs-files(files1) ∧ abs(root, ROOT_INO)(dirs1) ∧ (psynced → asynced) ∧ err0 = err1), entries0 = ∅, root[q + str '].dir?, entries0[str] ∈ dirs0
Proof step 407:
⟨vfs_put_inode#(getinode(entries0[str], dirs, files), of, asynced; err, dirs, files)⟩ (err = err0 ∧ dirs = dirs1 ∧ files = files1), # links(entries0[str], dirs0) = m + 1, # entries0 = m0 + 1, dirs0[ino1] = mkdir(m0 + 1, md0, # links(ino1, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m1, md1, m + 1, content0), err = ESUCCESS, files = files0[entries0[str], mkfile(m1, md1, m, content0)], fs = abs-files(files0), root.dir?, root[q].dir?, dom of < ino0, abs(root, ROOT_INO)(dirs0), afs-cons(dirs0, files0), afs-cons(dirs1, files1), fids-cons(root, abs-files(files0), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs0, files0), of-cons(of, dirs0, files0), of-cons(of, dirs1, files1), pw(user, md0), px(user, md0), px-parent(user, q, ROOT_INO, dirs0, files0), str ∈ entries0, ino1 ∈ dirs0, entries0[str] ∈ files0, dirs ≡ dirs0[ino1, mkdir(m0, md0, # links(ino1, dirs0), m3, entries0 -- str)], psynced → asynced0, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ ⟨posix_unlink#(q + str ', user, abs-of(of); err1, root, fs; psynced)⟩ (fs = abs-files(files1) ∧ abs(root, ROOT_INO)(dirs1) ∧ (psynced → asynced) ∧ err0 = err1), dirs = dirs1, entries0 = ∅, root[q + str '].dir?, entries0[str] ∈ dirs0

Rule argument

fma: dirs = dirs1

Additional information

Used formulas: dirs = dirs1