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

〈if 2 + m = 0 then abort else let tn = none in { RED1(t4; tn): (2 + m) -1 ; if tn ≠ none then RED(tn .t; t2): (2 + m) -1 else t2 := t4 }〉 t2 = 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, t2 = t3 ∧ t4 = S _ (S _ K _ K) _ (S _ K _ K) _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K))) ⊦

Heuristic symbolic execution applied rule if negative left

And obtained the following new goals

Proof step 559:
〈let tn = none in { RED1(t4; tn): (2 + m) -1 ; if tn ≠ none then RED(tn .t; t2): (2 + m) -1 else t2 := t4 }〉 t2 = 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, t2 = t3 ∧ t4 = S _ (S _ K _ K) _ (S _ K _ K) _ (S _ K _ K _ (S _ (S _ K _ K) _ (S _ K _ K))) ⊦

Rule argument

[fmapos-arg: pos: left 1]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : n < n0 ⊦ ((* n)) ≠ m0 + ((* n0))], [CSIMPSEQ : ⊦ (m + n0) + n1 = m + n0 + n1], [CSIMPSEQ : ⊦ m + n = n + m])]]