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

(entries0[str] = m ⊃ mkdir(m0, md1, # links(entries0[str], cache_dirs), m1, entries0 -- str) ;mkdir(m2, md3, # links(entries0[str], cache_dirs), m4, ∅) ) = mkdir(m5, md2, m3 + 1, m7, entries), asynced ↔ false, cache_dirs[m] = mkdir(m0 + 1, md1, # links(m, cache_dirs), m1 + 1, entries0), cache_dirs[entries0[str]] = mkdir(m2, md3, # links(entries0[str], cache_dirs), m4, ∅), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, c_inode = getinode(entries0[str], dirs[ino, dirs[ino].meta:= inode.meta], files), dent = negdentry(mkdentry(str, entries0[str]).name), dirs = cache_dirs[entries0[str], mkdir(m5, md2, m3, m7, entries)] [m, (m = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m, cache_dirs), m1, entries0 -- str)).meta:= md ], err = ESUCCESS, files = cache_files, ino = inode.ino, inode = mkinode(entries0[str], md0, true, # links(entries0[str], cache_dirs), m4, m2), p_inode = (m ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m, dirs[ino, dirs[ino].meta:= inode.meta][m].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[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), ino ∈ dirs, entries0[str] ∈ cache_dirs, m ∈ cache_dirs, str ∈ entries0, 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[ino, dirs[ino].meta:= inode.meta], files) ∧ dcache-cons(cache_dcache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ pcache-cons(cache_pcache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ synced(dirs[ino, dirs[ino].meta:= inode.meta], cache_icache, cache_pcache) ∧ (cache_sync → synced(files, cache_icache, cache_pcache)) ∧ afs-cons(dirs[ino, dirs[ino].meta:= inode.meta], files) → ⟨dent0 := mkdentry(str, entries0[str]); p_inode0 := mkinode(m, md, true, # links(m, cache_dirs), m1 + 1, m0 + 1); p_inode1 := mkinode(entries0[str], md0, true, # links(entries0[str], cache_dirs), m4, m2); afs_rmdir#(; p_inode0, p_inode1, dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( cache_dirs = dirs[ino, dirs[ino].meta:= inode.meta] ∧ afs_files = (files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced0) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ dent = dent0 ∧ err = err0)), entries0[str] = ROOT_INO, ino ∈ files

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkdentry(str, m).name = str; (s)% ⊦ (ad.meta:= md).size = ad.size; (s)% ⊦ (ad.meta:= md).nsubdirs = ad.nsubdirs; (s)% ⊦ (ad.meta:= md).nlink = ad.nlink; (s)% ⊦ (ad.meta:= md).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)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ negdentry(str).name = str; (s)% ⊦ dirs[ino, ad][ino0, ad0][ino, ad1] = dirs[ino0, ad0][ino, ad1]; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)%⊦ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) ∧ str ∈ entries ∧ afs-cons(dirs, files) → (entries[str] ∈ files ↔ ¬ entries[str] ∈ dirs); (ss)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)