[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 295 from proof refine-rename-new-keep-parent (previous step)

fs0[ri0[inodekey(m)]].nsubdirs = 0, fs0[ri0[inodekey(m3)]] = inodenode(key0, md1, true, m4, m5, m0 + 1), fs0[ri0[dentrykey(m3, str)]] = dentrynode(key1, m), inodekey(ino) = inodekey(m3), fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0)[m3, mkdir(m0 + 1, md0, m4, m5, (abs-children(m3, fs0, ri0) -- str)[str0, m])], 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(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)], (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3]), log-cons(log0, fs0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)], (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3], orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)], (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3], orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ri-inj(fi), ri-inj(ri0), ri-inj((ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3]), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)], (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3], orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), inodekey(ino) ∈ ri0, ri0[dentrykey(m3, str)] ∈ fs0, ri0[inodekey(m3)] ∈ fs0, inodekey(m3) ∈ ri0, dentrykey(m3, str) ∈ ri0, inodekey(m) ∈ ri0, boolvar3 → boolvar4, links(m3, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m3 = ROOT_INO, m4 ≠ 0 ∨ m3 = ROOT_INO ⊦ adr1 = adr3, adr1 = adr2, adr2 = adr3, m3 = 0, fs0[ri0[inodekey(m)]].directory, adr3 ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2], dentrykey(m3, str0) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m3, str), m4 = 0 ∧ m3 ≠ ROOT_INO, ( fs0[ri0[inodekey(ino)]].directory ↔ inodekey(ino) ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3] ∧ (adr3 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1) ;(adr2 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str), 0);fs0[(m3 = ino ⊃ adr3;ri0[inodekey(ino)])]) ) ) .directory) ∧ ( fs0[ri0[inodekey(ino)]].directory → (ino = m3 ⊃ mkdir(m0 + 1, md0, m4, m5, (abs-children(m3, fs0, ri0) -- str)[str0, m]) ;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 ((adr3 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1) ;(adr2 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str), 0);fs0[(m3 = ino ⊃ adr3;ri0[inodekey(ino)])]) ) ) .size, (adr3 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1) ;(adr2 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str), 0);fs0[(m3 = ino ⊃ adr3;ri0[inodekey(ino)])]) ) ) .meta, (adr3 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1) ;(adr2 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str), 0);fs0[(m3 = ino ⊃ adr3;ri0[inodekey(ino)])]) ) ) .nlink, (adr3 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1) ;(adr2 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = (m3 = ino ⊃ adr3;ri0[inodekey(ino)]) ⊃ dentrynode(dentrykey(m3, str), 0);fs0[(m3 = ino ⊃ adr3;ri0[inodekey(ino)])]) ) ) .nsubdirs, abs-children (ino, fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)] [adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1) ], (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3])))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 296:
fs0[ri0[inodekey(m)]].nsubdirs = 0, fs0[ri0[dentrykey(m3, str)]] = dentrynode(key1, m), fs0[ri0[inodekey(m3)]] = inodenode(key0, md1, true, m4, m5, m0 + 1), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), afs-cons(abs-dirs(fs0, ri0)[m3, mkdir(m0 + 1, md0, m4, m5, (abs-children(m3, fs0, ri0) -- str)[str0, m])], abs-files(fs0, ri0)), file-node-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)], (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3]), file-node-cons(fs0, ri0), log-cons (log0, fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)]), log-cons(log0, fs0), orphans-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)], (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3], orphans(fs0, ri0)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)], (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3], orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj((ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3]), ri-inj(ri0), ri-inj(fi), ubifs-cons (fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), m)][adr3, inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1)], (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3], orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m) ∈ ri0, dentrykey(m3, str) ∈ ri0, ri0[inodekey(m3)] ∈ fs0, ri0[dentrykey(m3, str)] ∈ fs0, inodekey(m3) ∈ ri0, boolvar3 → boolvar4, m4 ≠ 0 ∨ m3 = ROOT_INO, links(m3, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m3 = ROOT_INO ⊦ adr1 = adr2, adr1 = adr3, adr2 = adr3, m3 = 0, fs0[ri0[inodekey(m)]].directory, adr2 ∈ ri0 -- dentrykey(m3, str), adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, dentrykey(m3, str0) ∈ ri0, adr3 ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2], ( str0 = str1 ∨ str1 ≠ str ∧ dentrykey(m3, str1) ∈ ri0 ↔ dentrykey(m3, str1) ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3]) ∧ ( str0 = str1 ∨ str1 ≠ str ∧ dentrykey(m3, str1) ∈ ri0 → (abs-children(m3, fs0, ri0) -- str)[str0, m][str1] = (adr3 = (dentrykey(m3, str0) = dentrykey(m3, str1) ⊃ adr2;ri0[dentrykey(m3, str1)]) ⊃ inodenode(inodekey(m3), md0, true, m4, m5, m0 + 1) ;(adr2 = (dentrykey(m3, str0) = dentrykey(m3, str1) ⊃ adr2;ri0[dentrykey(m3, str1)]) ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = (dentrykey(m3, str0) = dentrykey(m3, str1) ⊃ adr2;ri0[dentrykey(m3, str1)]) ⊃ dentrynode(dentrykey(m3, str), 0) ;fs0[(dentrykey(m3, str0) = dentrykey(m3, str1) ⊃ adr2;ri0[dentrykey(m3, str1)])] ) ) ) .ino), m4 = 0 ∧ m3 ≠ ROOT_INO

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;% ⊦ 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)% ⊦ 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)%⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss)% ⊦ key ∈ ri[key, adr]; (s)% ⊦ 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)% ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)