MAYBE 898.86/297.11 MAYBE 898.86/297.11 898.86/297.11 We are left with following problem, upon which TcT provides the 898.86/297.11 certificate MAYBE. 898.86/297.11 898.86/297.11 Strict Trs: 898.86/297.11 { active(zeros()) -> mark(cons(0(), zeros())) 898.86/297.11 , active(cons(X1, X2)) -> cons(active(X1), X2) 898.86/297.11 , active(U11(X1, X2)) -> U11(active(X1), X2) 898.86/297.11 , active(U11(tt(), L)) -> mark(U12(tt(), L)) 898.86/297.11 , active(U12(X1, X2)) -> U12(active(X1), X2) 898.86/297.11 , active(U12(tt(), L)) -> mark(s(length(L))) 898.86/297.11 , active(s(X)) -> s(active(X)) 898.86/297.11 , active(length(X)) -> length(active(X)) 898.86/297.11 , active(length(cons(N, L))) -> mark(U11(tt(), L)) 898.86/297.11 , active(length(nil())) -> mark(0()) 898.86/297.11 , active(U21(X1, X2, X3, X4)) -> U21(active(X1), X2, X3, X4) 898.86/297.11 , active(U21(tt(), IL, M, N)) -> mark(U22(tt(), IL, M, N)) 898.86/297.11 , active(U22(X1, X2, X3, X4)) -> U22(active(X1), X2, X3, X4) 898.86/297.11 , active(U22(tt(), IL, M, N)) -> mark(U23(tt(), IL, M, N)) 898.86/297.11 , active(U23(X1, X2, X3, X4)) -> U23(active(X1), X2, X3, X4) 898.86/297.11 , active(U23(tt(), IL, M, N)) -> mark(cons(N, take(M, IL))) 898.86/297.11 , active(take(X1, X2)) -> take(X1, active(X2)) 898.86/297.11 , active(take(X1, X2)) -> take(active(X1), X2) 898.86/297.11 , active(take(0(), IL)) -> mark(nil()) 898.86/297.11 , active(take(s(M), cons(N, IL))) -> mark(U21(tt(), IL, M, N)) 898.86/297.11 , cons(mark(X1), X2) -> mark(cons(X1, X2)) 898.86/297.11 , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2)) 898.86/297.11 , U11(mark(X1), X2) -> mark(U11(X1, X2)) 898.86/297.11 , U11(ok(X1), ok(X2)) -> ok(U11(X1, X2)) 898.86/297.11 , U12(mark(X1), X2) -> mark(U12(X1, X2)) 898.86/297.11 , U12(ok(X1), ok(X2)) -> ok(U12(X1, X2)) 898.86/297.11 , s(mark(X)) -> mark(s(X)) 898.86/297.11 , s(ok(X)) -> ok(s(X)) 898.86/297.11 , length(mark(X)) -> mark(length(X)) 898.86/297.11 , length(ok(X)) -> ok(length(X)) 898.86/297.11 , U21(mark(X1), X2, X3, X4) -> mark(U21(X1, X2, X3, X4)) 898.86/297.11 , U21(ok(X1), ok(X2), ok(X3), ok(X4)) -> ok(U21(X1, X2, X3, X4)) 898.86/297.11 , U22(mark(X1), X2, X3, X4) -> mark(U22(X1, X2, X3, X4)) 898.86/297.11 , U22(ok(X1), ok(X2), ok(X3), ok(X4)) -> ok(U22(X1, X2, X3, X4)) 898.86/297.11 , U23(mark(X1), X2, X3, X4) -> mark(U23(X1, X2, X3, X4)) 898.86/297.11 , U23(ok(X1), ok(X2), ok(X3), ok(X4)) -> ok(U23(X1, X2, X3, X4)) 898.86/297.11 , take(X1, mark(X2)) -> mark(take(X1, X2)) 898.86/297.11 , take(mark(X1), X2) -> mark(take(X1, X2)) 898.86/297.11 , take(ok(X1), ok(X2)) -> ok(take(X1, X2)) 898.86/297.11 , proper(zeros()) -> ok(zeros()) 898.86/297.11 , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2)) 898.86/297.11 , proper(0()) -> ok(0()) 898.86/297.11 , proper(U11(X1, X2)) -> U11(proper(X1), proper(X2)) 898.86/297.11 , proper(tt()) -> ok(tt()) 898.86/297.11 , proper(U12(X1, X2)) -> U12(proper(X1), proper(X2)) 898.86/297.11 , proper(s(X)) -> s(proper(X)) 898.86/297.11 , proper(length(X)) -> length(proper(X)) 898.86/297.11 , proper(U21(X1, X2, X3, X4)) -> 898.86/297.11 U21(proper(X1), proper(X2), proper(X3), proper(X4)) 898.86/297.11 , proper(U22(X1, X2, X3, X4)) -> 898.86/297.11 U22(proper(X1), proper(X2), proper(X3), proper(X4)) 898.86/297.11 , proper(U23(X1, X2, X3, X4)) -> 898.86/297.11 U23(proper(X1), proper(X2), proper(X3), proper(X4)) 898.86/297.11 , proper(take(X1, X2)) -> take(proper(X1), proper(X2)) 898.86/297.11 , proper(nil()) -> ok(nil()) 898.86/297.11 , top(mark(X)) -> top(proper(X)) 898.86/297.11 , top(ok(X)) -> top(active(X)) } 898.86/297.11 Obligation: 898.86/297.11 innermost runtime complexity 898.86/297.11 Answer: 898.86/297.11 MAYBE 898.86/297.11 898.86/297.11 None of the processors succeeded. 898.86/297.11 898.86/297.11 Details of failed attempt(s): 898.86/297.11 ----------------------------- 898.86/297.11 1) 'empty' failed due to the following reason: 898.86/297.11 898.86/297.11 Empty strict component of the problem is NOT empty. 898.86/297.11 898.86/297.11 2) 'Best' failed due to the following reason: 898.86/297.11 898.86/297.11 None of the processors succeeded. 898.86/297.11 898.86/297.11 Details of failed attempt(s): 898.86/297.11 ----------------------------- 898.86/297.11 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 898.86/297.11 following reason: 898.86/297.11 898.86/297.11 Computation stopped due to timeout after 297.0 seconds. 898.86/297.11 898.86/297.11 2) 'Best' failed due to the following reason: 898.86/297.11 898.86/297.11 None of the processors succeeded. 898.86/297.11 898.86/297.11 Details of failed attempt(s): 898.86/297.11 ----------------------------- 898.86/297.11 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 898.86/297.11 seconds)' failed due to the following reason: 898.86/297.11 898.86/297.11 Computation stopped due to timeout after 148.0 seconds. 898.86/297.11 898.86/297.11 2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 898.86/297.11 failed due to the following reason: 898.86/297.11 898.86/297.11 Computation stopped due to timeout after 24.0 seconds. 898.86/297.11 898.86/297.11 3) 'Best' failed due to the following reason: 898.86/297.11 898.86/297.11 None of the processors succeeded. 898.86/297.11 898.86/297.11 Details of failed attempt(s): 898.86/297.11 ----------------------------- 898.86/297.11 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 898.86/297.11 to the following reason: 898.86/297.11 898.86/297.11 The input cannot be shown compatible 898.86/297.11 898.86/297.11 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 898.86/297.11 following reason: 898.86/297.11 898.86/297.11 The input cannot be shown compatible 898.86/297.11 898.86/297.11 898.86/297.11 898.86/297.11 898.86/297.11 898.86/297.11 Arrrr.. 899.09/297.32 EOF