MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { inc(s(x)) -> s(inc(x)) , inc(0()) -> s(0()) , plus(x, y) -> ifPlus(eq(x, 0()), minus(x, s(0())), x, inc(x)) , ifPlus(false(), x, y, z) -> plus(x, z) , ifPlus(true(), x, y, z) -> y , eq(x, x) -> true() , eq(s(x), s(y)) -> eq(x, y) , eq(s(x), 0()) -> false() , eq(0(), s(x)) -> false() , eq(0(), 0()) -> true() , minus(x, x) -> 0() , minus(x, 0()) -> x , minus(s(x), s(y)) -> minus(x, y) , minus(0(), x) -> 0() , times(x, y) -> timesIter(x, y, 0()) , timesIter(x, y, z) -> ifTimes(eq(x, 0()), minus(x, s(0())), y, z, plus(y, z)) , ifTimes(false(), x, y, z, u) -> timesIter(x, y, u) , ifTimes(true(), x, y, z, u) -> z , f() -> g() , f() -> h() } 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 minimal-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason: match-boundness of the problem could not be verified. Arrrr..