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

# links(m, cache_dirs) = m16, # links(entries1[str], cache_dirs) = m5, # links(m3, cache_dirs) = m14, # links(entries0[str0], cache_dirs) = m7, cache_files[entries0[str0]] = mkfile(m6, md8, # links(entries0[str0], cache_dirs), content2), cache_dirs[m] = mkdir(m9, md9, # links(m, cache_dirs), m15, entries1), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str0]] = mkfile(m8, md4, # links(entries0[str0], cache_dirs), content0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries1[str]] = mkfile(m12, md3, # links(entries1[str], cache_dirs), content), cache_dirs[m3] = mkdir(m11, md6, m14, m17, entries0), entries0[str0] = entries[str0], cache_files[entries1[str]] = mkfile(m4, md7, # links(entries1[str], cache_dirs), content1), cache_dirs[m3] = mkdir(m11, md5, m14, m17, entries), afs_dirs = cache_dirs, afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = err0, m0 = m11, m14 = m1, m2 = m17, new_child_inode = mkinode(entries1[str], md1, false, # links(entries1[str], cache_dirs), 0, m10), new_dent = mkdentry(str, entries1[str]), new_parent_inode = mkinode(m, md, true, # links(m, cache_dirs), m15, m9), old_child_inode = mkinode(entries0[str0], md2, false, # links(entries0[str0], cache_dirs), 0, m13), old_dent = mkdentry(str0, entries0[str0]), old_parent_inode = mkinode(m3, md0, true, m14, m17, m11), 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), str ∈ entries1, str0 ∈ entries0, m ∈ cache_dirs, m3 ∈ cache_dirs, entries1[str] ∈ cache_files, entries0[str0] ∈ cache_files, str0 ∈ entries, cache_sync → synced(cache_files, cache_icache, cache_pcache), m = m3 → md = md0, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ [cache_rename# (; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, cache_dirs, cache_files, cache_icache, cache_dcache, cache_asynced)] ( icache-cons(cache_icache, cache_dirs, cache_files) ∧ dcache-cons(cache_dcache, cache_dirs, cache_files) ∧ pcache-cons(cache_pcache, cache_dirs, cache_files) ∧ afs-cons(cache_dirs, cache_files) ∧ synced(cache_dirs, cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files, cache_icache, cache_pcache)) → ⟨new_dent0 := mkdentry(str, entries1[str]); old_dent0 := mkdentry(str0, entries0[str0]); new_parent_inode0 := mkinode(m, md, true, m16, m15, m9); old_parent_inode0 := mkinode(m3, md0, true, m1, m2, m0); new_child_inode0 := mkinode(entries1[str], md1, false, m5, 0, m10); old_child_inode0 := mkinode(entries0[str0], md2, false, m7, 0, m13); afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err0, afs_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ old_child_inode = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ old_dent = old_dent0 ∧ new_dent = new_dent0 ∧ err = err0 ∧ afs_dirs = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ cache_asynced)))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 78:
# links(entries[str0], cache_dirs) = m7, # links(entries1[str], cache_dirs) = m5, # links(m, cache_dirs) = m16, # links(m3, cache_dirs) = m1, cache_files[entries1[str]] = mkfile(m4, md7, # links(entries1[str], cache_dirs), content1), cache_dirs[m3] = mkdir(m11, md5, # links(m3, cache_dirs), m17, entries), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries1[str]] = mkfile(m12, md3, # links(entries1[str], cache_dirs), content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str0]] = mkfile(m8, md4, # links(entries[str0], cache_dirs), content0), cache_dirs[m] = mkdir(m9, md9, # links(m, cache_dirs), m15, entries1), cache_files[entries[str0]] = mkfile(m6, md8, # links(entries[str0], cache_dirs), content2), afs_dirs = cache_dirs, afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = err0, new_child_inode = mkinode(entries1[str], md1, false, # links(entries1[str], cache_dirs), 0, m10), new_dent = mkdentry(str, entries1[str]), new_parent_inode = mkinode(m, md, true, # links(m, cache_dirs), m15, m9), old_child_inode = mkinode(entries[str0], md2, false, # links(entries[str0], cache_dirs), 0, m13), old_dent = mkdentry(str0, entries[str0]), old_parent_inode = mkinode(m3, md0, true, # links(m3, cache_dirs), m17, m11), 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), entries[str0] ∈ cache_files, entries1[str] ∈ cache_files, m3 ∈ cache_dirs, m ∈ cache_dirs, str0 ∈ entries, str ∈ entries1, m = m3 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ [cache_rename# (; old_parent_inode, new_parent_inode, old_child_inode, new_child_inode, old_dent, new_dent, err, cache_dirs, cache_files, cache_icache, cache_dcache, cache_asynced)] ( icache-cons(cache_icache, cache_dirs, cache_files) ∧ dcache-cons(cache_dcache, cache_dirs, cache_files) ∧ pcache-cons(cache_pcache, cache_dirs, cache_files) ∧ afs-cons(cache_dirs, cache_files) ∧ synced(cache_dirs, cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files, cache_icache, cache_pcache)) → ⟨new_dent0 := mkdentry(str, entries1[str]); old_dent0 := mkdentry(str0, entries[str0]); new_parent_inode0 := mkinode(m, md, true, m16, m15, m9); old_parent_inode0 := mkinode(m3, md0, true, m1, m17, m11); new_child_inode0 := mkinode(entries1[str], md1, false, m5, 0, m10); old_child_inode0 := mkinode(entries[str0], md2, false, m7, 0, m13); afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err0, afs_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ old_child_inode = old_child_inode0 ∧ new_child_inode = new_child_inode0 ∧ old_dent = old_dent0 ∧ new_dent = new_dent0 ∧ err = err0 ∧ afs_dirs = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ cache_asynced)))

Rule argument

Additional information

Used simplifier rules: ⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)