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