[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 64 from proof inv-rename-overwrite-keep-parent (previous step)

n0 + (boolvar3 ⊃ 1;0) = fs0[ri0[inodekey(m)]].nsubdirs, m0 + 1 = fs0[ri0[inodekey(m)]].size, m8 + 1 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].nlink, ¬ fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].directory ↔ ¬ boolvar0, fs0[ri0[inodekey(m2)]] = inodenode(key1, md0, boolvar0, m5, m9, m10), fs0[ri0[dentrykey(m, str)]] = dentrynode(key0, m2), adr = adr2, fs = fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)] [adr3, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, n0, m0) ] [adr4, inodenode(inodekey(fs0[ri0[dentrykey(m, str0)]].ino), md1, boolvar2, m8, fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].nsubdirs, m6) ], key = dentrykey(m, mkdentry(str0, fs0[ri0[dentrykey(m, str0)]].ino).name), log = (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', ri = ri1[key, adr], ri1 = ri0 -- dentrykey(m, str), fs0[ri0[dentrykey(m, str0)]].dentry?, fs0[ri0[inodekey(m)]].directory, fs0[ri0[inodekey(m)]].inode?, fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri0), key-cons(key, fs[adr]), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m)] ∈ fs0, ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)] ∈ fs0, ri0[dentrykey(m, str0)] ∈ fs0, inodekey(m) ∈ ri0, ri0[inodekey(m2)] ∈ fs0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(fs0[ri0[dentrykey(m, str0)]].ino) ∈ ri0, dentrykey(m, str0) ∈ ri0, inodekey(m2) ∈ ri0, dentrykey(m, str) ∈ ri0, adr ∈ fs, fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].directory → dentrykeys(inodekey(fs0[ri0[dentrykey(m, str0)]].ino), ri0) = ∅, m8 = 0 → links(fs0[ri0[dentrykey(m, str0)]].ino, fs0, ri0) = ∅ ++ dentrykey(m, str0), ¬ adr ∈ ri1 → adr ∈ fs → adr ∈ fs, ¬ boolvar0 ∧ ¬ boolvar2 ∨ fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].directory ∧ boolvar2 ∧ m6 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].size, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, fs0[ri0[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_core_index_store# (inodekey(m), adr3, fi, ro, fo, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)] [adr3, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, n0, m0) ] [adr4, inodenode(inodekey(fs0[ri0[dentrykey(m, str0)]].ino), md1, boolvar2, m8, fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].nsubdirs, m6) ], (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', boolvar ; ri); aubifs_core_index_store# (inodekey(fs0[ri0[dentrykey(m, str0)]].ino), adr4, fi, ro, fo, fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)] [adr3, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, n0, m0) ] [adr4, inodenode(inodekey(fs0[ri0[dentrykey(m, str0)]].ino), md1, boolvar2, m8, fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].nsubdirs, m6) ], (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', boolvar ; ri); nd := inodenode(inodekey(fs0[ri0[dentrykey(m, str0)]].ino), md1, boolvar2, m8, fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].nsubdirs, m6); log := (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '; fs := fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m, str0), m2)] [adr3, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, n0, m0) ] [adr4, inodenode(inodekey(fs0[ri0[dentrykey(m, str0)]].ino), md1, boolvar2, m8, fs0[ri0[inodekey(fs0[ri0[dentrykey(m, str0)]].ino)]].nsubdirs, m6) ]; if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(fs0[ri0[dentrykey(m, str0)]].ino), ri, fi, fo, fs, log, boolvar; ro); new_dent := mkdentry(mkdentry(str0, fs0[ri0[dentrykey(m, str0)]].ino).name, mkdentry(str, m2).ino); old_dent := negdentry(str); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, n0, m0).meta, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, n0, m0).directory, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, n0, m0).nlink, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, n0, m0).nsubdirs, inodenode(inodekey(m), md, true, fs0[ri0[inodekey(m)]].nlink, n0, m0).size); new_child_inode := mkinode(fs0[ri0[dentrykey(m, str0)]].ino, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), fs0[ri0[dentrykey(m, str0)]].ino = ROOT_INO, fs0[ri0[dentrykey(m, str0)]].ino = 0, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m = 0, mkdentry(str, m2) = mkdentry(str0, fs0[ri0[dentrykey(m, str0)]].ino), adr ∈ ri1, adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: at-fs: ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]);% ⊦ dentrynode(key, m).key = key; (s)% ⊦ dentrynode(key, m).dentry?; (s)%⊦ key-cons(dentrykey(ino, str), nd) ↔ nd.dentry? ∧ nd.key = dentrykey(ino, str); (s)% ⊦ adr ≠ adr0 → fs[adr0, nd][adr] = fs[adr]; (s)% ⊦ adr ∈ fs[adr1, nd] ↔ adr = adr1 ∨ adr ∈ fs; (s)% ⊦ adr ≠ adr0 → (adr ∈ fs[adr0, nd] ↔ adr ∈ fs); (s)% ⊦ mkdentry(str, m).name = str; (s)