[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 37 from proof refine-check-commit (previous step)

fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), ⌊err1⌋ , asynced → boolvar0 ⊦ ∃ err0. (⌊err0⌋ ∨ err0 = ESUCCESS) ∧ ⟨err := err0; choose bv with true in asynced := bv⟩ ((asynced → boolvar) ∧ err1 = err)

User applied rule exists right

And obtained the following new goals

Proof step 38:
orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), ⌊err1⌋ , asynced → boolvar0 ⊦ (⌊err1⌋ ∨ err1 = ESUCCESS) ∧ ⟨err := err1; choose bv with true in asynced := bv⟩ ((asynced → boolvar) ∧ err1 = err)

Rule argument

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

Additional information

Used terms: err1