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

〈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 tn2 := some(v1 _ v3 _ (v2 _ v3)) else tn2 := none else tn2 := none〉 〈tn0 := tn2 ; if tn0 = none ∧ ap(S _ K _ K) then { RED1((S _ K _ K) .1; tn0): m2 ; if tn0 ≠ none then tn0 := some(tn0 .t _ (S _ K _ K) .2) else if value((S _ K _ K) .1) then { RED1((S _ K _ K) .2; tn0): m2 ; if tn0 ≠ none then tn0 := some((S _ K _ K) .1 _ tn0 .t) } }〉 〈tn2 := tn0 ; 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 < (((((((m2 + 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), m2 ≠ 0, tn2 = tn0 ∧ t1 = S _ K _ K ⊦

Heuristic symbolic execution applied rule if negative left

And obtained the following new goals

Rule argument

[fmapos-arg: pos: left 1]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ ap(t _ t0)], [CSIMPSEQ : ⊦ (t _ t0) .1 = t], [CSIMPSEQ : ⊦ ¬ ap(S)])]]