[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 339 from proof refine-rename-new-reparent (previous step)

fs0[ri0[inodekey(m)]].nsubdirs = 0, fs0[ri0[inodekey(m3)]] = inodenode(key0, md2, true, m4, n0, m11 + 1), fs0[ri0[inodekey(m7)]] = inodenode(key1, md3, true, m5, m6, m8), fs0[ri0[dentrykey(m3, str)]] = dentrynode(key2, m), dirs = dirs0[ino, dirs0[ino].meta:= inode.meta], dirs0 = abs-dirs(fs0, ri0)[m7, mkdir(m8 + 1, md3, m5, m6, abs-children(m7, fs0, ri0)[str0, m])] [m3, mkdir(m11, md0, m4, n0, abs-children(m3, fs0, ri0) -- str) ], files = abs-files(fs0, ri0), ino = inode.ino, inode = mkinode(m7, md1, true, m5, m6, m8), new_child_inode = new_dent_inode, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6, m8 + 1) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4], orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj((ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]), ri-inj(fi), ri-inj(ri0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11)] [adr4, inodenode(inodekey(m7), md1, true, m5, m6, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ino ∈ dirs0, inodekey(m7) ∈ ri0, dentrykey(m3, str) ∈ ri0, inodekey(m) ∈ ri0, inodekey(m3) ∈ ri0, ri0[inodekey(m7)] ∈ fs0, ri0[inodekey(m3)] ∈ fs0, ri0[dentrykey(m3, str)] ∈ fs0, boolvar3 → boolvar4, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO, links(m3, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m3 = ROOT_INO, m5 ≠ 0 ∨ m7 = ROOT_INO, m4 ≠ 0 ∨ m3 = ROOT_INO ⊦ adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m3 = 0, m3 = m7, m7 = 0, fs0[ri0[inodekey(m)]].directory, ino ∈ files, adr3 ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2], dentrykey(m7, str0) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m3, str), adr4 ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3], ∃ asynced. afs-cons(dirs, files) → dirs = abs-dirs (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)] [adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11) ] [adr4, inodenode(inodekey(m7), md1, true, m5, m6, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]) ∧ files = abs-files (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)] [adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11) ] [adr4, inodenode(inodekey(m7), md1, true, m5, m6, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]) ∧ orphans (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)] [adr3, inodenode(inodekey(m3), md0, true, m4, n0, m11) ] [adr4, inodenode(inodekey(m7), md1, true, m5, m6, m8 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m7, str0), adr2][inodekey(m3), adr3][inodekey(m7), adr4]) = orphans(fs0, ri0) ∧ (asynced → boolvar2) ∧ mkinode(m3, md0, true, m4, n0, m11) = (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode(m3, files[m3].meta, false, files[m3].nlink, 0, files[m3].size) ) ∧ mkinode(m7, md1, true, m5, m6, m8 + 1) = (m7 ∈ dirs ⊃ mkinode(m7, dirs[m7].meta, true, dirs[m7].nlink, dirs[m7].nsubdirs, dirs[m7].size) ;mkinode(m7, files[m7].meta, false, files[m7].nlink, 0, files[m7].size) ) ∧ new_dent_inode = new_child_inode ∧ ESUCCESS = ESUCCESS, m4 = 0 ∧ m3 ≠ ROOT_INO, m5 = 0 ∧ m7 ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkdir(m, md, m0, m1, entries).meta = md; (s)%⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss)% ⊦ dirs[ino, ad][ino0, ad0][ino, ad1] = dirs[ino0, ad0][ino, ad1]; (s)%⊦ 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)%⊦ ino ∈ abs-files(fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)