MAYBE 'Pop* (timeout of 60.0 seconds)' -------------------------------- Answer: MAYBE Input Problem: innermost runtime-complexity with respect to Rules: { a__zeros() -> cons(0(), zeros()) , a__and(tt(), X) -> mark(X) , a__length(nil()) -> 0() , a__length(cons(N, L)) -> s(a__length(mark(L))) , a__take(0(), IL) -> nil() , a__take(s(M), cons(N, IL)) -> cons(mark(N), take(M, IL)) , mark(zeros()) -> a__zeros() , mark(and(X1, X2)) -> a__and(mark(X1), X2) , mark(length(X)) -> a__length(mark(X)) , mark(take(X1, X2)) -> a__take(mark(X1), mark(X2)) , mark(cons(X1, X2)) -> cons(mark(X1), X2) , mark(0()) -> 0() , mark(tt()) -> tt() , mark(nil()) -> nil() , mark(s(X)) -> s(mark(X)) , a__zeros() -> zeros() , a__and(X1, X2) -> and(X1, X2) , a__length(X) -> length(X) , a__take(X1, X2) -> take(X1, X2)} Proof Output: The input cannot be shown compatible The following warning(s) occured: Warning when parsing problem: Unsupported strategy 'OUTERMOST'