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

fs0[ri0[inodekey(m)]].nsubdirs = 0, fs0[ri0[dentrykey(m6, str)]] = dentrynode(key1, m), fs0[ri0[inodekey(m6)]] = inodenode(key0, md2, true, m7, m8, m9), fs0[ri0[inodekey(ino)]].directory, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons (abs-dirs(fs0, ri0)[m6, mkdir(m9, md1, m7, m8, abs-children(m6, fs0, ri0)[str, m])], abs-files(fs0, ri0)[m, mkfile(m2, md, fs0[ri0[inodekey(m)]].nlink, abs-content(m, 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, false, fs0[ri0[inodekey(m)]].nlink, 0, m2) ], 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, false, fs0[ri0[inodekey(m)]].nlink, 0, m2) ]), 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, false, fs0[ri0[inodekey(m)]].nlink, 0, m2) ], 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, false, fs0[ri0[inodekey(m)]].nlink, 0, m2) ], 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, false, fs0[ri0[inodekey(m)]].nlink, 0, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4], orphans(fs0, ri0), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), inodekey(ino) ∈ ri0, dentrykey(m6, str) ∈ ri0, inodekey(m) ∈ ri0, inodekey(m6) ∈ ri0, ri0[dentrykey(m6, str)] ∈ fs0, ri0[inodekey(m6)] ∈ fs0, 1 ≤ m9, 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, adr1 = ri0[inodekey(ino)], adr2 = adr4, adr2 = adr3, adr2 = ri0[inodekey(ino)], adr3 = adr4, adr3 = ri0[inodekey(ino)], adr4 = ri0[inodekey(ino)], ino = m6, m = 0, m = ROOT_INO, m6 = 0, m9 = 0, mkdir (fs0[ri0[inodekey(ino)]].size, fs0[ri0[inodekey(ino)]].meta, fs0[ri0[inodekey(ino)]].nlink, fs0[ri0[inodekey(ino)]].nsubdirs, abs-children(ino, fs0, ri0)) = mkdir ((adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m6, str), 0);fs0[ri0[inodekey(ino)]]).size, (adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m6, str), 0);fs0[ri0[inodekey(ino)]]).meta, (adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m6, str), 0);fs0[ri0[inodekey(ino)]]).nlink, (adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m6, str), 0);fs0[ri0[inodekey(ino)]]).nsubdirs, abs-children (ino, 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, false, fs0[ri0[inodekey(m)]].nlink, 0, m2) ], ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3][inodekey(m), adr4])), fs0[ri0[inodekey(m)]].directory, 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;%at-ri: ⊦ ri[key, adr][key0] = (key = key0 ⊃ adr;ri[key0]);% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)%⊦ dentrykey(ino, str) ∈ ri → abs-children(ino, fs, ri)[str] = fs[ri[dentrykey(ino, str)]].ino; (s)% ⊦ str ∈ abs-children(ino, fs, ri) ↔ dentrykey(ino, str) ∈ ri; (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)