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

〈if tn = none then { RED1(S _ K _ K; tn): m0 ; if tn ≠ none then tn := some(tn .t _ (S _ (S _ K _ K) _ (S _ K _ K))) else { RED1(S _ (S _ K _ K) _ (S _ K _ K); tn): m0 ; if tn ≠ none then tn := some(S _ K _ K _ tn .t) } }〉〈tn0 := tn ; 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, tn = some(v4 _ v _ (v0 _ v)) ⊦

Heuristic symbolic execution applied rule if negative left

And obtained the following new goals

Proof step 605:
〈skip〉〈tn0 := tn ; 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, tn = some(v4 _ v _ (v0 _ v)) ⊦

Rule argument

[fmapos-arg: pos: left 1]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ some(t) ≠ none])]]