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

(entries0[str] = m6 ⊃ mkdir(m0, md1, # links(entries0[str], cache_dirs), m1, entries0 -- str) ;mkdir(m2, md3, # links(entries0[str], cache_dirs), m4, ∅) ) = mkdir(m5, md2, m3 + 1, m7, entries), cache_dirs[entries0[str]] = mkdir(m2, md3, # links(entries0[str], cache_dirs), m4, ∅), cache_dirs[m6] = mkdir(m0 + 1, md1, # links(m6, cache_dirs), m1 + 1, entries0), err = ESUCCESS, icache = cache_icache [entries0[str], mkientry (false, mkinode (entries0[str], md0, true, (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).nlink, (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).nsubdirs, (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).size)) ], 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, m6 ∈ cache_dirs, entries0[str] ∈ cache_dirs, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m6, cache_dirs) ≠ ∅ ∨ m6 = ROOT_INO ⊦ [icache_set# (mkinode (m6, cache_dirs[m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md] [entries0[str], cache_dirs[entries0[str], mkdir(m5, md2, m3, m7, entries)] [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md ] [entries0[str] ] .meta:= md0 ] [m6 ] .meta, true, cache_dirs[m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md] [entries0[str], cache_dirs[entries0[str], mkdir(m5, md2, m3, m7, entries)] [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md ] [entries0[str] ] .meta:= md0 ] [m6 ] .nlink, cache_dirs[m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md] [entries0[str], cache_dirs[entries0[str], mkdir(m5, md2, m3, m7, entries)] [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md ] [entries0[str] ] .meta:= md0 ] [m6 ] .nsubdirs, cache_dirs[m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md] [entries0[str], cache_dirs[entries0[str], mkdir(m5, md2, m3, m7, entries)] [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md ] [entries0[str] ] .meta:= md0 ] [m6 ] .size), false ; err, icache); dcache_delete#(m6, mkdentry(str, entries0[str]).name; err, cache_dcache)] ( icache-cons (icache, cache_dirs [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).meta:= md0 ], cache_files) ∧ dcache-cons (cache_dcache, cache_dirs [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).meta:= md0 ], cache_files) ∧ pcache-cons (cache_pcache, cache_dirs [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).meta:= md0 ], cache_files) ∧ synced (cache_dirs [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).meta:= md0 ], icache, cache_pcache) ∧ (cache_sync → synced(cache_files, icache, cache_pcache)) ∧ afs-cons (cache_dirs [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs), m1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).meta:= md0 ], cache_files) → ⟨dent0 := mkdentry(str, entries0[str]); p_inode0 := mkinode(m6, md, true, # links(m6, cache_dirs), m1 + 1, m0 + 1); p_inode1 := mkinode(entries0[str], md0, true, # links(entries0[str], cache_dirs), m4, m2); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_files := (cache_files ⊕ cache_pcache) ⊕ cache_icache; afs_rmdir#(; p_inode0, p_inode1, dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( cache_dirs = cache_dirs2 [m6, (m6 = entries0[str] ⊃ mkdir(m5, md2, m3, m7, entries);mkdir(m0, md1, # links(m6, cache_dirs2), m1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m6 ∧ entries0[str] ∈ cache_dirs2 ⊃ mkdir(m5, md, m3, m7, entries) ;(entries0[str] ∈ cache_dirs2 ⊃ mkdir(m5, md2, m3, m7, entries);cache_dirs2[entries0[str]]) ) .meta:= md0 ] ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ icache ∧ (afs_asynced ↔ asynced0) ∧ (m6 ∈ cache_dirs2 ⊃ mkinode (m6, (m6 = entries0[str] ⊃ mkdir(m5, md0, m3, m7, entries);mkdir(m0, md, # links(m6, cache_dirs2), m1, entries0 -- str)).meta, true, (m6 = entries0[str] ⊃ mkdir(m5, md0, m3, m7, entries);mkdir(m0, md, # links(m6, cache_dirs2), m1, entries0 -- str)).nlink, (m6 = entries0[str] ⊃ mkdir(m5, md0, m3, m7, entries);mkdir(m0, md, # links(m6, cache_dirs2), m1, entries0 -- str)).nsubdirs, (m6 = entries0[str] ⊃ mkdir(m5, md0, m3, m7, entries);mkdir(m0, md, # links(m6, cache_dirs2), m1, entries0 -- str)).size) ;mkinode(m6, cache_files[m6].meta, false, cache_files[m6].nlink, 0, cache_files[m6].size) ) = p_inode0 ∧ (entries0[str] ∈ cache_dirs3 ⊃ mkinode (entries0[str], md0, true, (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).nlink, (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).nsubdirs, (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries);mkdir(m5, md2, m3, m7, entries)).size) ;mkinode(entries0[str], cache_files[entries0[str]].meta, false, cache_files[entries0[str]].nlink, 0, cache_files[entries0[str]].size) ) = p_inode1 ∧ negdentry(str) = dent0 ∧ err = err0))

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

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] → [(entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries) ;mkdir(m5, md2, m3, m7, entries) ), m, md4, m8, m9, entries1]

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: (entries0[str] = m6 ⊃ mkdir(m5, md, m3, m7, entries) ;mkdir(m5, md2, m3, m7, entries) ), m, md4, m8, m9, entries1