[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 8 from proof SII-loops (previous step)

〈abort〉 〈tn1 := tn0 ; if tn1 = none then { RED1(S _ (S _ K _ K) _ (S _ K _ K); tn1): m0 ; if tn1 ≠ none then tn1 := some(tn1 .t _ (S _ (S _ K _ K) _ (S _ K _ K))) else { RED1(S _ (S _ K _ K) _ (S _ K _ K); tn1): m0 ; if tn1 ≠ none then tn1 := some(S _ (S _ K _ K) _ (S _ K _ K) _ tn1 .t) } }〉 〈if tn1 ≠ none then RED(tn1 .t; t3): m0 + 1 else t3 := S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K))〉 t3 = t, ∀ kappa0, t. kappa0 < (m0 + 1) + 1 → (〈RED(S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)); t3): kappa0 〉 t3 = t → false), m0 = 0 ⊦

Heuristic symbolic execution applied rule abort left

And closed the goal!

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ()]]