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

((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str0]] = mkfile(m8, md4, # links(entries0[str0], cache_dirs), content0), cache_files[entries0[str0]] = mkfile(m0, md1, # links(entries0[str0], cache_dirs), content1), cache_dirs[m2] = mkdir(m1, md, # links(m2, cache_dirs), m4, entries0), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m2, mkdir(m1, md5, # links(m2, cache_dirs), m4, entries0)], files = afs_files, ino = inode.ino, inode = mkinode(entries0[str0], md0, false, # links(entries0[str0], cache_dirs), 0, m), afs-cons (cache_dirs[m2, mkdir(m1, md5, # links(m2, cache_dirs), m4, entries0)], cache_files[entries0[str0], mkfile(m, md0, # links(entries0[str0], cache_dirs), content1)]), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), dcache-cons (cache_dcache[dentrykey(m2, str0), mkdentry(str0, entries0[str0])], cache_dirs[m2, mkdir(m1, md5, # links(m2, cache_dirs), m4, entries0)], cache_files[entries0[str0], mkfile(m, md0, # links(entries0[str0], cache_dirs), content1)]), icache-cons(cache_icache, cache_dirs, cache_files), icache-cons (cache_icache[m2, mkientry(false, mkinode(m2, md5, true, # links(m2, cache_dirs), m4, m1))] [entries0[str0], mkientry(false, mkinode(entries0[str0], md0, false, # links(entries0[str0], cache_dirs), 0, m)) ], cache_dirs[m2, mkdir(m1, md5, # links(m2, cache_dirs), m4, entries0)], cache_files[entries0[str0], mkfile(m, md0, # links(entries0[str0], cache_dirs), content1)]), pcache-cons(cache_pcache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m2, mkdir(m1, md5, # links(m2, cache_dirs), m4, entries0)], cache_files[entries0[str0], mkfile(m, md0, # links(entries0[str0], cache_dirs), content1)]), synced(cache_dirs, cache_icache, cache_pcache), synced (cache_dirs[m2, mkdir(m1, md5, # links(m2, cache_dirs), m4, entries0)], cache_icache[m2, mkientry(false, mkinode(m2, md5, true, # links(m2, cache_dirs), m4, m1))] [entries0[str0], mkientry(false, mkinode(entries0[str0], md0, false, # links(entries0[str0], cache_dirs), 0, m)) ], cache_pcache), str0 ∈ entries0, entries0[str0] ∈ cache_files, m2 ∈ cache_dirs, ino ∈ files, cache_sync → synced (cache_files[entries0[str0], mkfile(m, md0, # links(entries0[str0], cache_dirs), content1)], cache_icache[m2, mkientry(false, mkinode(m2, md5, true, # links(m2, cache_dirs), m4, m1))] [entries0[str0], mkientry(false, mkinode(entries0[str0], md0, false, # links(entries0[str0], cache_dirs), 0, m)) ], cache_pcache), cache_sync → synced(cache_files, cache_icache, cache_pcache), (entries0[str0] ∈ dirs ⊃ str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ;str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ∧ str0 ∈ entries0 ), links(m2, cache_dirs) ≠ ∅ ∨ m2 = ROOT_INO ⊦ entries0[str0] ∈ cache_dirs, ∃ asynced. mkinode(m2, md5, true, # links(m2, cache_dirs), m4, m1) = (m2 ∈ dirs ⊃ mkinode(m2, dirs[m2].meta, true, dirs[m2].nlink, dirs[m2].nsubdirs, dirs[m2].size) ;mkinode (m2, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m2].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m2].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m2].size) ) ∧ mkinode(m2, md5, true, # links(m2, cache_dirs), m4, m1) = (m2 ∈ dirs ⊃ mkinode(m2, dirs[m2].meta, true, dirs[m2].nlink, dirs[m2].nsubdirs, dirs[m2].size) ;mkinode (m2, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m2].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m2].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m2].size) ) ∧ mkinode(entries0[str0], md0, false, # links(entries0[str0], cache_dirs), 0, m) = (entries0[str0] ∈ dirs ⊃ mkinode (entries0[str0], dirs[entries0[str0]].meta, true, dirs[entries0[str0]].nlink, dirs[entries0[str0]].nsubdirs, dirs[entries0[str0]].size) ;mkinode (entries0[str0], files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][entries0[str0]].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][entries0[str0]].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][entries0[str0]].size) ) ∧ ESUCCESS = ESUCCESS ∧ dirs = cache_dirs[m2, mkdir(m1, md5, # links(m2, cache_dirs), m4, entries0)] ∧ files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta] = (cache_files[entries0[str0], (cache_files[entries0[str0]].size:= m).meta:= md0] ⊕ cache_pcache) ⊕ cache_icache[m2, mkientry(false, mkinode(m2, md5, true, # links(m2, cache_dirs), m4, m1))] [entries0[str0], mkientry(false, mkinode(entries0[str0], md0, false, # links(entries0[str0], cache_dirs), 0, m)) ] ∧ (asynced ↔ asynced2)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ 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)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ (af.size:= m).size = m; (s)% ⊦ (af.meta:= md).size = af.size; (s)% ⊦ (af.size:= m).nlink = af.nlink; (s)% ⊦ (af.meta:= md).nlink = af.nlink; (s)% ⊦ (af.meta:= md).meta = md; (s)% ⊦ files[ino, af][ino, af0] = files[ino, af0]; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (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)% ⊦ ino ∈ files ⊕ pcache ↔ ino ∈ files; (s)% ⊦ ino ∈ files ⊕ icache ↔ ino ∈ files; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)