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

(entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)) = mkdir(m, md4, m8, m9, entries1), (entries0[str] = m5 ⊃ mkdir(m0 - 1, md1, # links(entries0[str], dirs0), m2 - 1, entries0 -- str) ;mkdir(m1, md3, # links(entries0[str], dirs0), m4, ∅) ) = mkdir(m3, md2, m7 + 1, m6, entries), dirs0[m5] = mkdir(m0, md1, # links(m5, dirs0), m2, entries0), dirs0[entries0[str]] = mkdir(m1, md3, # links(entries0[str], dirs0), m4, ∅), err = ESUCCESS, entries0[str] ≠ ROOT_INO, m0 ≠ 0, m2 ≠ 0, afs-cons (dirs0[m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md] [entries0[str], mkdir(m, md0, m8, m9, entries1) ], files), afs-cons(dirs0, files), dcache-cons(dcache, dirs0, files), icache-cons(icache0, dirs0, files), pcache-cons(pcache, dirs0, files), synced(dirs0, icache0, pcache), m5 ∈ dirs0, str ∈ entries0, entries0[str] ∈ dirs0, 1 ≤ m0, 1 ≤ m2, asynced1 → synced(files, icache0, pcache), links(m5, dirs0) ≠ ∅ ∨ m5 = ROOT_INO ⊦ ⟪dcache_delete#(m5, str; err, dcache)⟫ ( icache-cons (icache0[entries0[str], mkientry(false, mkinode(entries0[str], md0, true, m8, m9, m))] [m5, mkientry (false, mkinode (m5, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta, true, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).nlink, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).nsubdirs, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).size)) ], dirs0 [m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)).meta:= md0 ], files) ∧ dcache-cons (dcache, dirs0 [m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)).meta:= md0 ], files) ∧ pcache-cons (pcache, dirs0 [m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)).meta:= md0 ], files) ∧ synced (dirs0 [m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)).meta:= md0 ], icache0[entries0[str], mkientry(false, mkinode(entries0[str], md0, true, m8, m9, m))] [m5, mkientry (false, mkinode (m5, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta, true, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).nlink, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).nsubdirs, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).size)) ], pcache) ∧ ( asynced1 → synced (files, icache0[entries0[str], mkientry(false, mkinode(entries0[str], md0, true, m8, m9, m))] [m5, mkientry (false, mkinode (m5, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta, true, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).nlink, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).nsubdirs, (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)).size)) ], pcache)))

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 89:
(entries0[str] = m5 ⊃ mkdir(m0 - 1, md1, # links(entries0[str], dirs0), m2 - 1, entries0 -- str) ;mkdir(m1, md3, # links(entries0[str], dirs0), m4, ∅) ) = mkdir(m3, md2, m7 + 1, m6, entries), (entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)) = mkdir(m, md4, m8, m9, entries1), (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries);mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str)) = mkdir(m10, md5, m11, m12, entries2), dirs0[entries0[str]] = mkdir(m1, md3, # links(entries0[str], dirs0), m4, ∅), dirs0[m5] = mkdir(m0, md1, # links(m5, dirs0), m2, entries0), err = ESUCCESS, afs-cons(dirs0, files), afs-cons (dirs0[m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md] [entries0[str], mkdir(m, md0, m8, m9, entries1) ], files), dcache-cons(dcache, dirs0, files), icache-cons(icache0, dirs0, files), pcache-cons(pcache, dirs0, files), synced(dirs0, icache0, pcache), entries0[str] ∈ dirs0, str ∈ entries0, m5 ∈ dirs0, 1 ≤ m2, 1 ≤ m0, asynced1 → synced(files, icache0, pcache), links(m5, dirs0) ≠ ∅ ∨ m5 = ROOT_INO ⊦ ⟪dcache_delete#(m5, str; err, dcache)⟫ ( icache-cons (icache0[entries0[str], mkientry(false, mkinode(entries0[str], md0, true, m8, m9, m))] [m5, mkientry(false, mkinode(m5, md5, true, m11, m12, m10)) ], dirs0 [m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)).meta:= md0 ], files) ∧ dcache-cons (dcache, dirs0 [m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)).meta:= md0 ], files) ∧ pcache-cons (pcache, dirs0 [m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)).meta:= md0 ], files) ∧ synced (dirs0 [m5, (m5 = entries0[str] ⊃ mkdir(m3, md2, m7, m6, entries);mkdir(m0 - 1, md1, # links(m5, dirs0), m2 - 1, entries0 -- str)).meta:= md ] [entries0[str], (entries0[str] = m5 ⊃ mkdir(m3, md, m7, m6, entries);mkdir(m3, md2, m7, m6, entries)).meta:= md0 ], icache0[entries0[str], mkientry(false, mkinode(entries0[str], md0, true, m8, m9, m))] [m5, mkientry(false, mkinode(m5, md5, true, m11, m12, m10)) ], pcache) ∧ ( asynced1 → synced (files, icache0[entries0[str], mkientry(false, mkinode(entries0[str], md0, true, m8, m9, m))] [m5, mkientry(false, mkinode(m5, md5, true, m11, m12, m10)) ], pcache))), entries0[str] = ROOT_INO, m0 = 0, m2 = 0

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] → [(m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries) ;mkdir (m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str) ), m10, md5, m11, m12, 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: (m5 = entries0[str] ⊃ mkdir(m3, md0, m7, m6, entries) ;mkdir(m0 - 1, md, # links(m5, dirs0), m2 - 1, entries0 -- str) ), m10, md5, m11, m12, entries2