[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 13 from proof TOPRED-lem (previous step)

¬ (ap(t) ∧ ap(t .1) ∧ t .1 .1 = K ∧ value(t .1 .2) ∧ value(t .2)), ap(t) ∧ ap(t .1) ∧ ap(t .1 .1) ∧ t .1 .1 .1 = S, v = t .2, v0 = t .1 .2, v4 = t .1 .1 .2, value(v4) ∧ value(v0) ∧ value(v) ⊦ 〈tn0 := some(v4 _ v _ (v0 _ v))〉 (tn0 = none ⊃ ¬ (∃ t0. t =>top t0); t =>top tn0 .t)

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 12:
¬ (ap(t) ∧ ap(t .1) ∧ t .1 .1 = K ∧ value(t .1 .2) ∧ value(t .2)), ap(t) ∧ ap(t .1) ∧ ap(t .1 .1) ∧ t .1 .1 .1 = S, v = t .2, v0 = t .1 .2, v4 = t .1 .1 .2, value(v4) ∧ value(v0) ∧ value(v), some(v4 _ v _ (v0 _ v)) = none ⊃ (∃ t0. t =>top t0) ; ¬ t =>top some(v4 _ v _ (v0 _ v)) .t ⊦

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ()]]