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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkdir(m, md, m0, m1, entries).meta = md; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)%⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].directory; (ss)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkfile(m, md, m0, content).meta:= md0 = mkfile(m, md0, m0, content); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ files[ino, af][ino, af0] = files[ino, af0]; (s)% ⊦ mkfile(m, md, m0, content).size:= m1 = mkfile(m1, md, m0, content); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (s)%⊦ ino ∈ abs-files(fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)