[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 209 from proof refine-rename-file-negdentry (previous step)

# links (entries3[str], cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries3[str]]);mkdir(m1, md1, # links(m8, cache_dirs), m7, entries3 -- str)).meta:= md0 ] [m14, mkdir(m, md5, m12, m13, entries0) ]) = # links(entries3[str], cache_dirs), (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries3[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries3[str]])) = mkdir(m, md, m12, m13, entries0), (m8 = m14 ⊃ mkdir(m0 + 1, md5, m4, m6, entries1[str0, entries3[str]]);mkdir(m1, md0, # links(m8, cache_dirs), m7, entries3 -- str)) = mkdir(m5, md7, m11, m15, entries2), (m14 = m8 ⊃ mkdir(m1, md1, # links(m8, cache_dirs), m7, entries3 -- str);mkdir(m3, md4, # links(m14, cache_dirs), m10, entries)) = mkdir(m0, md6, m4, m6, entries1), cache_files[entries3[str]] = mkfile(m2, md3, # links(entries3[str], cache_dirs), content0), cache_dirs[m14] = mkdir(m3, md4, # links(m14, cache_dirs), m10, entries), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries3[str]] = mkfile(m9, md2, # links(entries3[str], cache_dirs), content), cache_dirs[m8] = mkdir(m1 + 1, md1, # links(m8, cache_dirs), m7, entries3), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, afs_files0 = files, dirs = dirs0[ino, dirs0[ino].meta:= inode.meta], dirs0 = cache_dirs[m14, mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries3[str]])] [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries3[str]]);mkdir(m1, md1, # links(m8, cache_dirs), m7, entries3 -- str)).meta:= md0 ], files = afs_files, ino = inode.ino, inode = mkinode(m14, md5, true, # links(m14, cache_dirs), m10, m3), new_child_inode = new_child_inode0, afs-cons (cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries3[str]]);mkdir(m1, md1, # links(m8, cache_dirs), m7, entries3 -- str)).meta:= md0 ] [m14, mkdir(m, md5, m12, m13, entries0) ], cache_files), 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), m8 ∈ cache_dirs, m14 ∈ cache_dirs, entries3[str] ∈ cache_files, str ∈ entries3, ino ∈ dirs0, m14 = m8 → md5 = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m14, cache_dirs) ≠ ∅ ∨ m14 = ROOT_INO, links(m8, cache_dirs) ≠ ∅ ∨ m8 = ROOT_INO ⊦ entries3[str] ∈ cache_dirs, str0 ∈ entries, ino ∈ files, ∃ asynced. mkinode(m8, md7, true, m11, m15, m5) = (m8 ∈ dirs ⊃ mkinode(m8, dirs[m8].meta, true, dirs[m8].nlink, dirs[m8].nsubdirs, dirs[m8].size) ;mkinode(m8, afs_files0[m8].meta, false, afs_files0[m8].nlink, 0, afs_files0[m8].size) ) ∧ mkinode(m14, md5, true, m12, m13, m) = (m14 ∈ dirs ⊃ mkinode(m14, dirs[m14].meta, true, dirs[m14].nlink, dirs[m14].nsubdirs, dirs[m14].size) ;mkinode(m14, afs_files0[m14].meta, false, afs_files0[m14].nlink, 0, afs_files0[m14].size) ) ∧ new_child_inode0 = new_child_inode ∧ ESUCCESS = ESUCCESS ∧ dirs = cache_dirs [m8, (m8 = m14 ⊃ mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries3[str]]) ;mkdir(m1, md1, # links(m8, cache_dirs), m7, entries3 -- str) ) .meta:= md0 ] [m14, (m14 = m8 ⊃ mkdir(m0 + 1, md0, m4, m6, entries1[str0, entries3[str]]);mkdir(m0 + 1, md6, m4, m6, entries1[str0, entries3[str]])).meta:= md5 ] ∧ afs_files0 = (cache_files ⊕ cache_pcache) ⊕ cache_icache[m8, mkientry(false, mkinode(m8, md7, true, m11, m15, m5))][m14, mkientry(false, mkinode(m14, md5, true, m12, m13, m))] ∧ (asynced ↔ asynced2)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ 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)% ⊦ (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)% ⊦ dirs[ino, ad][ino0, ad0][ino, ad1] = dirs[ino0, ad0][ino, ad1]; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (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)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ ino ∈ files ⊕ pcache ↔ ino ∈ files; (s)% ⊦ ino ∈ files ⊕ icache ↔ ino ∈ files; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)