[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 149 from proof replayone-prog (
previous step
)
err = err0, ri0 = ri, node-cons(fs[adr].key, fs[adr]), adr ∈ fs, ⌊err0⌋ ⊦ ⟪skip⟫ ((err = ESUCCESS ∨ ⌊err⌋ ) ∧ (err = ESUCCESS → ri = replay-one(adr, fs[adr], ri0))), adr ∈ ri
Heuristic symbolic execution applied rule skip right
And closed the goal!
Rule argument
Additional information
Used simplifier rules: ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)