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

(ino2 ∈ dirs ⊃ mkinode(ino2, dirs[ino2].meta, true, dirs[ino2].nlink, dirs[ino2].nsubdirs, dirs[ino2].size) ;mkinode(ino2, files[ino2].meta, false, files[ino2].nlink, 0, files[ino2].size) ) = mkinode(m, md1, boolvar, m0, m1, m2), root[path].dir? ↔ ino2 ∈ dirs, ino = ino3, ino0 = ino4, md = md0, root.dir?, dom of < ino6, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files), of-cons(of, dirs, files), px-parent(user, path, ROOT_INO, dirs, files), psynced → asynced, ino2 ∈ dirs ∨ ino2 ∈ files ⊦ pre-readmeta(path, EACCESS, user, root, abs-files(files), abs-of(of)) ∧ ⟨err0 := EACCESS; if err0 = ESUCCESS then if ino2 ∈ dirs then md := root[path].meta, ino0 := # root[path].subdirs + 2, ino := # root[path].entries else let fid = root[path].fid in md := abs-files(files)[fid].meta, ino0 := count(fid, root.fids), ino := # abs-files(files)[fid].content⟩ ((psynced → asynced) ∧ md0 = md ∧ ino4 = ino0 ∧ ino3 = ino ∧ EACCESS = err0), pr(user, md1)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 256:
⊦ 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) → (pr(user, p, tree, abs-files(files)) ↔ pr(user, meta(ε, m, dirs, files)))
Proof step 257:
(ino2 ∈ dirs ⊃ mkinode(ino2, dirs[ino2].meta, true, dirs[ino2].nlink, dirs[ino2].nsubdirs, dirs[ino2].size) ;mkinode(ino2, files[ino2].meta, false, files[ino2].nlink, 0, files[ino2].size) ) = mkinode(m, md1, boolvar, m0, m1, m2), root[path].dir? ↔ ino2 ∈ dirs, ino = ino3, ino0 = ino4, md = md0, root.dir?, dom of < ino6, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), ispath(path, ROOT_INO, ino2, dirs, files), of-cons(of, dirs, files), px-parent(user, path, ROOT_INO, dirs, files), ¬ pr(user, md1), psynced → asynced, ino2 ∈ dirs ∨ ino2 ∈ files ⊦ ¬ pr(user, meta(ε, ino2, dirs, files)) ∧ ⟨err0 := EACCESS; if err0 = ESUCCESS then if ino2 ∈ dirs then md := root[path].meta, ino0 := # root[path].subdirs + 2, ino := # root[path].entries else let fid = root[path].fid in md := abs-files(files)[fid].meta, ino0 := count(fid, root.fids), ino := # abs-files(files)[fid].content⟩ ((psynced → asynced) ∧ md0 = md ∧ ino4 = ino0 ∧ ino3 = ino ∧ EACCESS = err0)

Rule argument

Additional information

Used simplifier rules: pr: ⊦ 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) → ( pr(user, p, tree, abs-files(files)) ↔ pr(user, meta(ε, m, dirs, files)));%⊦ pre-readmeta(p, EACCESS, user, root, fs, ofh) ↔ ¬ pr(user, p, root, fs); (s)