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

# links(entries0[str], cache_dirs) = cache_dirs[entries0[str]].nlink, # links(m, cache_dirs) = cache_dirs[m].nlink, cache_dirs[entries0[str]].entries = ∅, cache_dirs[m].nsubdirs = m1 + 1, cache_dirs[m].size = m0 + 1, entries0[str] = cache_dirs[m].entries[str], cache_dirs[entries0[str]] = mkdir(cache_dirs[entries0[str]].size, md3, cache_dirs[entries0[str]].nlink, cache_dirs[entries0[str]].nsubdirs, ∅), cache_dirs[m] = mkdir(m0 + 1, md1, cache_dirs[m].nlink, m1 + 1, entries0), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m, ((cache_dirs[m].entries:= (cache_dirs[m].entries -- str)).size:= m0).nsubdirs:= m1], entries0[str] ≠ 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 ∈ entries0, str ∈ cache_dirs[m].entries, m ∈ cache_dirs, entries0[str] ∈ cache_dirs, ⌊err0⌋ , cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟨afs_drop_nlink#(mkdentry(str, entries0[str]).ino; dirs, afs_files); dent := negdentry(mkdentry(str, entries0[str]).name); afs_inode_sync#(mkinode(m, md, true, cache_dirs[m].nlink, m1 + 1, m0 + 1); dirs, afs_files); afs_inode_sync# (mkinode(entries0[str], md0, true, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, cache_dirs[entries0[str]].size) ; dirs, afs_files); p_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, afs_files[m].meta, false, afs_files[m].nlink, 0, afs_files[m].size) ); c_inode := getinode(entries0[str], dirs, afs_files); err := ESUCCESS; asynced := ?⟩ ( dirs = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (asynced ↔ asynced0) ∧ mkinode(m, md, true, # links(m, cache_dirs), m1 + 1, m0 + 1) = p_inode ∧ mkinode (entries0[str], md0, true, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, cache_dirs[entries0[str]].size) = c_inode ∧ mkdentry(str, entries0[str]) = dent ∧ err0 = err), ⟨fail#(; ; err); asynced := ?⟩ ((asynced ↔ asynced0) ∧ err0 = err)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 296:
# links(m, cache_dirs) = m3, # links(entries0[str], cache_dirs) = cache_dirs[entries0[str]].nlink, cache_dirs[entries0[str]].entries = ∅, cache_dirs[m] = mkdir(m0 + 1, md1, m3, m1 + 1, entries0), cache_dirs[entries0[str]] = mkdir(cache_dirs[entries0[str]].size, md3, cache_dirs[entries0[str]].nlink, cache_dirs[entries0[str]].nsubdirs, ∅), entries0[str] = entries[str], cache_dirs[m] = mkdir(m2, md2, m3, m4, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m, ((cache_dirs[m].entries:= (entries -- str)).size:= m0).nsubdirs:= m1], m2 = m0 + 1, m4 = m1 + 1, 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), entries0[str] ∈ cache_dirs, m ∈ cache_dirs, str ∈ entries, str ∈ entries0, ⌊err0⌋ , cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟨afs_drop_nlink#(mkdentry(str, entries0[str]).ino; dirs, afs_files); dent := negdentry(mkdentry(str, entries0[str]).name); afs_inode_sync#(mkinode(m, md, true, m3, m1 + 1, m0 + 1); dirs, afs_files); afs_inode_sync# (mkinode(entries0[str], md0, true, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, cache_dirs[entries0[str]].size) ; dirs, afs_files); p_inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, afs_files[m].meta, false, afs_files[m].nlink, 0, afs_files[m].size) ); c_inode := getinode(entries0[str], dirs, afs_files); err := ESUCCESS; asynced := ?⟩ ( dirs = cache_dirs ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (asynced ↔ asynced0) ∧ mkinode(m, md, true, # links(m, cache_dirs), m1 + 1, m0 + 1) = p_inode ∧ mkinode (entries0[str], md0, true, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, cache_dirs[entries0[str]].size) = c_inode ∧ mkdentry(str, entries0[str]) = dent ∧ err0 = err), ⟨fail#(; ; err); asynced := ?⟩ ((asynced ↔ asynced0) ∧ err0 = err), entries0[str] = 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[m], m2, md2, m3, m4, entries]

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[m], m2, md2, m3, m4, entries