[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 313 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), 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, adr2 = ri0[inodekey(ino)], adr3 = ri0[inodekey(ino)], ino = m3, 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), ( fs0[ri0[inodekey(ino)]].directory ↔ inodekey(ino) ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3] ∧ (adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str), 0);fs0[ri0[inodekey(ino)]]) ) .directory) ∧ ( fs0[ri0[inodekey(ino)]].directory → 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 ((adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str), 0);fs0[ri0[inodekey(ino)]]) ) .size, (adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str), 0);fs0[ri0[inodekey(ino)]]) ) .meta, (adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str), 0);fs0[ri0[inodekey(ino)]]) ) .nlink, (adr2 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str0), m) ;(adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str), 0);fs0[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]))), m4 = 0 ∧ m3 ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 314:
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, inodekey(m3) ∈ ri0, ri0[inodekey(m3)] ∈ fs0, ri0[dentrykey(m3, str)] ∈ fs0, inodekey(ino) ∈ ri0, boolvar3 → boolvar4, m4 ≠ 0 ∨ m3 = ROOT_INO, links(m3, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m3 = ROOT_INO ⊦ adr1 = adr2, adr1 = adr3, adr2 = ri0[inodekey(ino)], adr2 = adr3, adr3 = ri0[inodekey(ino)], ino = m3, 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], m4 = 0 ∧ m3 ≠ ROOT_INO, ( fs0[ri0[inodekey(ino)]].directory ↔ inodekey(ino) ∈ (ri0 -- dentrykey(m3, str))[dentrykey(m3, str0), adr2][inodekey(m3), adr3] ∧ (adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str), 0);fs0[ri0[inodekey(ino)]]).directory) ∧ ( fs0[ri0[inodekey(ino)]].directory → 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(m3, str), 0);fs0[ri0[inodekey(ino)]]).size, (adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str), 0);fs0[ri0[inodekey(ino)]]).meta, (adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str), 0);fs0[ri0[inodekey(ino)]]).nlink, (adr1 = ri0[inodekey(ino)] ⊃ dentrynode(dentrykey(m3, str), 0);fs0[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])))

Proof step 313 from proof refine-rename-new-keep-parent (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information