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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 267:
cache_dirs[m] = mkdir(m0 + 1, md1, # links(m, cache_dirs), m4, entries0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str]] = mkfile(m7, md2, # links(entries0[str], cache_dirs), content0), cache_files[entries0[str]] = mkfile(m1, md3, # links(entries0[str], cache_dirs), content), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, dirs = cache_dirs[m, mkdir(m0, md1, # links(m, cache_dirs), m4, entries0 -- str)], 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), m ∈ cache_dirs, entries0[str] ∈ cache_files, 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, # links(m, cache_dirs), m4, m0 + 1); dirs, afs_files); afs_inode_sync#(mkinode(entries0[str], md0, false, # links(entries0[str], cache_dirs), 0, m6); 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), m4, m0 + 1) = p_inode ∧ mkinode(entries0[str], md0, false, # links(entries0[str], cache_dirs), 0, m6) = c_inode ∧ mkdentry(str, entries0[str]) = dent ∧ err0 = err), ⟨fail#(; ; err); asynced := ?⟩ ((asynced ↔ asynced0) ∧ err0 = err)

Rule argument

Additional information

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