MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { minus(0(), x) -> 0() , minus(s(x), 0()) -> s(x) , minus(s(x), s(y)) -> minus(x, y) , mod(x, 0()) -> 0() , mod(x, s(y)) -> if(lt(x, s(y)), x, s(y)) , if(true(), x, y) -> x , if(false(), x, y) -> mod(minus(x, y), y) , lt(x, 0()) -> false() , lt(0(), s(x)) -> true() , lt(s(x), s(y)) -> lt(x, y) , gcd(x, 0()) -> x , gcd(0(), s(y)) -> s(y) , gcd(s(x), s(y)) -> gcd(mod(s(x), s(y)), mod(s(y), s(x))) } 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..