[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 65 from proof recovery (previous step)

tree0.dir?, dom of1 < ino, abs(tree0, ROOT_INO)(dirs0), afs-cons(dirs0, files1), fids-cons(tree0, abs-files(files1), abs-of(of1)), of-cons(of1, dirs0, files1), posix-crash(tree0, abs-files(files1), abs-of(of1), tree, fs2, ofh2), ⌊err1⌋ ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; if err ≠ ESUCCESS then root := ?, fs := ?, ofh := ?, psynced := ? else psynced := true⟩ (tree1 = root ∧ fs0 = fs ∧ ofh0 = ofh ∧ (isdir ↔ psynced) ∧ err1 = err)

Heuristic use patterns applied rule exists right

And obtained the following new goals

Proof step 66:
tree0.dir?, dom of1 < ino, abs(tree0, ROOT_INO)(dirs0), afs-cons(dirs0, files1), fids-cons(tree0, abs-files(files1), abs-of(of1)), of-cons(of1, dirs0, files1), posix-crash(tree0, abs-files(files1), abs-of(of1), tree, fs2, ofh2), ⌊err1⌋ ⊦ (⌊err1⌋ ∨ err1 = ESUCCESS) ∧ ⟨err := err1; if err ≠ ESUCCESS then root := ?, fs := ?, ofh := ?, psynced := ? else psynced := true⟩ (tree1 = root ∧ fs0 = fs ∧ ofh0 = ofh ∧ (isdir ↔ psynced) ∧ err1 = err)

Rule argument

pos: right 1 terms: err1 abort: T discard: T computed: F

Additional information

Used terms: err1