MAYBE 949.02/297.03 MAYBE 949.02/297.03 949.02/297.03 We are left with following problem, upon which TcT provides the 949.02/297.03 certificate MAYBE. 949.02/297.03 949.02/297.03 Strict Trs: 949.02/297.03 { 0(#()) -> #() 949.02/297.03 , +(x, #()) -> x 949.02/297.03 , +(0(x), 0(y)) -> 0(+(x, y)) 949.02/297.03 , +(0(x), 1(y)) -> 1(+(x, y)) 949.02/297.03 , +(#(), x) -> x 949.02/297.03 , +(+(x, y), z) -> +(x, +(y, z)) 949.02/297.03 , +(1(x), 0(y)) -> 1(+(x, y)) 949.02/297.03 , +(1(x), 1(y)) -> 0(+(+(x, y), 1(#()))) 949.02/297.03 , *(x, +(y, z)) -> +(*(x, y), *(x, z)) 949.02/297.03 , *(0(x), y) -> 0(*(x, y)) 949.02/297.03 , *(#(), x) -> #() 949.02/297.03 , *(1(x), y) -> +(0(*(x, y)), y) 949.02/297.03 , *(*(x, y), z) -> *(x, *(y, z)) 949.02/297.03 , app(nil(), l) -> l 949.02/297.03 , app(cons(x, l1), l2) -> cons(x, app(l1, l2)) 949.02/297.03 , sum(app(l1, l2)) -> +(sum(l1), sum(l2)) 949.02/297.03 , sum(nil()) -> 0(#()) 949.02/297.03 , sum(cons(x, l)) -> +(x, sum(l)) 949.02/297.03 , prod(app(l1, l2)) -> *(prod(l1), prod(l2)) 949.02/297.03 , prod(nil()) -> 1(#()) 949.02/297.03 , prod(cons(x, l)) -> *(x, prod(l)) } 949.02/297.03 Obligation: 949.02/297.03 innermost runtime complexity 949.02/297.03 Answer: 949.02/297.03 MAYBE 949.02/297.03 949.02/297.03 None of the processors succeeded. 949.02/297.03 949.02/297.03 Details of failed attempt(s): 949.02/297.03 ----------------------------- 949.02/297.03 1) 'empty' failed due to the following reason: 949.02/297.03 949.02/297.03 Empty strict component of the problem is NOT empty. 949.02/297.03 949.02/297.03 2) 'Best' failed due to the following reason: 949.02/297.03 949.02/297.03 None of the processors succeeded. 949.02/297.03 949.02/297.03 Details of failed attempt(s): 949.02/297.03 ----------------------------- 949.02/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 949.02/297.03 following reason: 949.02/297.03 949.02/297.03 Computation stopped due to timeout after 297.0 seconds. 949.02/297.03 949.02/297.03 2) 'Best' failed due to the following reason: 949.02/297.03 949.02/297.03 None of the processors succeeded. 949.02/297.03 949.02/297.03 Details of failed attempt(s): 949.02/297.03 ----------------------------- 949.02/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 949.02/297.03 seconds)' failed due to the following reason: 949.02/297.03 949.02/297.03 Computation stopped due to timeout after 148.0 seconds. 949.02/297.03 949.02/297.03 2) 'Best' failed due to the following reason: 949.02/297.03 949.02/297.03 None of the processors succeeded. 949.02/297.03 949.02/297.03 Details of failed attempt(s): 949.02/297.03 ----------------------------- 949.02/297.03 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 949.02/297.03 to the following reason: 949.02/297.03 949.02/297.03 The input cannot be shown compatible 949.02/297.03 949.02/297.03 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 949.02/297.03 following reason: 949.02/297.03 949.02/297.03 The input cannot be shown compatible 949.02/297.03 949.02/297.03 949.02/297.03 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 949.02/297.03 failed due to the following reason: 949.02/297.03 949.02/297.03 None of the processors succeeded. 949.02/297.03 949.02/297.03 Details of failed attempt(s): 949.02/297.03 ----------------------------- 949.02/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 949.02/297.03 failed due to the following reason: 949.02/297.03 949.02/297.03 match-boundness of the problem could not be verified. 949.02/297.03 949.02/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 949.02/297.03 failed due to the following reason: 949.02/297.03 949.02/297.03 match-boundness of the problem could not be verified. 949.02/297.03 949.02/297.03 949.02/297.03 949.02/297.03 949.02/297.03 949.02/297.03 Arrrr.. 949.34/297.33 EOF