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

〈if value(v4) ∧ value(v0) ∧ value(v) then tn0 := some(v4 _ v _ (v0 _ v)) else tn0 := none〉 〈tn1 := tn0 ; if tn1 = none then { RED1(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 _ K _ K _ tn1 .t) } }〉 〈tn0 := tn1 ; if tn0 ≠ none then tn0 := some(tn0 .t _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K))))〉 〈if tn0 ≠ none then RED(tn0 .t; t1): 2 + m0 else t1 := S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)) _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)))〉 t1 = t, ∀ kappa0, t. kappa0 < (((m0 + 1) + 1) + 1) + 1 → (〈RED(S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)); t3): kappa0 〉 t3 = t → false), m0 ≠ 0, v = S _ (S _ K _ K) _ (S _ K _ K), v0 = K, v4 = K ⊦

Heuristic symbolic execution applied rule if positive left

And obtained the following new goals

Rule argument

[fmapos-arg: pos: left 1]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ value(K)], [CSIMPSEQ : ⊦ value (S _ (S _ K _ K) _ (S _ K _ K))])]]