MAYBE 'epo* (timeout of 60.0 seconds)' -------------------------------- Answer: MAYBE Input Problem: innermost runtime-complexity with respect to Rules: { pairNs() -> cons(0(), incr(oddNs())) , oddNs() -> incr(pairNs()) , incr(cons(X, XS)) -> cons(s(X), incr(XS)) , take(0(), XS) -> nil() , take(s(N), cons(X, XS)) -> cons(X, take(N, XS)) , zip(nil(), XS) -> nil() , zip(X, nil()) -> nil() , zip(cons(X, XS), cons(Y, YS)) -> cons(pair(X, Y), zip(XS, YS)) , tail(cons(X, XS)) -> XS , repItems(nil()) -> nil() , repItems(cons(X, XS)) -> cons(X, cons(X, repItems(XS)))} Proof Output: The input cannot be shown compatible