MAYBE 1031.80/297.05 MAYBE 1031.80/297.05 1031.80/297.05 We are left with following problem, upon which TcT provides the 1031.80/297.05 certificate MAYBE. 1031.80/297.05 1031.80/297.05 Strict Trs: 1031.80/297.05 { a__terms(N) -> cons(recip(a__sqr(mark(N))), terms(s(N))) 1031.80/297.05 , a__terms(X) -> terms(X) 1031.80/297.05 , a__sqr(X) -> sqr(X) 1031.80/297.05 , a__sqr(s(X)) -> s(a__add(a__sqr(mark(X)), a__dbl(mark(X)))) 1031.80/297.05 , a__sqr(0()) -> 0() 1031.80/297.05 , mark(cons(X1, X2)) -> cons(mark(X1), X2) 1031.80/297.05 , mark(recip(X)) -> recip(mark(X)) 1031.80/297.05 , mark(terms(X)) -> a__terms(mark(X)) 1031.80/297.05 , mark(s(X)) -> s(mark(X)) 1031.80/297.05 , mark(0()) -> 0() 1031.80/297.05 , mark(nil()) -> nil() 1031.80/297.05 , mark(first(X1, X2)) -> a__first(mark(X1), mark(X2)) 1031.80/297.05 , mark(sqr(X)) -> a__sqr(mark(X)) 1031.80/297.05 , mark(add(X1, X2)) -> a__add(mark(X1), mark(X2)) 1031.80/297.05 , mark(dbl(X)) -> a__dbl(mark(X)) 1031.80/297.05 , a__add(X1, X2) -> add(X1, X2) 1031.80/297.05 , a__add(s(X), Y) -> s(a__add(mark(X), mark(Y))) 1031.80/297.05 , a__add(0(), X) -> mark(X) 1031.80/297.05 , a__dbl(X) -> dbl(X) 1031.80/297.05 , a__dbl(s(X)) -> s(s(a__dbl(mark(X)))) 1031.80/297.05 , a__dbl(0()) -> 0() 1031.80/297.05 , a__first(X1, X2) -> first(X1, X2) 1031.80/297.05 , a__first(s(X), cons(Y, Z)) -> cons(mark(Y), first(X, Z)) 1031.80/297.05 , a__first(0(), X) -> nil() } 1031.80/297.05 Obligation: 1031.80/297.05 innermost runtime complexity 1031.80/297.05 Answer: 1031.80/297.05 MAYBE 1031.80/297.05 1031.80/297.05 None of the processors succeeded. 1031.80/297.05 1031.80/297.05 Details of failed attempt(s): 1031.80/297.05 ----------------------------- 1031.80/297.05 1) 'empty' failed due to the following reason: 1031.80/297.05 1031.80/297.05 Empty strict component of the problem is NOT empty. 1031.80/297.05 1031.80/297.05 2) 'Best' failed due to the following reason: 1031.80/297.05 1031.80/297.05 None of the processors succeeded. 1031.80/297.05 1031.80/297.05 Details of failed attempt(s): 1031.80/297.05 ----------------------------- 1031.80/297.05 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1031.80/297.05 following reason: 1031.80/297.05 1031.80/297.05 Computation stopped due to timeout after 297.0 seconds. 1031.80/297.05 1031.80/297.05 2) 'Best' failed due to the following reason: 1031.80/297.05 1031.80/297.05 None of the processors succeeded. 1031.80/297.05 1031.80/297.05 Details of failed attempt(s): 1031.80/297.05 ----------------------------- 1031.80/297.05 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1031.80/297.05 seconds)' failed due to the following reason: 1031.80/297.05 1031.80/297.05 Computation stopped due to timeout after 148.0 seconds. 1031.80/297.05 1031.80/297.05 2) 'Best' failed due to the following reason: 1031.80/297.05 1031.80/297.05 None of the processors succeeded. 1031.80/297.05 1031.80/297.05 Details of failed attempt(s): 1031.80/297.05 ----------------------------- 1031.80/297.05 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1031.80/297.05 following reason: 1031.80/297.05 1031.80/297.05 The input cannot be shown compatible 1031.80/297.05 1031.80/297.05 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1031.80/297.05 to the following reason: 1031.80/297.05 1031.80/297.05 The input cannot be shown compatible 1031.80/297.05 1031.80/297.05 1031.80/297.05 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1031.80/297.05 failed due to the following reason: 1031.80/297.05 1031.80/297.05 None of the processors succeeded. 1031.80/297.05 1031.80/297.05 Details of failed attempt(s): 1031.80/297.05 ----------------------------- 1031.80/297.05 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1031.80/297.05 failed due to the following reason: 1031.80/297.05 1031.80/297.05 match-boundness of the problem could not be verified. 1031.80/297.05 1031.80/297.05 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1031.80/297.05 failed due to the following reason: 1031.80/297.05 1031.80/297.05 match-boundness of the problem could not be verified. 1031.80/297.05 1031.80/297.05 1031.80/297.05 1031.80/297.05 1031.80/297.05 1031.80/297.05 Arrrr.. 1034.47/299.62 EOF