[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 86 from proof replayone-prog (previous step)

nd.ino = 0, boolvar ↔ boolvar0, err = ESUCCESS, nd = fs[adr], ri0 = ri, nd.dentry?, node-cons(fs[adr].key, fs[adr]), adr ∈ fs ⊦ ⟪aubifs_core_index_remove#(nd.key, fi, ro, fo, fs, log, boolvar0; ri); if nd.data? then {let key = inodekey(nd.key.ino) in aubifs_core_index_contains#(key, ri, fi, ro, fo, fs, log, boolvar0; boolvar; err); if err = ESUCCESS ∧ boolvar then aubifs_core_index_store#(nd.key, adr, fi, ro, fo, fs, log, boolvar0; ri)}; if nd.trunc? then aubifs_core_index_truncate#(nd.key, nd.size, fi, ro, fo, fs, log, boolvar0; ri)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ri = replay-one(adr, fs[adr], ri0))), nd.inode?, adr ∈ ri

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 87:
fs[adr].ino = 0, ri0 = ri, fs[adr].dentry?, node-cons(fs[adr].key, fs[adr]), adr ∈ fs, ¬ fs[adr].inode?, ¬ adr ∈ ri ⊦ ⟪aubifs_core_index_remove#(fs[adr].key, fi, ro, fo, fs, log, boolvar0; ri); nd := fs[adr]; err := ESUCCESS; boolvar := boolvar0; if nd.data? then {let key = inodekey(nd.key.ino) in aubifs_core_index_contains#(key, ri, fi, ro, fo, fs, log, boolvar0; boolvar; err); if err = ESUCCESS ∧ boolvar then aubifs_core_index_store#(nd.key, adr, fi, ro, fo, fs, log, boolvar0; ri)}; if nd.trunc? then aubifs_core_index_truncate#(nd.key, nd.size, fi, ro, fo, fs, log, boolvar0; ri)⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ri = replay-one(adr, fs[adr], ri0)))

Proof step 86 from proof replayone-prog (previous step)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information