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

boolvar ↔ true, fi = fi0, fo = fo0, fs = fs0, log = log0, ro0 = ∅, fo0.inodes?, orphans(fs0, ri1).inodes?, afs-cons(abs-dirs(fs0, ri1), abs-files(fs0, ri1)), file-node-cons(fs0, ri1), log-cons(log0, fs0), orphans-cons(fs0, ri1, orphans(fs0, ri1)), replay-cons-strong(fs0, ri1, orphans(fs0, ri1), fi0, fo0, log0), replay-safe(log0, fs0, fi0 ⊖ fo0), ri-inj(fi0), ri-inj(ri1), ubifs-cons(fs0, ri1, orphans(fs0, ri1), fi0, fo0, log0), err0 = ESUCCESS → fi1 = replay-log(log0, fs0, fi0 ⊖ fo0), err0 = ESUCCESS ∨ ⌊err0⌋ ⊦ [if err0 = ESUCCESS then aubifs_core_journal_sync#(fi1, fi, ro0, fo, fs, log; ; boolvar, err0)] ( ( err0 = ESUCCESS → boolvar ∧ ubifs-cons(fs, fi1, ro0, fi, fo, log) ∧ replay-cons-strong(fs, fi1, ro0, fi, fo, log) ∧ file-node-cons(fs, fi1) ∧ orphans-cons(fs, fi1, ro0) ∧ ri-inj(fi1) ∧ ri-inj(fi) ∧ log-cons(log, fs) ∧ ro0.inodes? ∧ fo.inodes?) → (err0 = ESUCCESS ∨ ⌊err0⌋ ) ∧ (err0 = ESUCCESS → fi1 = replay-log(log0, fs0, fi0 ⊖ fo0) ∧ fs = fs0 ∧ fi = fi0 ∧ fo = fo0 ∧ log = log0 ∧ boolvar) → ( err0 = ESUCCESS → ⟨dirs := abs-dirs(fs0, ri1) \ abs-keys(orphans(fs0, ri1)), files := abs-files(fs0, ri1) \ abs-keys(orphans(fs0, ri1)); afs_recovery#(boolvar2; dirs, files; asynced, err1)⟩ ( dirs = abs-dirs(fs, fi1) ∧ files = abs-files(fs, fi1) ∧ orphans(abs-dirs(fs, fi1), abs-files(fs, fi1)) = abs-keys(ro0) ∧ (asynced → boolvar) ∧ ESUCCESS = err1)) ∧ ( err0 ≠ ESUCCESS → (∀ dirs, files, boolvar. ⟨afs_recovery#(boolvar2; dirs1, files1; asynced0, err1)⟩ (dirs = dirs1 ∧ files = files1 ∧ (boolvar ↔ asynced0) ∧ err0 = err1))))

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information