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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 452:
(m7 = entries0[str0] ⊃ mkdir(m1, md0, # links(entries0[str0], dirs0), m4, entries0);mkdir(m1, md2, # links(m7, dirs0), m4, entries0)) = mkdir(m0, md, m2, m5, entries), dirs0[entries0[str0]] = mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅), dirs0[m7] = mkdir(m1, md1, # links(m7, dirs0), m4, entries0), err = ESUCCESS, icache = icache0[m7, mkientry(false, mkinode(m7, md, true, m2, m5, m0))], entries0[str0] ≠ ROOT_INO, afs-cons (dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m7 ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0) ;mkdir(m3, md3, # links(entries0[str0], dirs0), m6, ∅) ) .meta:= md0 ], files), afs-cons(dirs0, files), dcache-cons(dcache, dirs0, files), icache-cons(icache0, dirs0, files), pcache-cons(pcache, dirs0, files), synced(dirs0, icache0, pcache), m7 ∈ dirs0, str0 ∈ entries0, entries0[str0] ∈ dirs0, asynced2 → synced(files, icache0, pcache), links(m7, dirs0) ≠ ∅ ∨ m7 = ROOT_INO ⊦ ⟪icache_set# (mkinode (entries0[str0], dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)] [entries0[str0], dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)][entries0[str0]].meta:= md0 ] [entries0[str0] ] .meta, true, dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)] [entries0[str0], dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)][entries0[str0]].meta:= md0 ] [entries0[str0] ] .nlink, dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)] [entries0[str0], dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)][entries0[str0]].meta:= md0 ] [entries0[str0] ] .nsubdirs, dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)] [entries0[str0], dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)][entries0[str0]].meta:= md0 ] [entries0[str0] ] .size), false ; err, icache); dcache_delete#(m7, mkdentry(str0, entries0[str0]).name; err, dcache); dcache_set# (m7, mkdentry(mkdentry(str0, entries0[str0]).name, mkdentry(str0, entries0[str0]).ino).name, mkdentry(mkdentry(str0, entries0[str0]).name, mkdentry(str0, entries0[str0]).ino) ; err, dcache)⟫ ( icache-cons (icache, dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m7 ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0);dirs0[entries0[str0]]).meta:= md0 ], files) ∧ dcache-cons (dcache, dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m7 ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0);dirs0[entries0[str0]]).meta:= md0 ], files) ∧ pcache-cons (pcache, dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m7 ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0);dirs0[entries0[str0]]).meta:= md0 ], files) ∧ synced (dirs0[m7, mkdir(m1, md2, # links(m7, dirs0), m4, entries0)] [entries0[str0], (entries0[str0] = m7 ⊃ mkdir(m1, md2, # links(entries0[str0], dirs0), m4, entries0);dirs0[entries0[str0]]).meta:= md0 ], icache, pcache) ∧ (asynced2 → synced(files, icache, pcache)))

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2) = mkinode(m3, md0, boolvar0, m4, m5, m6) ↔ m = m3 ∧ md = md0 ∧ (boolvar ↔ boolvar0) ∧ m0 = m4 ∧ m1 = m5 ∧ m2 = m6; (ws)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)