 The combinatory terms \(\textsf{WWW}\) and \(\textsf{WI}(\textsf{WI})\) are, perhaps, the simplest examples of terms that do not have a normal form. Both terms induce an infinite reduction sequence, that is, an infinite chain of successive one-step reductions. To make the example more transparent, let us assume for a moment that \(\textsf{W}\), \(\textsf{I}\), \(\textsf{C}\), etc. are not defined from \(\textsf{K}\) and \(\textsf{S}\), but are primitive constants. The contraction of the only redex in \(\textsf{WWW}\) returns the same term, which shows that uniqueness does not imply that the term is in nf. The contraction of the only redex in \(\textsf{WI}(\textsf{WI})\) gives \(\textsf{I}(\textsf{WI})(\textsf{WI})\) that further reduces to the term we started with. A slightly more complicated example of a term that has only infinite reduction sequences is \(\textsf{Y}(\textsf{CKI})\).  This term has a  reduction sequence (in which each contracted redex is headed by  \(\textsf{Y}\)) that contains infinitely many distinct terms. It is also possible to create infinite reduction sequences that start with \(\textsf{Y} (\textsf{CKI})\) and have various loops too. To sum up, the Church–Rosser theorem, in general, does not guarantee the uniqueness of the term \(Q\). However, if \(M\) has a normal form then that is unique.