MAYBE 1008.02/297.11 MAYBE 1008.02/297.11 1008.02/297.11 We are left with following problem, upon which TcT provides the 1008.02/297.11 certificate MAYBE. 1008.02/297.11 1008.02/297.11 Strict Trs: 1008.02/297.11 { a__U11(X1, X2, X3, X4) -> U11(X1, X2, X3, X4) 1008.02/297.11 , a__U11(tt(), N, X, XS) -> 1008.02/297.11 a__U12(a__splitAt(mark(N), mark(XS)), X) 1008.02/297.11 , a__U12(X1, X2) -> U12(X1, X2) 1008.02/297.11 , a__U12(pair(YS, ZS), X) -> pair(cons(mark(X), YS), mark(ZS)) 1008.02/297.11 , a__splitAt(X1, X2) -> splitAt(X1, X2) 1008.02/297.11 , a__splitAt(s(N), cons(X, XS)) -> a__U11(tt(), N, X, XS) 1008.02/297.11 , a__splitAt(0(), XS) -> pair(nil(), mark(XS)) 1008.02/297.11 , mark(tt()) -> tt() 1008.02/297.11 , mark(pair(X1, X2)) -> pair(mark(X1), mark(X2)) 1008.02/297.11 , mark(cons(X1, X2)) -> cons(mark(X1), X2) 1008.02/297.11 , mark(natsFrom(X)) -> a__natsFrom(mark(X)) 1008.02/297.11 , mark(s(X)) -> s(mark(X)) 1008.02/297.11 , mark(0()) -> 0() 1008.02/297.11 , mark(nil()) -> nil() 1008.02/297.11 , mark(U11(X1, X2, X3, X4)) -> a__U11(mark(X1), X2, X3, X4) 1008.02/297.11 , mark(U12(X1, X2)) -> a__U12(mark(X1), X2) 1008.02/297.11 , mark(splitAt(X1, X2)) -> a__splitAt(mark(X1), mark(X2)) 1008.02/297.11 , mark(afterNth(X1, X2)) -> a__afterNth(mark(X1), mark(X2)) 1008.02/297.11 , mark(snd(X)) -> a__snd(mark(X)) 1008.02/297.11 , mark(and(X1, X2)) -> a__and(mark(X1), X2) 1008.02/297.11 , mark(fst(X)) -> a__fst(mark(X)) 1008.02/297.11 , mark(head(X)) -> a__head(mark(X)) 1008.02/297.11 , mark(sel(X1, X2)) -> a__sel(mark(X1), mark(X2)) 1008.02/297.11 , mark(tail(X)) -> a__tail(mark(X)) 1008.02/297.11 , mark(take(X1, X2)) -> a__take(mark(X1), mark(X2)) 1008.02/297.11 , a__afterNth(N, XS) -> a__snd(a__splitAt(mark(N), mark(XS))) 1008.02/297.11 , a__afterNth(X1, X2) -> afterNth(X1, X2) 1008.02/297.11 , a__snd(X) -> snd(X) 1008.02/297.11 , a__snd(pair(X, Y)) -> mark(Y) 1008.02/297.11 , a__and(X1, X2) -> and(X1, X2) 1008.02/297.11 , a__and(tt(), X) -> mark(X) 1008.02/297.11 , a__fst(X) -> fst(X) 1008.02/297.11 , a__fst(pair(X, Y)) -> mark(X) 1008.02/297.11 , a__head(X) -> head(X) 1008.02/297.11 , a__head(cons(N, XS)) -> mark(N) 1008.02/297.11 , a__natsFrom(N) -> cons(mark(N), natsFrom(s(N))) 1008.02/297.11 , a__natsFrom(X) -> natsFrom(X) 1008.02/297.11 , a__sel(N, XS) -> a__head(a__afterNth(mark(N), mark(XS))) 1008.02/297.11 , a__sel(X1, X2) -> sel(X1, X2) 1008.02/297.11 , a__tail(X) -> tail(X) 1008.02/297.11 , a__tail(cons(N, XS)) -> mark(XS) 1008.02/297.11 , a__take(N, XS) -> a__fst(a__splitAt(mark(N), mark(XS))) 1008.02/297.11 , a__take(X1, X2) -> take(X1, X2) } 1008.02/297.11 Obligation: 1008.02/297.11 innermost runtime complexity 1008.02/297.11 Answer: 1008.02/297.11 MAYBE 1008.02/297.11 1008.02/297.11 None of the processors succeeded. 1008.02/297.11 1008.02/297.11 Details of failed attempt(s): 1008.02/297.11 ----------------------------- 1008.02/297.11 1) 'empty' failed due to the following reason: 1008.02/297.11 1008.02/297.11 Empty strict component of the problem is NOT empty. 1008.02/297.11 1008.02/297.11 2) 'Best' failed due to the following reason: 1008.02/297.11 1008.02/297.11 None of the processors succeeded. 1008.02/297.11 1008.02/297.11 Details of failed attempt(s): 1008.02/297.11 ----------------------------- 1008.02/297.11 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1008.02/297.11 following reason: 1008.02/297.11 1008.02/297.11 Computation stopped due to timeout after 297.0 seconds. 1008.02/297.11 1008.02/297.11 2) 'Best' failed due to the following reason: 1008.02/297.11 1008.02/297.11 None of the processors succeeded. 1008.02/297.11 1008.02/297.11 Details of failed attempt(s): 1008.02/297.11 ----------------------------- 1008.02/297.11 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1008.02/297.11 seconds)' failed due to the following reason: 1008.02/297.11 1008.02/297.11 Computation stopped due to timeout after 148.0 seconds. 1008.02/297.11 1008.02/297.11 2) 'Best' failed due to the following reason: 1008.02/297.11 1008.02/297.11 None of the processors succeeded. 1008.02/297.11 1008.02/297.11 Details of failed attempt(s): 1008.02/297.11 ----------------------------- 1008.02/297.11 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1008.02/297.11 to the following reason: 1008.02/297.11 1008.02/297.11 The input cannot be shown compatible 1008.02/297.11 1008.02/297.11 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1008.02/297.11 following reason: 1008.02/297.11 1008.02/297.11 The input cannot be shown compatible 1008.02/297.11 1008.02/297.11 1008.02/297.11 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1008.02/297.11 failed due to the following reason: 1008.02/297.11 1008.02/297.11 None of the processors succeeded. 1008.02/297.11 1008.02/297.11 Details of failed attempt(s): 1008.02/297.11 ----------------------------- 1008.02/297.11 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1008.02/297.11 failed due to the following reason: 1008.02/297.11 1008.02/297.11 match-boundness of the problem could not be verified. 1008.02/297.11 1008.02/297.11 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1008.02/297.11 failed due to the following reason: 1008.02/297.11 1008.02/297.11 match-boundness of the problem could not be verified. 1008.02/297.11 1008.02/297.11 1008.02/297.11 1008.02/297.11 1008.02/297.11 1008.02/297.11 Arrrr.. 1009.73/298.89 EOF