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