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

# links(m, cache_dirs) = cache_dirs[m].nlink, # links(m3, cache_dirs) = cache_dirs[m3].nlink, # links(entries0[str], cache_dirs) = cache_dirs[entries0[str]].nlink, # links(entries[str0], cache_dirs) = m7, cache_dirs[m].nlink = m5, cache_dirs[m3].nlink = m20, entries0[str] = cache_dirs[m].entries[str], entries[str0] = cache_dirs[m3].entries[str0], cache_dirs[entries0[str]] = mkdir(cache_dirs[entries0[str]].size, md7, cache_dirs[entries0[str]].nlink, cache_dirs[entries0[str]].nsubdirs, entries1), cache_dirs[m3] = mkdir(cache_dirs[m3].size, md5, cache_dirs[m3].nlink, cache_dirs[m3].nsubdirs, entries), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str]] = mkfile(m15, md3, m16, content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str0]] = mkfile(m17, md4, m18, content0), cache_dirs[m] = mkdir(cache_dirs[m].size, md6, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, entries0), cache_dirs[entries[str0]] = mkdir(m1, md9, # links(entries[str0], cache_dirs), m9, ∅), afs_dirs0 = cache_dirs, afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = err0, m0 = cache_dirs[entries0[str]].size, m12 = cache_dirs[entries0[str]].nlink, m19 = cache_dirs[m3].size, m2 = cache_dirs[entries0[str]].nsubdirs, m21 = cache_dirs[m3].nsubdirs, m4 = cache_dirs[m].size, m6 = cache_dirs[m].nsubdirs, new_child_inode = mkinode(entries[str0], md1, true, # links(entries[str0], cache_dirs), m9, m1), new_dent = mkdentry(str0, entries[str0]), new_parent_inode = mkinode(m3, md0, true, cache_dirs[m3].nlink, cache_dirs[m3].nsubdirs, cache_dirs[m3].size), new_parent_inode1 = mkinode(m3, md0, true, cache_dirs[m3].nlink, cache_dirs[m3].nsubdirs, cache_dirs[m3].size), old_child_inode = mkinode(entries0[str], md2, true, cache_dirs[entries0[str]].nlink, cache_dirs[entries0[str]].nsubdirs, cache_dirs[entries0[str]].size), old_child_inode1 = mkinode(entries0[str], md2, true, cache_dirs[entries0[str]].nlink, cache_dirs[entries0[str]].nsubdirs, cache_dirs[entries0[str]].size), old_dent = mkdentry(str, entries0[str]), old_parent_inode = mkinode(m, md, true, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, cache_dirs[m].size), old_parent_inode1 = mkinode(m, md, true, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, cache_dirs[m].size), entries[str0] ≠ ROOT_INO, 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 ∈ cache_dirs[m].entries, str0 ∈ cache_dirs[m3].entries, str0 ∈ entries, m3 ∈ cache_dirs, str ∈ entries0, m ∈ cache_dirs, entries0[str] ∈ cache_dirs, entries[str0] ∈ cache_dirs, m3 = m → md0 = md, 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)] ( ⟨new_dent1 := mkdentry(str0, entries[str0]); old_dent2 := mkdentry(str, entries0[str]); new_child_inode1 := mkinode(entries[str0], md1, true, m7, m9, m1); afs_rename# (; old_parent_inode1, new_parent_inode1, old_child_inode1, new_child_inode1, old_dent2, new_dent1, err0, afs_dirs0, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode1 ∧ new_parent_inode = new_parent_inode1 ∧ old_child_inode = old_child_inode1 ∧ new_child_inode = new_child_inode1 ∧ old_dent = old_dent2 ∧ new_dent = new_dent1 ∧ err = err0 ∧ afs_dirs0 = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ cache_asynced)) → ⟨old_dent0 := mkdentry(str, entries0[str]); p_inode := mkinode(m, md, true, m5, m6, m4); p_inode0 := mkinode(m3, md0, true, m20, m21, m19); p_inode2 := mkinode(entries[str0], md1, true, m7, m9, m1); p_inode1 := mkinode(entries0[str], md2, true, m12, m2, m0); old_dent1 := mkdentry(str0, entries[str0]); afs_rename#(; p_inode, p_inode0, p_inode1, p_inode2, old_dent0, old_dent1, err0, afs_dirs0, afs_files; afs_asynced)⟩ ( afs_dirs0 = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ cache_asynced) ∧ old_parent_inode = p_inode ∧ new_parent_inode = p_inode0 ∧ old_child_inode = p_inode1 ∧ new_child_inode = p_inode2 ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0))

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 87:
# links(entries[str0], cache_dirs) = m7, # links(entries0[str], cache_dirs) = cache_dirs[entries0[str]].nlink, # links(m3, cache_dirs) = m10, # links(m, cache_dirs) = cache_dirs[m].nlink, cache_dirs[m].nlink = m5, cache_dirs[entries[str0]] = mkdir(m1, md9, # links(entries[str0], cache_dirs), m9, ∅), cache_dirs[m] = mkdir(cache_dirs[m].size, md6, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, entries0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str0]] = mkfile(m17, md4, m18, content0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str]] = mkfile(m15, md3, m16, content), cache_dirs[m3] = mkdir(m8, md5, m10, m11, entries), cache_dirs[entries0[str]] = mkdir(cache_dirs[entries0[str]].size, md7, cache_dirs[entries0[str]].nlink, cache_dirs[entries0[str]].nsubdirs, entries1), entries[str0] = entries2[str0], entries0[str] = cache_dirs[m].entries[str], cache_dirs[m3] = mkdir(m8, md8, m10, m11, entries2), afs_dirs0 = cache_dirs, afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = err0, m0 = cache_dirs[entries0[str]].size, m10 = m20, m12 = cache_dirs[entries0[str]].nlink, m19 = m8, m2 = cache_dirs[entries0[str]].nsubdirs, m21 = m11, m4 = cache_dirs[m].size, m6 = cache_dirs[m].nsubdirs, new_child_inode = mkinode(entries[str0], md1, true, # links(entries[str0], cache_dirs), m9, m1), new_dent = mkdentry(str0, entries[str0]), new_parent_inode = mkinode(m3, md0, true, m10, m11, m8), new_parent_inode1 = mkinode(m3, md0, true, m10, m11, m8), old_child_inode = mkinode(entries0[str], md2, true, cache_dirs[entries0[str]].nlink, cache_dirs[entries0[str]].nsubdirs, cache_dirs[entries0[str]].size), old_child_inode1 = mkinode(entries0[str], md2, true, cache_dirs[entries0[str]].nlink, cache_dirs[entries0[str]].nsubdirs, cache_dirs[entries0[str]].size), old_dent = mkdentry(str, entries0[str]), old_parent_inode = mkinode(m, md, true, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, cache_dirs[m].size), old_parent_inode1 = mkinode(m, md, true, cache_dirs[m].nlink, cache_dirs[m].nsubdirs, cache_dirs[m].size), 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_dirs, entries0[str] ∈ cache_dirs, m ∈ cache_dirs, str ∈ entries0, m3 ∈ cache_dirs, str0 ∈ entries, str0 ∈ entries2, str ∈ cache_dirs[m].entries, cache_sync → synced(cache_files, cache_icache, cache_pcache), m3 = m → md0 = md, 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)] ( ⟨new_dent1 := mkdentry(str0, entries[str0]); old_dent2 := mkdentry(str, entries0[str]); new_child_inode1 := mkinode(entries[str0], md1, true, m7, m9, m1); afs_rename# (; old_parent_inode1, new_parent_inode1, old_child_inode1, new_child_inode1, old_dent2, new_dent1, err0, afs_dirs0, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode1 ∧ new_parent_inode = new_parent_inode1 ∧ old_child_inode = old_child_inode1 ∧ new_child_inode = new_child_inode1 ∧ old_dent = old_dent2 ∧ new_dent = new_dent1 ∧ err = err0 ∧ afs_dirs0 = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ cache_asynced)) → ⟨old_dent0 := mkdentry(str, entries0[str]); p_inode := mkinode(m, md, true, m5, m6, m4); p_inode0 := mkinode(m3, md0, true, m20, m21, m19); p_inode2 := mkinode(entries[str0], md1, true, m7, m9, m1); p_inode1 := mkinode(entries0[str], md2, true, m12, m2, m0); old_dent1 := mkdentry(str0, entries[str0]); afs_rename#(; p_inode, p_inode0, p_inode1, p_inode2, old_dent0, old_dent1, err0, afs_dirs0, afs_files; afs_asynced)⟩ ( afs_dirs0 = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ cache_asynced) ∧ old_parent_inode = p_inode ∧ new_parent_inode = p_inode0 ∧ old_child_inode = p_inode1 ∧ new_child_inode = p_inode2 ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0)), entries[str0] = ROOT_INO

Rule argument

spec: abstract-dir name: elim seq: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries) subst: [ad, m, md, m0, m1, entries] → [cache_dirs[m3], m8, md8, m10, m11, entries2]

Additional information

Used simplifier rules: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries); (elim) Used terms: cache_dirs[m3], m8, md8, m10, m11, entries2