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