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

〈TOPRED(t2; tn1): m -1 〉〈if tn1 = none ∧ ap(t2) then { RED1(t2 .1; tn1): m -1 ; if tn1 ≠ none then tn1 := some(tn1 .t _ t2 .2) else if value(t2 .1) then { RED1(t2 .2; tn1): m -1 ; if tn1 ≠ none then tn1 := some(t2 .1 _ tn1 .t) } }〉〈tn := tn1 ; if tn ≠ none then tn := some(tn .t _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K))))〉〈if tn ≠ none then RED(tn .t; t1): m + 1 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 < ((m + 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, tn1 = tn ∧ t2 = S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)) ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 616:
〈TOPRED(S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)); tn1): m - 1 〉〈if tn1 = none then { RED1(S _ K _ K; tn1): m - 1 ; 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): m - 1 ; if tn1 ≠ none then tn1 := some(S _ K _ K _ tn1 .t) } }〉〈tn := tn1 ; if tn ≠ none then tn := some(tn .t _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K))))〉〈if tn ≠ none then RED(tn .t; t1): m + 1 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 < ((m + 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 ⊦

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ ap(t _ t0)], [CSIMPSEQ : ⊦ value(S _ K _ K)], [CSIMPSEQ : ⊦ (t _ t0) .2 = t0], [CSIMPSEQ : ⊦ (t _ t0) .1 = t], [CSIMPSEQ : ⊦ n -1 = n - 1])]]