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

〈if some(tn1 .t _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)))) ≠ none then RED(some(tn1 .t _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)))) .t; t3): 2 + m else t3 := K _ (S _ (S _ K _ K) _ (S _ K _ K)) _ (K _ (S _ (S _ K _ K) _ (S _ K _ K))) _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)))〉 t3 = t, ∀ kappa0, t. kappa0 < ((((m + 1) + 1) + 1) + 1) + 1 → (〈RED(S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)); t3): kappa0 〉 t3 = t → false), m ≠ 0, tn = some(S _ (S _ K _ K) _ (S _ K _ K)), tn1 = tn ⊦

Heuristic symbolic execution applied rule if positive left

And obtained the following new goals

Proof step 563:
〈RED(some(tn1 .t _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)))) .t; t3): 2 + m 〉 t3 = t, ∀ kappa0, t. kappa0 < ((((m + 1) + 1) + 1) + 1) + 1 → (〈RED(S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)); t3): kappa0 〉 t3 = t → false), m ≠ 0, tn = some(S _ (S _ K _ K) _ (S _ K _ K)), tn1 = tn ⊦

Rule argument

[fmapos-arg: pos: left 1]

Additional information

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