[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 194 from proof refine-mkdir (previous step)

fs1[ri1[inodekey(m0)]] = inodenode(key0, md1, true, m1, m2, m6), (abs-dirs(fs1, ri1)[m0, mkdir(m6 + 1, md1, m1, m2 + 1, abs-children(m0, fs1, ri1)[str, n])] ++ n)[m0] = mkdir(m, md0, m3, m4, entries), orphans(fs1, ri1).inodes?, fo.inodes?, afs-cons(abs-dirs(fs1, ri1), abs-files(fs1, ri1)), afs-cons ((abs-dirs(fs1, ri1)[m0, mkdir(m6 + 1, md1, m1, m2 + 1, abs-children(m0, fs1, ri1)[str, n])] ++ n)[n, mkdir(0, md, 1, 0, ∅)] [m0, mkdir(m, md2, m3, m4, entries) ], abs-files(fs1, ri1)), file-node-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]), file-node-cons(fs1, ri1), log-cons (log0, fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ]), log-cons(log0, fs1), orphans-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1)), orphans-cons(fs1, ri1, orphans(fs1, ri1)), replay-cons-strong (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), replay-cons-strong(fs1, ri1, orphans(fs1, ri1), fi, fo, log0), ri-inj(ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]), ri-inj(ri1), ri-inj(fi), ubifs-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ubifs-cons(fs1, ri1, orphans(fs1, ri1), fi, fo, log0), inodekey(m0) ∈ ri1, ri1[inodekey(m0)] ∈ fs1, inodekey(ino) ∈ ri1, datakey(ino, n0) ∈ ri1, asynced0 → boolvar0, links(m0, abs-dirs(fs1, ri1)) ≠ ∅ ∨ m0 = ROOT_INO, m1 ≠ 0 ∨ m0 = ROOT_INO ⊦ fs1[ri1[datakey(ino, n0)]].data = (adr2 = ri1[datakey(ino, n0)] ⊃ dentrynode(dentrykey(m0, str), n) ;(adr1 = ri1[datakey(ino, n0)] ⊃ inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1);fs1[ri1[datakey(ino, n0)]]) ) .data, adr1 = ri1[inodekey(ino)], adr1 = adr2, adr1 = adr3, adr2 = ri1[inodekey(ino)], adr2 = adr3, adr3 = ri1[datakey(ino, n0)], adr3 = ri1[inodekey(ino)], m0 = ino, m0 = 0, n = 0, fs1[ri1[inodekey(ino)]].directory, adr3 ∈ fs1, adr2 ∈ fs1, adr1 ∈ fs1, inodekey(n) ∈ ri1, inodekey(n) ∈ fo, dentrykey(m0, str) ∈ ri1, m1 = 0 ∧ m0 ≠ ROOT_INO

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 195:
(abs-dirs(fs1, ri1)[m0, mkdir(m6 + 1, md1, m1, m2 + 1, abs-children(m0, fs1, ri1)[str, n])] ++ n)[m0] = mkdir(m, md0, m3, m4, entries), fs1[ri1[inodekey(m0)]] = inodenode(key0, md1, true, m1, m2, m6), fo.inodes?, orphans(fs1, ri1).inodes?, afs-cons ((abs-dirs(fs1, ri1)[m0, mkdir(m6 + 1, md1, m1, m2 + 1, abs-children(m0, fs1, ri1)[str, n])] ++ n)[n, mkdir(0, md, 1, 0, ∅)] [m0, mkdir(m, md2, m3, m4, entries) ], abs-files(fs1, ri1)), afs-cons(abs-dirs(fs1, ri1), abs-files(fs1, ri1)), file-node-cons(fs1, ri1), file-node-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]), log-cons(log0, fs1), log-cons (log0, fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ]), orphans-cons(fs1, ri1, orphans(fs1, ri1)), orphans-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1)), replay-cons-strong(fs1, ri1, orphans(fs1, ri1), fi, fo, log0), replay-cons-strong (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ri-inj(fi), ri-inj(ri1), ri-inj(ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]), ubifs-cons(fs1, ri1, orphans(fs1, ri1), fi, fo, log0), ubifs-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), datakey(ino, n0) ∈ ri1, inodekey(ino) ∈ ri1, ri1[inodekey(m0)] ∈ fs1, inodekey(m0) ∈ ri1, asynced0 → boolvar0, m1 ≠ 0 ∨ m0 = ROOT_INO, links(m0, abs-dirs(fs1, ri1)) ≠ ∅ ∨ m0 = ROOT_INO ⊦ fs1[ri1[datakey(ino, n0)]].data = (adr2 = ri1[datakey(ino, n0)] ⊃ dentrynode(dentrykey(m0, str), n) ;(adr1 = ri1[datakey(ino, n0)] ⊃ inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1);fs1[ri1[datakey(ino, n0)]]) ) .data, adr1 = adr3, adr1 = adr2, adr1 = ri1[inodekey(ino)], adr2 = adr3, adr2 = ri1[inodekey(ino)], adr2 = ri1[datakey(ino, n0)], adr3 = ri1[inodekey(ino)], adr3 = ri1[datakey(ino, n0)], m0 = 0, m0 = ino, n = 0, fs1[ri1[inodekey(ino)]].directory, dentrykey(m0, str) ∈ ri1, inodekey(n) ∈ fo, inodekey(n) ∈ ri1, adr1 ∈ fs1, adr2 ∈ fs1, adr3 ∈ fs1, m1 = 0 ∧ m0 ≠ ROOT_INO

Rule argument

fma: adr2 = ri1[datakey(ino, n0)]

Additional information

Used simplifier rules: ⊦ ¬ adr ∈ fs → fs[adr] = (∅)[adr]; (s)% ⊦ key ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → ri[key] ∈ fs; (ss) Used formulas: adr2 = ri1[datakey(ino, n0)]