MAYBE 'Pop* with parameter subtitution (timeout of 60.0 seconds)' ----------------------------------------------------------- Answer: MAYBE Input Problem: innermost runtime-complexity with respect to Rules: { incr(nil()) -> nil() , incr(cons(X, L)) -> cons(s(X), n__incr(activate(L))) , adx(nil()) -> nil() , adx(cons(X, L)) -> incr(cons(X, n__adx(activate(L)))) , nats() -> adx(zeros()) , zeros() -> cons(0(), n__zeros()) , head(cons(X, L)) -> X , tail(cons(X, L)) -> activate(L) , incr(X) -> n__incr(X) , adx(X) -> n__adx(X) , zeros() -> n__zeros() , activate(n__incr(X)) -> incr(X) , activate(n__adx(X)) -> adx(X) , activate(n__zeros()) -> zeros() , activate(X) -> X} Proof Output: The input cannot be shown compatible The following warning(s) occured: Warning when parsing problem: Unsupported strategy 'OUTERMOST'