[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 443 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), asynced ↔ false, 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[inode.ino, mkientry(asynced, inode)], inode = 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# (( m ∈ 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 ] ⊃ mkinode(m, md, true, m2, m5, m0) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ), false ; err, icache); inode := mkinode(entries0[str0], md0, true, # links(entries0[str0], dirs0), m6, m3); ino := entries0[str0]; dirs := dirs0[m, mkdir(m1, md2, # links(m, dirs0), m4, entries0)]; icache_set# ((entries0[str0] ∈ dirs ⊃ mkinode (entries0[str0], dirs[ino, dirs[ino].meta:= inode.meta][entries0[str0]].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][entries0[str0]].nlink, dirs[ino, dirs[ino].meta:= inode.meta][entries0[str0]].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][entries0[str0]].size) ;mkinode(entries0[str0], files[entries0[str0]].meta, false, files[entries0[str0]].nlink, 0, files[entries0[str0]].size) ), false ; err, icache); dcache_delete# ((m ∈ dirs ⊃ mkinode (m, (m = ino ∧ ino ∈ dirs ⊃ dirs[ino].meta:= inode.meta;dirs[m]).meta, true, (m = ino ∧ ino ∈ dirs ⊃ dirs[ino].meta:= inode.meta;dirs[m]).nlink, (m = ino ∧ ino ∈ dirs ⊃ dirs[ino].meta:= inode.meta;dirs[m]).nsubdirs, (m = ino ∧ ino ∈ dirs ⊃ dirs[ino].meta:= inode.meta;dirs[m]).size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ) .ino, mkdentry(str0, entries0[str0]).name ; err, dcache); dcache_set# ((m ∈ dirs ⊃ mkinode (m, (m = ino ∧ ino ∈ dirs ⊃ dirs[ino].meta:= inode.meta;dirs[m]).meta, true, (m = ino ∧ ino ∈ dirs ⊃ dirs[ino].meta:= inode.meta;dirs[m]).nlink, (m = ino ∧ ino ∈ dirs ⊃ dirs[ino].meta:= inode.meta;dirs[m]).nsubdirs, (m = ino ∧ ino ∈ dirs ⊃ dirs[ino].meta:= inode.meta;dirs[m]).size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ) .ino, 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, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ dcache-cons(dcache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ pcache-cons(pcache, dirs[ino, dirs[ino].meta:= inode.meta], files) ∧ synced(dirs[ino, dirs[ino].meta:= inode.meta], icache, pcache) ∧ (asynced2 → synced(files, icache, pcache))), entries0[str0] = ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

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

Rule argument

Additional information

Used simplifier rules: ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)