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

0 = fs0[ri0[inodekey(m)]].nsubdirs, 0 = fs0[ri0[inodekey(m3)]].nsubdirs, 1 = fs0[ri0[inodekey(m3)]].nlink, fs0[ri0[dentrykey(m7, str0)]] = dentrynode(key0, m3), fs0[ri0[dentrykey(m7, str)]] = dentrynode(key2, m), fs0[ri0[inodekey(m7)]] = inodenode(key1, md2, true, m4, n0, m11 + 1), ino = m7, links(m3, fs0, ri0) = ∅ ++ dentrykey(m7, str0), fs0[ri0[inodekey(ino)]].directory, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons (abs-dirs(fs0, ri0)[m7, mkdir(m11, md1, m4, n0, (abs-children(m7, fs0, ri0) -- str)[str0, m])], abs-files(fs0, ri0)[m3, mkfile(m6, md0, 0, abs-content(m3, fs0, ri0))]), file-node-cons (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m3), md0, false, 0, 0, m6) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4]), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m3), md0, false, 0, 0, m6) ]), log-cons(log0, fs0), orphans-cons (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m3), md0, false, 0, 0, m6) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4], orphans(fs0, ri0) ++ inodekey(m3)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m3), md0, false, 0, 0, m6) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4], orphans(fs0, ri0) ++ inodekey(m3), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj((ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4]), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m3), md0, false, 0, 0, m6) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4], orphans(fs0, ri0) ++ inodekey(m3), fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(ino) ∈ ri0, ri0[dentrykey(m7, str)] ∈ fs0, ri0[inodekey(m7)] ∈ fs0, ri0[dentrykey(m7, str0)] ∈ fs0, inodekey(m7) ∈ ri0, dentrykey(m7, str0) ∈ ri0, dentrykey(m7, str) ∈ ri0, inodekey(m3) ∈ ri0, inodekey(m) ∈ ri0, boolvar3 → boolvar4, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO, m4 ≠ 0 ∨ m7 = ROOT_INO ⊦ adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m3 = 0, m3 = ROOT_INO, m7 = 0, mkdentry(str, m) = mkdentry(str0, m3), mkdir(m11, md1, m4, n0, (abs-children(m7, fs0, ri0) -- str)[str0, m]) = mkdir ((adr4 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m3), md0, false, 0, 0, m6) ;(adr3 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m7), md1, true, m4, n0, m11) ;(adr2 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m7, str), 0);fs0[(m7 = ino ⊃ adr3;ri0[inodekey(ino)])]) ) ) ) .size, (adr4 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m3), md0, false, 0, 0, m6) ;(adr3 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m7), md1, true, m4, n0, m11) ;(adr2 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m7, str), 0);fs0[(m7 = ino ⊃ adr3;ri0[inodekey(ino)])]) ) ) ) .meta, (adr4 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m3), md0, false, 0, 0, m6) ;(adr3 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m7), md1, true, m4, n0, m11) ;(adr2 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m7, str), 0);fs0[(m7 = ino ⊃ adr3;ri0[inodekey(ino)])]) ) ) ) .nlink, (adr4 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m3), md0, false, 0, 0, m6) ;(adr3 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m7), md1, true, m4, n0, m11) ;(adr2 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m7, str0), m) ;(adr1 = (m7 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m7, str), 0);fs0[(m7 = ino ⊃ adr3;ri0[inodekey(ino)])]) ) ) ) .nsubdirs, abs-children (ino, fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m3), md0, false, 0, 0, m6) ], (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3][inodekey(m3), adr4])), fs0[ri0[inodekey(m3)]].directory, fs0[ri0[inodekey(m)]].directory, adr3 ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2], adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m7, str), adr4 ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3], m4 = 0 ∧ m7 ≠ 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]);%in-ri-dentry-inode: ⊦ dentrykey(ino, str) ∈ ri[inodekey(ino), adr] ↔ dentrykey(ino, str) ∈ ri;% ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)%key ≠ key0 ⊦ (ri -- key0)[key] = ri[key]; (s)% ⊦ key ∈ ri -- key0 ↔ key ≠ key0 ∧ key ∈ ri; (s)% ⊦ key ≠ key0 → (key ∈ ri[key0, adr] ↔ key ∈ ri); (s)% ⊦ key ∈ ri[key0, adr] ↔ key = key0 ∨ key ∈ ri; (las)% ⊦ dentrykey(m, str) = dentrykey(m0, str0) ↔ m = m0 ∧ str = str0; (ws)% ⊦ inodekey(m) ≠ dentrykey(m0, str); (s)% ⊦ str ∈ abs-children(ino, fs, ri) ↔ dentrykey(ino, str) ∈ ri; (s)% ⊦ str ∈ entries -- str0 ↔ str ≠ str0 ∧ str ∈ entries; (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).meta = md; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).size = m1; (s)