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

dirs[ino1] = mkdir(# entries0, md0, # links(ino1, dirs), m2, entries0), files[entries0[str]] = mkfile(m, md, # links(entries0[str], dirs), content), dirs[ino2] = mkdir(# entries, md1, # links(ino2, dirs), m3, entries), err1 = ESUCCESS, root[q0].dir?, root[q].dir?, root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q, ROOT_INO, ino1, dirs, files), ispath(q0, ROOT_INO, ino2, dirs, files), of-cons(of, dirs, files), pw(user, md1), px(user, md1), px(user, md0), px-parent(user, q, ROOT_INO, dirs, files), px-parent(user, q0, ROOT_INO, dirs, files), ino2 ∈ dirs, str ∈ entries0, ino1 ∈ dirs, entries0[str] ∈ files, ¬ root[q + str '].dir?, ¬ entries0[str] ∈ dirs, ¬ str0 ∈ entries, psynced → asynced, links(ino2, dirs) ≠ ∅ ∨ ino2 = ROOT_INO, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ [afs_check_commit#(dirs, files; err1; asynced); fs := abs-files(files); if err1 = ESUCCESS then {c_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); new_dent := negdentry((q0 + str0 ').last), new_inode := (ino2 ∈ dirs ⊃ mkinode(ino2, md1, true, # links(ino2, dirs), m3, # entries) ;mkinode(ino2, files[ino2].meta, false, files[ino2].nlink, 0, files[ino2].size) ); afs_link#(mkdentry(str, entries0[str]); new_inode, c_inode, new_dent, err1, dirs, files; asynced)}] ( of-cons(of, dirs, files) ∧ afs-cons(dirs, files) → ⟨posix_link#(q + str ', q0 + str0 ', user, fs, abs-of(of); err0, root; psynced)⟩ (fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err1 = err0))

User applied rule call right

And obtained the following new goals

Proof step 261:
dirs[ino2] = mkdir(# entries, md1, # links(ino2, dirs), m3, entries), files[entries0[str]] = mkfile(m, md, # links(entries0[str], dirs), content), dirs[ino1] = mkdir(# entries0, md0, # links(ino1, dirs), m2, entries0), err = err1, err1 = ESUCCESS, root.dir?, root[q].dir?, root[q0].dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(q0, ROOT_INO, ino2, dirs, files), ispath(q, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), pw(user, md1), px(user, md0), px(user, md1), px-parent(user, q0, ROOT_INO, dirs, files), px-parent(user, q, ROOT_INO, dirs, files), entries0[str] ∈ files, ino1 ∈ dirs, str ∈ entries0, ino2 ∈ dirs, psynced → asynced, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino2, dirs) ≠ ∅ ∨ ino2 = ROOT_INO ⊦ [fail_or_success#(; ; err); choose bv with true in asynced := bv; fs := abs-files(files); err1 := err; if err1 = ESUCCESS then {c_inode := getinode(mkdentry(str, entries0[str]).ino, dirs, files); new_dent := negdentry((q0 + str0 ').last), new_inode := (ino2 ∈ dirs ⊃ mkinode(ino2, md1, true, # links(ino2, dirs), m3, # entries) ;mkinode(ino2, files[ino2].meta, false, files[ino2].nlink, 0, files[ino2].size) ); afs_link#(mkdentry(str, entries0[str]); new_inode, c_inode, new_dent, err1, dirs, files; asynced)}] ( of-cons(of, dirs, files) ∧ afs-cons(dirs, files) → ⟨posix_link#(q + str ', q0 + str0 ', user, fs, abs-of(of); err0, root; psynced)⟩ (fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err1 = err0)), root[q + str '].dir?, entries0[str] ∈ dirs, str0 ∈ entries

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_check_commit#(DIRS, FILES; ERR; ASYNCED) {fail_or_success#(; ; ERR); choose bv with true in ASYNCED := bv};