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

(entries[str0] = m0 ⊃ mkdir(m1, md0, # links(entries[str0], cache_dirs), m4, entries) ;mkdir(m1, md2, # links(entries[str0], cache_dirs), m4, ∅) ) = mkdir(m7, md1, m8, m9, entries1), (m0 = entries[str0] ⊃ mkdir(m1, md5, # links(entries[str0], cache_dirs), m4, entries);mkdir(m, md0, # links(m0, cache_dirs), m5, entries)) = mkdir(m3, md4, m6, m10, entries2), cache_dirs[entries[str0]] = mkdir(m1, md2, # links(entries[str0], cache_dirs), m4, ∅), cache_dirs[m0] = mkdir(m, md, # links(m0, cache_dirs), m5, entries), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), dcache-cons (cache_dcache[dentrykey(m0, str0), mkdentry(str0, entries[str0])], cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_files), icache-cons(cache_icache, cache_dirs, cache_files), icache-cons (cache_icache[m0, mkientry(false, mkinode(m0, md4, true, m6, m10, m3))][entries[str0], mkientry(false, mkinode(entries[str0], md5, true, m8, m9, m7))], cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_files), synced(cache_dirs, cache_icache, cache_pcache), synced (cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)], cache_icache[m0, mkientry(false, mkinode(m0, md4, true, m6, m10, m3))][entries[str0], mkientry(false, mkinode(entries[str0], md5, true, m8, m9, m7))], cache_pcache), m0 ∈ cache_dirs, str0 ∈ entries, entries[str0] ∈ cache_dirs, cache_sync → synced(cache_files, cache_icache, cache_pcache), cache_sync → synced (cache_files, cache_icache[m0, mkientry(false, mkinode(m0, md4, true, m6, m10, m3))] [entries[str0], mkientry(false, mkinode(entries[str0], md5, true, m8, m9, m7)) ], cache_pcache), links(m0, cache_dirs) ≠ ∅ ∨ m0 = ROOT_INO ⊦ entries[str0] = ROOT_INO, mkinode(m0, md4, true, m6, m10, m3) = mkinode (m0, (m0 = entries[str0] ⊃ mkdir(m, md5, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m, md0, # links(m0, cache_dirs), m5, entries) ) .meta, true, (m0 = entries[str0] ⊃ mkdir(m, md5, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m, md0, # links(m0, cache_dirs), m5, entries) ) .nlink, (m0 = entries[str0] ⊃ mkdir(m, md5, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m, md0, # links(m0, cache_dirs), m5, entries) ) .nsubdirs, (m0 = entries[str0] ⊃ mkdir(m, md5, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m, md0, # links(m0, cache_dirs), m5, entries) ) .size) ∧ mkinode(entries[str0], md5, true, m8, m9, m7) = mkinode (entries[str0], md5, true, (entries[str0] = m0 ⊃ mkdir(m, md0, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m1, md2, # links(entries[str0], cache_dirs), m4, ∅) ) .nlink, (entries[str0] = m0 ⊃ mkdir(m, md0, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m1, md2, # links(entries[str0], cache_dirs), m4, ∅) ) .nsubdirs, (entries[str0] = m0 ⊃ mkdir(m, md0, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m1, md2, # links(entries[str0], cache_dirs), m4, ∅) ) .size) ∧ cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)] [entries[str0], (entries[str0] = m0 ⊃ mkdir(m, md0, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m1, md2, # links(entries[str0], cache_dirs), m4, ∅) ) .meta:= md5 ] = cache_dirs[m0, mkdir(m, md0, # links(m0, cache_dirs), m5, entries)][entries[str0], mkdir(m7, md5, m8, m9, entries1)] ∧ (cache_files ⊕ cache_pcache) ⊕ cache_icache = (cache_files ⊕ cache_pcache) ⊕ cache_icache[m0, mkientry(false, mkinode(m0, md4, true, m6, m10, m3))] [entries[str0], mkientry(false, mkinode(entries[str0], md5, true, m8, m9, m7)) ]

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] → [(m0 = entries[str0] ⊃ mkdir (m, md5, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m, md0, # links(m0, cache_dirs), m5, entries) ), m2, md3, m11, m12, entries0]

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: (m0 = entries[str0] ⊃ mkdir(m, md5, # links(entries[str0], cache_dirs), m5, entries) ;mkdir(m, md0, # links(m0, cache_dirs), m5, entries) ), m2, md3, m11, m12, entries0