[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 608 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, 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), links(m2, cache_dirs) ≠ ∅ ∨ m2 = ROOT_INO ⊦ ⟨if ino ∈ files then {files[ino].size := inode.size; files[ino].meta := inode.meta} else if ino ∈ dirs then dirs[ino].meta := inode.meta; new_child_inode := (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[entries0[str0]].meta, false, files[entries0[str0]].nlink, 0, files[entries0[str0]].size) ); old_parent_inode := (m2 ∈ dirs ⊃ mkinode(m2, dirs[m2].meta, true, dirs[m2].nlink, dirs[m2].nsubdirs, dirs[m2].size) ;mkinode(m2, files[m2].meta, false, files[m2].nlink, 0, files[m2].size) ); new_parent_inode := (m2 ∈ dirs ⊃ mkinode(m2, dirs[m2].meta, true, dirs[m2].nlink, dirs[m2].nsubdirs, dirs[m2].size) ;mkinode(m2, files[m2].meta, false, files[m2].nlink, 0, files[m2].size) ); err := ESUCCESS; asynced := ?⟩ ( mkinode(m2, md5, true, # links(m2, cache_dirs), m4, m1) = old_parent_inode ∧ mkinode(m2, md5, true, # links(m2, cache_dirs), m4, m1) = new_parent_inode ∧ mkinode(entries0[str0], md0, false, # links(entries0[str0], cache_dirs), 0, m) = new_child_inode ∧ ESUCCESS = err ∧ dirs = cache_dirs[m2, mkdir(m1, md5, # links(m2, cache_dirs), m4, entries0)] ∧ files = (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)), entries0[str0] ∈ cache_dirs

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information