MAYBE 1005.67/297.03 MAYBE 1005.67/297.03 1005.67/297.03 We are left with following problem, upon which TcT provides the 1005.67/297.03 certificate MAYBE. 1005.67/297.03 1005.67/297.03 Strict Trs: 1005.67/297.03 { a__from(X) -> cons(mark(X), from(s(X))) 1005.67/297.03 , a__from(X) -> from(X) 1005.67/297.03 , mark(cons(X1, X2)) -> cons(mark(X1), X2) 1005.67/297.03 , mark(from(X)) -> a__from(mark(X)) 1005.67/297.03 , mark(s(X)) -> s(mark(X)) 1005.67/297.03 , mark(0()) -> 0() 1005.67/297.03 , mark(rnil()) -> rnil() 1005.67/297.03 , mark(cons2(X1, X2)) -> cons2(X1, mark(X2)) 1005.67/297.03 , mark(rcons(X1, X2)) -> rcons(mark(X1), mark(X2)) 1005.67/297.03 , mark(posrecip(X)) -> posrecip(mark(X)) 1005.67/297.03 , mark(negrecip(X)) -> negrecip(mark(X)) 1005.67/297.03 , mark(2ndspos(X1, X2)) -> a__2ndspos(mark(X1), mark(X2)) 1005.67/297.03 , mark(2ndsneg(X1, X2)) -> a__2ndsneg(mark(X1), mark(X2)) 1005.67/297.03 , mark(pi(X)) -> a__pi(mark(X)) 1005.67/297.03 , mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) 1005.67/297.03 , mark(times(X1, X2)) -> a__times(mark(X1), mark(X2)) 1005.67/297.03 , mark(square(X)) -> a__square(mark(X)) 1005.67/297.03 , mark(nil()) -> nil() 1005.67/297.03 , a__2ndspos(X1, X2) -> 2ndspos(X1, X2) 1005.67/297.03 , a__2ndspos(s(N), cons(X, Z)) -> 1005.67/297.03 a__2ndspos(s(mark(N)), cons2(X, mark(Z))) 1005.67/297.03 , a__2ndspos(s(N), cons2(X, cons(Y, Z))) -> 1005.67/297.03 rcons(posrecip(mark(Y)), a__2ndsneg(mark(N), mark(Z))) 1005.67/297.03 , a__2ndspos(0(), Z) -> rnil() 1005.67/297.03 , a__2ndsneg(X1, X2) -> 2ndsneg(X1, X2) 1005.67/297.03 , a__2ndsneg(s(N), cons(X, Z)) -> 1005.67/297.03 a__2ndsneg(s(mark(N)), cons2(X, mark(Z))) 1005.67/297.03 , a__2ndsneg(s(N), cons2(X, cons(Y, Z))) -> 1005.67/297.03 rcons(negrecip(mark(Y)), a__2ndspos(mark(N), mark(Z))) 1005.67/297.03 , a__2ndsneg(0(), Z) -> rnil() 1005.67/297.03 , a__pi(X) -> a__2ndspos(mark(X), a__from(0())) 1005.67/297.03 , a__pi(X) -> pi(X) 1005.67/297.03 , a__plus(X1, X2) -> plus(X1, X2) 1005.67/297.03 , a__plus(s(X), Y) -> s(a__plus(mark(X), mark(Y))) 1005.67/297.03 , a__plus(0(), Y) -> mark(Y) 1005.67/297.03 , a__times(X1, X2) -> times(X1, X2) 1005.67/297.03 , a__times(s(X), Y) -> a__plus(mark(Y), a__times(mark(X), mark(Y))) 1005.67/297.03 , a__times(0(), Y) -> 0() 1005.67/297.03 , a__square(X) -> a__times(mark(X), mark(X)) 1005.67/297.03 , a__square(X) -> square(X) } 1005.67/297.03 Obligation: 1005.67/297.03 innermost runtime complexity 1005.67/297.03 Answer: 1005.67/297.03 MAYBE 1005.67/297.03 1005.67/297.03 None of the processors succeeded. 1005.67/297.03 1005.67/297.03 Details of failed attempt(s): 1005.67/297.03 ----------------------------- 1005.67/297.03 1) 'empty' failed due to the following reason: 1005.67/297.03 1005.67/297.03 Empty strict component of the problem is NOT empty. 1005.67/297.03 1005.67/297.03 2) 'Best' failed due to the following reason: 1005.67/297.03 1005.67/297.03 None of the processors succeeded. 1005.67/297.03 1005.67/297.03 Details of failed attempt(s): 1005.67/297.03 ----------------------------- 1005.67/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1005.67/297.03 following reason: 1005.67/297.03 1005.67/297.03 Computation stopped due to timeout after 297.0 seconds. 1005.67/297.03 1005.67/297.03 2) 'Best' failed due to the following reason: 1005.67/297.03 1005.67/297.03 None of the processors succeeded. 1005.67/297.03 1005.67/297.03 Details of failed attempt(s): 1005.67/297.03 ----------------------------- 1005.67/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1005.67/297.03 seconds)' failed due to the following reason: 1005.67/297.03 1005.67/297.03 Computation stopped due to timeout after 148.0 seconds. 1005.67/297.03 1005.67/297.03 2) 'Best' failed due to the following reason: 1005.67/297.03 1005.67/297.03 None of the processors succeeded. 1005.67/297.03 1005.67/297.03 Details of failed attempt(s): 1005.67/297.03 ----------------------------- 1005.67/297.03 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1005.67/297.03 to the following reason: 1005.67/297.03 1005.67/297.03 The input cannot be shown compatible 1005.67/297.03 1005.67/297.03 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1005.67/297.03 following reason: 1005.67/297.03 1005.67/297.03 The input cannot be shown compatible 1005.67/297.03 1005.67/297.03 1005.67/297.03 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1005.67/297.03 failed due to the following reason: 1005.67/297.03 1005.67/297.03 None of the processors succeeded. 1005.67/297.03 1005.67/297.03 Details of failed attempt(s): 1005.67/297.03 ----------------------------- 1005.67/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1005.67/297.03 failed due to the following reason: 1005.67/297.03 1005.67/297.03 match-boundness of the problem could not be verified. 1005.67/297.03 1005.67/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1005.67/297.03 failed due to the following reason: 1005.67/297.03 1005.67/297.03 match-boundness of the problem could not be verified. 1005.67/297.03 1005.67/297.03 1005.67/297.03 1005.67/297.03 1005.67/297.03 1005.67/297.03 Arrrr.. 1007.82/299.20 EOF