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