MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { g(A()) -> A() , g(B()) -> A() , g(B()) -> B() , g(C()) -> A() , g(C()) -> B() , g(C()) -> C() , foldB(t, 0()) -> t , foldB(t, s(n)) -> f(foldB(t, n), B()) , f(t, x) -> f'(t, g(x)) , foldC(t, 0()) -> t , foldC(t, s(n)) -> f(foldC(t, n), C()) , f'(triple(a, b, c), A()) -> f''(foldB(triple(s(a), 0(), c), b)) , f'(triple(a, b, c), B()) -> f(triple(a, b, c), A()) , f'(triple(a, b, c), C()) -> triple(a, b, s(c)) , f''(triple(a, b, c)) -> foldC(triple(a, b, 0()), c) } 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) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed due to the following reason: Computation stopped due to timeout after 5.0 seconds. 3) 'Best' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'bsearch-popstar (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible 2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due to the following reason: The input cannot be shown compatible Arrrr..