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

files[ino1] = mkfile(m, md, # links(ino1, dirs), content), fs = abs-files(files), root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(path, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), px-parent(user, path, ROOT_INO, dirs, files), ROOT_INO ∈ dirs, ino1 ∈ files, ¬ root[path].dir?, ¬ pw(user, md), ¬ ino1 ∈ dirs, psynced → asynced ⊦ ¬ pw(user, path, root, fs) ∧ ⟨err0 := EACCESS; if err0 = ESUCCESS then let fid = root[path].fid in let buf = fs[fid].content in fs[fid] := mkfile(fs[fid].meta, resize(buf, n)); psynced := ?⟩ (fs = abs-files(files) ∧ (psynced → asynced) ∧ EACCESS = err0)

Heuristic dl case distinction applied rule case distinction

And obtained the following new goals

Proof step 69:
⊦ ispath(p, ino, m, dirs, files) ∧ px-parent(user, p, ino, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → (pw(user, p, tree, abs-files(files)) ↔ pw(user, meta(ε, m, dirs, files)))
Proof step 70:
files[ino1] = mkfile(m, md, # links(ino1, dirs), content), fs = abs-files(files), root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(path, ROOT_INO, ino1, dirs, files), of-cons(of, dirs, files), px-parent(user, path, ROOT_INO, dirs, files), ino1 ∈ files, ROOT_INO ∈ dirs, psynced → asynced ⊦ ⟨err0 := EACCESS; if err0 = ESUCCESS then let fid = root[path].fid in let buf = fs[fid].content in fs[fid] := mkfile(fs[fid].meta, resize(buf, n)); psynced := ?⟩ (fs = abs-files(files) ∧ (psynced → asynced) ∧ EACCESS = err0), root[path].dir?, pw(user, md), ino1 ∈ dirs

Rule argument

pos: right 1

Additional information

Used simplifier rules: pw: ⊦ ispath(p, ino, m, dirs, files) ∧ px-parent(user, p, ino, dirs, files) ∧ abs(tree, ino)(dirs) ∧ fids-cons(tree, abs-files(files), ofh) ∧ afs-cons(dirs, files) → ( pw(user, p, tree, abs-files(files)) ↔ pw(user, meta(ε, m, dirs, files)));%¬ ino ∈ dirs ⊦ ino ∈ files → meta(ε, ino, dirs, files) = files[ino].meta; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)