[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 300 from proof refine-rename-overwrite-keep-parent-identity (previous step)

(m = m6 ⊃ mkdir(m9, md1, m7, m8, abs-children(m6, fs0, ri0)[str, m6]) ;mkdir(fs0[ri0[inodekey(m)]].size, fs0[ri0[inodekey(m)]].meta, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, ∅) ) = mkdir(m3, md3, m4, m5, entries0), fs0[ri0[dentrykey(m6, str)]] = dentrynode(key1, m), fs0[ri0[inodekey(m6)]] = inodenode(key0, md2, true, m7, m8, m9), abs-children(m, fs0, ri0) = ∅, dentrykeys(inodekey(m), ri0) = ∅, m6 = m, mkdir(m9, md, m7, m8, (∅)[str, m]) = mkdir(m0, md0, m1, m2, entries), fs0[ri0[inodekey(m)]].directory, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0)[m6, mkdir(m9, md1, m7, m8, abs-children(m6, fs0, ri0)[str, m])][m, mkdir(m3, md, m4, m5, entries0)], abs-files(fs0, ri0)), afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4]), log-cons(log0, fs0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4], orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ri-inj(ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), dentrykey(m6, str) ∈ ri0, inodekey(m) ∈ ri0, inodekey(m6) ∈ ri0, ri0[dentrykey(m6, str)] ∈ fs0, ri0[inodekey(m6)] ∈ fs0, 1 ≤ m9, 1 ≤ m8, boolvar4 → boolvar1, fs0[ri0[inodekey(m)]].nlink = 1 → links(m, fs0, ri0) = ∅ ++ dentrykey(m6, str), links(m6, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m6 = ROOT_INO, m7 ≠ 0 ∨ m6 = ROOT_INO ⊦ fs0[ri0[inodekey(m)]].nlink = 0, adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m = 0, m = ROOT_INO, m6 = 0, m8 = 0, m9 = 0, mkdir(m3, md, m4, m5, entries0) = mkdir (fs0[ri0[inodekey(m)]].size, md, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, abs-children (m, fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, fs0[ri0[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4])), adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m6, str), m7 = 0 ∧ m6 ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: mkdir-inj: ⊦ mkdir(n, md, m, n0, entries0) = mkdir(n, md, m, n0, entries1) ↔ entries0 = entries1;%in-insert: ⊦ str ∈ entries[str0, n] ↔ str0 = str ∨ str ∈ entries;%at-ri: ⊦ ri[key, adr][key0] = (key = key0 ⊃ adr;ri[key0]);%size-zero: ⊦ # ls ≠ 0 → ls ≠ ∅; (forward) from specification set-basic[alink-set]%not-zero: 0 < n ⊦ (* n) ≤ m → m ≠ 0; (forward) from specification nat% ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)% ⊦ dentrynode(key, m).ino = m; (s)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)% ⊦ adr ≠ adr0 → fs[adr0, nd][adr] = fs[adr]; (s)% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ entries[str, ino][str] = ino; (s)% ⊦ ¬ str ∈ ∅; (s)%⊦ entries = abs-children(ino, fs, ri) ↔ (∀ str. (str ∈ entries ↔ dentrykey(ino, str) ∈ ri) ∧ ( str ∈ entries → entries[str] = fs[ri[dentrykey(ino, str)]].ino)); (ss)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nsubdirs = m0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).size = m1; (s)%size-zero-01: ⊦ ls ≠ ∅ → # ls ≠ 0; (forward) from specification set-basic[alink-set]%ubifs-parent-in: ⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → inodekey(ino) ∈ ri; (forward) from specification aubifs-inv% ⊦ dirs[ino, ad][ino, ad0] = dirs[ino, ad0]; (s)% ⊦ ri[key, adr][key, adr0] = ri[key, adr0]; (s)%⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)