[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 66 from proof inv-write-inode (previous step)

fs0[ri[inodekey(m)]].nlink = 0, fs0[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri), log-cons(log0, fs0), orphans-cons(fs0, ri, ro), replay-cons-strong(fs0, ri, ro, fi, fo, log0), ri-cons(ri, fs0), ri-inj(fi), ri-inj(ri), ubifs-cons(fs0, ri, ro, fi, fo, log0), inodekey(m) ∈ ro, ri[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri, ¬ fs0[ri[inodekey(m)]].directory ∧ ¬ boolvar0 ∨ fs0[ri[inodekey(m)]].directory ∧ boolvar0 ∧ m2 = fs0[ri[inodekey(m)]].size ⊦ # ro = 0, (boolvar0 ⊃ (ri ⊖ ro) -- inodekey(m);ri ⊖ ro) = ri ⊖ ro, m = 0, m = ROOT_INO, ro = ∅, adr1 ∈ fs0

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 67:
fs0[ri[inodekey(m)]].nlink = 0, fs0[ri[inodekey(m)]].directory, fs0[ri[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri), log-cons(log0, fs0), orphans-cons(fs0, ri, ro), replay-cons-strong(fs0, ri, ro, fi, fo, log0), ri-cons(ri, fs0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs0, ri, ro, fi, fo, log0), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs0, inodekey(m) ∈ ro, ¬ fs0[ri[inodekey(m)]].directory ∧ ¬ boolvar0 ∨ fs0[ri[inodekey(m)]].directory ∧ boolvar0 ∧ m2 = fs0[ri[inodekey(m)]].size ⊦ # ro = 0, (boolvar0 ⊃ (ri ⊖ ro) -- inodekey(m);ri ⊖ ro) = ri ⊖ ro, m = ROOT_INO, m = 0, ro = ∅, adr1 ∈ fs0

Rule argument

fma: fs0[ri[inodekey(m)]].directory

Additional information

Used formulas: fs0[ri[inodekey(m)]].directory