MAYBE MAYBE TRS: { cons(X1, X2) -> n__cons(X1, X2), oddNs() -> incr(pairNs()), pairNs() -> cons(0(), n__incr(oddNs())), incr(X) -> n__incr(X), incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS))), activate(X) -> X, activate(n__incr(X)) -> incr(X), activate(n__take(X1, X2)) -> take(X1, X2), activate(n__zip(X1, X2)) -> zip(X1, X2), activate(n__cons(X1, X2)) -> cons(X1, X2), activate(n__repItems(X)) -> repItems(X), take(X1, X2) -> n__take(X1, X2), take(0(), XS) -> nil(), take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS))), zip(X, nil()) -> nil(), zip(X1, X2) -> n__zip(X1, X2), zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), n__zip(activate(XS), activate(YS))), zip(nil(), XS) -> nil(), tail(cons(X, XS)) -> activate(XS), repItems(X) -> n__repItems(X), repItems(cons(X, XS)) -> cons(X, n__cons(X, n__repItems(activate(XS)))), repItems(nil()) -> nil() } DUP: We consider a duplicating system. Trs: { cons(X1, X2) -> n__cons(X1, X2), oddNs() -> incr(pairNs()), pairNs() -> cons(0(), n__incr(oddNs())), incr(X) -> n__incr(X), incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS))), activate(X) -> X, activate(n__incr(X)) -> incr(X), activate(n__take(X1, X2)) -> take(X1, X2), activate(n__zip(X1, X2)) -> zip(X1, X2), activate(n__cons(X1, X2)) -> cons(X1, X2), activate(n__repItems(X)) -> repItems(X), take(X1, X2) -> n__take(X1, X2), take(0(), XS) -> nil(), take(s(N), cons(X, XS)) -> cons(X, n__take(N, activate(XS))), zip(X, nil()) -> nil(), zip(X1, X2) -> n__zip(X1, X2), zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), n__zip(activate(XS), activate(YS))), zip(nil(), XS) -> nil(), tail(cons(X, XS)) -> activate(XS), repItems(X) -> n__repItems(X), repItems(cons(X, XS)) -> cons(X, n__cons(X, n__repItems(activate(XS)))), repItems(nil()) -> nil() } Fail