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

〈if m1 - 1 = 0 then abort else if ap(t1) ∧ ap(t1 .1) ∧ t1 .1 .1 = K ∧ value(t1 .1 .2) ∧ value(t1 .2) then tn4 := some(t1 .1 .2) else if ap(t1) ∧ ap(t1 .1) ∧ ap(t1 .1 .1) ∧ t1 .1 .1 .1 = S then let v1 = t1 .1 .1 .2, v2 = t1 .1 .2, v3 = t1 .2 in if value(v1) ∧ value(v2) ∧ value(v3) then tn4 := some(v1 _ v3 _ (v2 _ v3)) else tn4 := none else tn4 := none〉 〈skip〉 〈tn0 := tn4 ; if tn0 ≠ none then tn0 := some(tn0 .t _ K) else { RED1(K; tn0): m1 ; if tn0 ≠ none then tn0 := some(S _ tn0 .t) }〉 〈tn3 := tn0 ; m2 := m1 + 1 ; if tn3 ≠ none then tn3 := some(tn3 .t _ K) else { RED1(K; tn3): m2 ; if tn3 ≠ none then tn3 := some(S _ K _ tn3 .t) }〉 〈tn2 := tn3 ; if tn2 ≠ none then tn2 := some(S _ tn2 .t)〉 〈tn1 := tn2 ; m0 := 2 + m2 ; if tn1 ≠ none then tn1 := some(tn1 .t _ (S _ K _ K)) else { RED1(S _ K _ K; tn1): m0 ; if tn1 ≠ none then tn1 := some(S _ (S _ K _ K) _ tn1 .t) }〉 〈tn2 := tn1 ; m := m0 + 1 ; if tn2 ≠ none then tn2 := some(tn2 .t _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)))) else { RED1(S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)); tn2): m ; if tn2 ≠ none then tn2 := some(S _ (S _ K _ K) _ (S _ K _ K) _ tn2 .t) }〉 〈if tn2 ≠ none then RED(tn2 .t; t2): 1 + m else t2 := S _ (S _ K _ K) _ (S _ K _ K) _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K)))〉 t2 = t, ∀ kappa0, t. kappa0 < ((((((((m1 + 1) + 1) + 1) + 1) + 1) + 1) + 1) + 1) + 1 → (〈RED(S _ (S _ K _ K) _ (S _ K _ K) _ (S _ (S _ K _ K) _ (S _ K _ K)); t2): kappa0 〉 t2 = t → false), m1 ≠ 0, tn4 = tn3 ∧ t1 = S ⊦

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

[emptyarg]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ ¬ ap(S)])]]