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

# links(entries[str], cache_dirs) = m0 + 1, asynced ↔ false, cache_files[entries[str]] = mkfile(m2, md3, m0 + 1, content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m7, md2, m0 + 1, content0), cache_dirs[m] = mkdir(m1 + 1, md4, # links(m, cache_dirs), m4, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, c_inode = getinode(entries[str], dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]), dent = negdentry(mkdentry(str, entries[str]).name), dirs = cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], err = ESUCCESS, files = cache_files[entries[str], mkfile(m2, md3, m0, content)], ino = inode.ino, inode = mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6), p_inode = (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m].size) ), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries, ino ∈ files, m ∈ cache_dirs, entries[str] ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ [icache_set#(c_inode, asynced; err, cache_icache); icache_set#(p_inode, asynced; err, cache_icache); dcache_delete#(p_inode.ino, dent.name; err, cache_dcache)] ( icache-cons (cache_icache, dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ dcache-cons (cache_dcache, dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ pcache-cons (cache_pcache, dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ synced(dirs, cache_icache, cache_pcache) ∧ ( cache_sync → synced (files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta], cache_icache, cache_pcache)) ∧ afs-cons(dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) → ⟨dent0 := mkdentry(str, entries[str]); p_inode0 := mkinode(m, md, true, # links(m, cache_dirs), m4, m1 + 1); p_inode1 := mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6); afs_unlink#(; p_inode0, p_inode1, dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( cache_dirs = dirs ∧ afs_files = (files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta] ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced0) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ dent = dent0 ∧ err = err0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 96:
# links(entries[str], cache_dirs) = m0 + 1, cache_dirs[m] = mkdir(m1 + 1, md4, # links(m, cache_dirs), m4, entries), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m7, md2, m0 + 1, content0), cache_files[entries[str]] = mkfile(m2, md3, m0 + 1, content), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = ESUCCESS, afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), str ∈ entries, m ∈ cache_dirs, entries[str] ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ [icache_set# (getinode (entries[str], cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files [entries[str], cache_files[entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]].size:= m6][entries[str]].meta:= md0 ]), false ; err, cache_icache); icache_set# ((m ∈ cache_dirs ⊃ mkinode(m, md, true, # links(m, cache_dirs), m4, m1) ;mkinode (m, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .meta, false, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .nlink, 0, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .size) ), false ; err, cache_icache); dcache_delete# ((m ∈ cache_dirs ⊃ mkinode(m, md, true, # links(m, cache_dirs), m4, m1) ;mkinode (m, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .meta, false, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .nlink, 0, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .size) ) .ino, mkdentry(str, entries[str]).name ; err, cache_dcache)] ( icache-cons (cache_icache, cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ dcache-cons (cache_dcache, cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ pcache-cons (cache_pcache, cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ synced(cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files[entries[str], mkfile(m6, md0, m0, content)], cache_icache, cache_pcache)) ∧ afs-cons (cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) → ⟨dent0 := mkdentry(str, entries[str]); p_inode0 := mkinode(m, md, true, # links(m, cache_dirs), m4, m1 + 1); p_inode1 := mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_unlink#(; p_inode0, p_inode1, dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( cache_dirs = cache_dirs2[m, mkdir(m1, md, # links(m, cache_dirs2), m4, entries -- str)] ∧ afs_files = (cache_files[entries[str], mkfile(m6, md0, m0, content)] ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced0) ∧ (m ∈ cache_dirs2 ⊃ mkinode(m, md, true, # links(m, cache_dirs2), m4, m1) ;mkinode (m, (m = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m]).meta, false, (m = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m]).nlink, 0, (m = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m]).size) ) = p_inode0 ∧ (entries[str] ∈ cache_dirs3 ⊃ mkinode (entries[str], (entries[str] = m ⊃ mkdir(m1, md, # links(entries[str], cache_dirs3), m4, entries -- str);cache_dirs3[entries[str]]).meta, true, (entries[str] = m ⊃ mkdir(m1, md, # links(entries[str], cache_dirs3), m4, entries -- str);cache_dirs3[entries[str]]).nlink, (entries[str] = m ⊃ mkdir(m1, md, # links(entries[str], cache_dirs3), m4, entries -- str);cache_dirs3[entries[str]]).nsubdirs, (entries[str] = m ⊃ mkdir(m1, md, # links(entries[str], cache_dirs3), m4, entries -- str);cache_dirs3[entries[str]]).size) ;mkinode(entries[str], md0, false, m0, 0, m6) ) = p_inode1 ∧ negdentry(str) = dent0 ∧ err = err0))

Rule argument

Additional information

Used simplifier rules: ⊦ mkdentry(str, m).name = str; (s)% ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)%⊦ getinode(ino, dirs, files) = (ino ∈ dirs ⊃ mkinode (ino, dirs[ino].meta, true, dirs[ino].nlink, dirs[ino].nsubdirs, dirs[ino].size) ;mkinode (ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ); (s)% ⊦ mkfile(m, md, m0, content).meta:= md0 = mkfile(m, md0, m0, content); (s)% ⊦ mkfile(m, md, m0, content).size:= m1 = mkfile(m1, md, m0, content); (s)% ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (s)% ⊦ negdentry(str).name = str; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkdir(m, md, m0, m1, entries).meta = md; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ files[ino, af][ino, af0] = files[ino, af0]; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)