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

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), 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), px(user, md0), 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, ¬ root[q + str '].dir?, ¬ entries0[str] ∈ dirs, psynced → asynced, links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO, ¬ px(user, md1) ∨ ¬ pw(user, md1) ⊦ (¬ px(user, q, ROOT_INO, dirs, files) ∨ ¬ py(user, q0, ROOT_INO, dirs, files)) ∧ ⟨err0 := EACCESS; if err0 = ESUCCESS then let fid = root[q + str '].fid in root[q0 + str0 '] := fnode(fid); psynced := ?⟩ (abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ EACCESS = err0)

Heuristic dl case distinction applied rule case distinction

And obtained the following new goals

Proof step 213:
⊦ ispath(p, ino, m, dirs, files) ∧ py(user, p, ino, dirs, files) → pw(user, meta(ε, m, dirs, files))
Proof step 214:
⊦ ispath(p, ino, m, dirs, files) ∧ py(user, p, ino, dirs, files) → px(user, meta(ε, m, dirs, files))
Proof step 215:
⊦ ispath(p, ino, m, dirs, files) ∧ py(user, p, ino, dirs, files) → px(user, p, ino, dirs, files)
Proof step 216:
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), 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), 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, psynced → asynced, ¬ px(user, md1) ∨ ¬ pw(user, md1), links(ino1, dirs) ≠ ∅ ∨ ino1 = ROOT_INO ⊦ ⟨err0 := EACCESS; if err0 = ESUCCESS then let fid = root[q + str '].fid in root[q0 + str0 '] := fnode(fid); psynced := ?⟩ (abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ EACCESS = err0), root[q + str '].dir?, entries0[str] ∈ dirs

Rule argument

pos: right 1

Additional information

Used simplifier rules: py-pw: ⊦ ispath(p, ino, m, dirs, files) ∧ py(user, p, ino, dirs, files) → pw(user, meta(ε, m, dirs, files));%py-last: ⊦ ispath(p, ino, m, dirs, files) ∧ py(user, p, ino, dirs, files) → px(user, meta(ε, m, dirs, files));%py-px: ⊦ ispath(p, ino, m, dirs, files) ∧ py(user, p, ino, dirs, files) → px(user, p, ino, dirs, files);%⊦ px(user, p, ino, dirs, files) → px-parent(user, p, ino, dirs, files); (s)% ⊦ ino ∈ dirs → meta(ε, ino, dirs, files) = dirs[ino].meta; (s)% ⊦ mkdir(m, md, m0, m1, entries).meta = md; (s)