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

VFS_PAGE_SIZE = n0 + m0 % VFS_PAGE_SIZE, files1[ino2] = mkfile(m0, md0, # links(ino2, dirs), content0), fs = abs-files(files1), m0 % VFS_PAGE_SIZE ≠ 0, root.dir?, dom of < ino3, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files1), afs-cons (dirs, files1 [ino2, mkfile(n, md0, # links(ino2, dirs), content0[m0 / VFS_PAGE_SIZE, fill(content0[m0 / VFS_PAGE_SIZE], zero, m0 % VFS_PAGE_SIZE, n0)] upto m0) ]), fids-cons(root, abs-files(files1), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files1), of-cons(of, dirs, files1), of-cons (of, dirs, files1 [ino2, mkfile(n, md0, # links(ino2, dirs), content0[m0 / VFS_PAGE_SIZE, fill(content0[m0 / VFS_PAGE_SIZE], zero, m0 % VFS_PAGE_SIZE, n0)] upto m0) ]), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files1), m0 / VFS_PAGE_SIZE ∈ content0, ino2 ∈ files1, ROOT_INO ∈ dirs, m0 ≤ n, ¬ root[path].dir?, ¬ ino2 ∈ dirs, psynced → asynced0 ⊦ pw(user, path, root, fs) ∧ ⟨err0 := ESUCCESS; 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 (files1 [ino2, mkfile (n, md0, # links(ino2, dirs), content0[m0 / VFS_PAGE_SIZE, fill(content0[m0 / VFS_PAGE_SIZE], zero, m0 % VFS_PAGE_SIZE, n0)] upto m0) ]) ∧ (psynced → asynced) ∧ ESUCCESS = err0)

Heuristic dl case distinction applied rule case distinction

And obtained the following new goals

Proof step 137:
⊦ 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 138:
VFS_PAGE_SIZE = n0 + m0 % VFS_PAGE_SIZE, files1[ino2] = mkfile(m0, md0, # links(ino2, dirs), content0), fs = abs-files(files1), root.dir?, dom of < ino3, abs(root, ROOT_INO)(dirs), afs-cons (dirs, files1 [ino2, mkfile(n, md0, # links(ino2, dirs), content0[m0 / VFS_PAGE_SIZE, fill(content0[m0 / VFS_PAGE_SIZE], zero, m0 % VFS_PAGE_SIZE, n0)] upto m0) ]), afs-cons(dirs, files1), fids-cons(root, abs-files(files1), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files1), of-cons (of, dirs, files1 [ino2, mkfile(n, md0, # links(ino2, dirs), content0[m0 / VFS_PAGE_SIZE, fill(content0[m0 / VFS_PAGE_SIZE], zero, m0 % VFS_PAGE_SIZE, n0)] upto m0) ]), of-cons(of, dirs, files1), pw(user, md0), px-parent(user, path, ROOT_INO, dirs, files1), ROOT_INO ∈ dirs, ino2 ∈ files1, m0 / VFS_PAGE_SIZE ∈ content0, m0 ≤ n, psynced → asynced0 ⊦ ⟨err0 := ESUCCESS; 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 (files1 [ino2, mkfile (n, md0, # links(ino2, dirs), content0[m0 / VFS_PAGE_SIZE, fill(content0[m0 / VFS_PAGE_SIZE], zero, m0 % VFS_PAGE_SIZE, n0)] upto m0) ]) ∧ (psynced → asynced) ∧ ESUCCESS = err0), m0 % VFS_PAGE_SIZE = 0, root[path].dir?, ino2 ∈ 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)