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

asynced ↔ false, cache_dirs[m] = mkdir(m0, md1, # links(m, cache_dirs), m2, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, c_inode = getinode(mkdentry(str, ino0).ino, dirs[ino, dirs[ino].meta:= inode.meta], files), dent = mkdentry(str, ino0), dirs = cache_dirs[m, mkdir(m0 + 1, md1, # links(m, cache_dirs), m2, entries[str, ino0])], err = ESUCCESS, files = (cache_files ++ ino0)[ino0, mkfile(0, md, 1, ∅)], ino = inode.ino, inode = mkinode(m, md0, true, # links(m, cache_dirs), m2, m0), 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) ), mkdentry(str, ino0).dentry?, 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), m ∈ cache_dirs, ino ∈ dirs, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟪icache_set#(p_inode, asynced; err, cache_icache); icache_set#(c_inode, asynced; err, cache_icache); dcache_set#(p_inode.ino, dent.name, dent; err, cache_dcache)⟫ ⟨dent0 := negdentry(str); p_inode0 := mkinode(m, md0, true, # links(m, cache_dirs), m2, m0); afs_create#(md; 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), ino0 = 0, ino0 ∈ cache_dirs, ino0 ∈ cache_files, str ∈ entries, ino ∈ files

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 54:
cache_dirs[m] = mkdir(m0, md1, # links(m, cache_dirs), m2, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = ESUCCESS, ino0 ≠ 0, 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), m ∈ cache_dirs, ¬ str ∈ entries, ¬ ino0 ∈ cache_files, ¬ ino0 ∈ cache_dirs, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟪icache_set#(mkinode(m, md0, true, # links(m, cache_dirs), m2, m0 + 1), false; err, cache_icache); icache_set# (getinode (mkdentry(str, ino0).ino, cache_dirs[m, (m ∈ cache_dirs ⊃ mkdir(m0 + 1, md1, # links(m, cache_dirs), m2, entries[str, ino0]);cache_dirs[m]).meta:= md0], (cache_files ++ ino0)[ino0, mkfile(0, md, 1, ∅)]), false ; err, cache_icache); dcache_set# ((m ∈ cache_dirs ⊃ mkinode(m, md0, true, # links(m, cache_dirs), m2, m0 + 1) ;mkinode (m, (m = ino0 ∧ ino0 ∈ cache_files ++ ino0 ⊃ mkfile(0, md, 1, ∅);(cache_files ++ ino0)[m]).meta, false, (m = ino0 ∧ ino0 ∈ cache_files ++ ino0 ⊃ mkfile(0, md, 1, ∅);(cache_files ++ ino0)[m]).nlink, 0, (m = ino0 ∧ ino0 ∈ cache_files ++ ino0 ⊃ mkfile(0, md, 1, ∅);(cache_files ++ ino0)[m]).size) ) .ino, str, mkdentry(str, ino0) ; err, cache_dcache)⟫ ⟨dent0 := negdentry(str); p_inode0 := mkinode(m, md0, true, # links(m, cache_dirs), m2, m0); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_create#(md; p_inode0, p_inode1, dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( cache_dirs = cache_dirs2[m, (m ∈ cache_dirs2 ⊃ mkdir(m0 + 1, md1, # links(m, cache_dirs2), m2, entries[str, ino0]);cache_dirs2[m]).meta:= md0] ∧ afs_files = ((cache_files ++ ino0)[ino0, mkfile(0, md, 1, ∅)] ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced0) ∧ (m ∈ cache_dirs2 ⊃ mkinode(m, md0, true, # links(m, cache_dirs2), m2, m0 + 1) ;mkinode (m, (m = ino0 ⊃ mkfile(0, md, 1, ∅);(cache_files ++ ino0)[m]).meta, false, (m = ino0 ⊃ mkfile(0, md, 1, ∅);(cache_files ++ ino0)[m]).nlink, 0, (m = ino0 ⊃ mkfile(0, md, 1, ∅);(cache_files ++ ino0)[m]).size) ) = p_inode0 ∧ (ino0 ∈ cache_dirs3 ⊃ mkinode (ino0, (ino0 = m ⊃ mkdir(m0 + 1, md0, # links(m, cache_dirs3), m2, entries[str, m]);cache_dirs3[ino0]).meta, true, (ino0 = m ⊃ mkdir(m0 + 1, md0, # links(m, cache_dirs3), m2, entries[str, m]);cache_dirs3[ino0]).nlink, (ino0 = m ⊃ mkdir(m0 + 1, md0, # links(m, cache_dirs3), m2, entries[str, m]);cache_dirs3[ino0]).nsubdirs, (ino0 = m ⊃ mkdir(m0 + 1, md0, # links(m, cache_dirs3), m2, entries[str, m]);cache_dirs3[ino0]).size) ;mkinode(ino0, md, false, 1, 0, 0) ) = p_inode1 ∧ mkdentry(str, ino0) = dent0 ∧ err = err0)

Rule argument

Additional information

Used simplifier rules: ⊦ 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)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (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][ino, ad0] = dirs[ino, ad0]; (s)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)%ino ≠ 0, ¬ ino ∈ files ⊦ ino0 ∈ files ++ ino ↔ ino0 = ino ∨ ino0 ∈ files; (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)