MAYBE We are left with following problem, upon which TcT provides the certificate MAYBE. Strict Trs: { f(X, n__g(X), Y) -> f(activate(Y), activate(Y), activate(Y)) , activate(X) -> X , activate(n__g(X)) -> g(X) , g(X) -> n__g(X) , g(b()) -> c() , b() -> c() } Obligation: runtime complexity Answer: MAYBE 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: 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) 'WithProblem' failed due to the following reason: 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) 'Fastest' failed due to the following reason: None of the processors succeeded. Details of failed attempt(s): ----------------------------- 1) 'WithProblem' failed due to the following reason: 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) 'WithProblem' failed due to the following reason: 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) 'WithProblem' failed due to the following reason: 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) 'WithProblem' failed due to the following reason: Empty strict component of the problem is NOT empty. 2) 'WithProblem' failed due to the following reason: 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) 'WithProblem' 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) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due to the following reason: The processor is inapplicable, reason: Processor only applicable for innermost runtime complexity analysis 2) 'bsearch-popstar (timeout of 60 seconds)' failed due to the following reason: The processor is inapplicable, reason: Processor only applicable for innermost runtime complexity analysis 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. 3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed due to the following reason: We add the following weak dependency pairs: Strict DPs: { f^#(X, n__g(X), Y) -> c_1(f^#(activate(Y), activate(Y), activate(Y))) , activate^#(X) -> c_2(X) , activate^#(n__g(X)) -> c_3(g^#(X)) , g^#(X) -> c_4(X) , g^#(b()) -> c_5() , b^#() -> c_6() } and mark the set of starting terms. We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { f^#(X, n__g(X), Y) -> c_1(f^#(activate(Y), activate(Y), activate(Y))) , activate^#(X) -> c_2(X) , activate^#(n__g(X)) -> c_3(g^#(X)) , g^#(X) -> c_4(X) , g^#(b()) -> c_5() , b^#() -> c_6() } Strict Trs: { f(X, n__g(X), Y) -> f(activate(Y), activate(Y), activate(Y)) , activate(X) -> X , activate(n__g(X)) -> g(X) , g(X) -> n__g(X) , g(b()) -> c() , b() -> c() } Obligation: runtime complexity Answer: MAYBE We estimate the number of application of {5,6} by applications of Pre({5,6}) = {2,3,4}. Here rules are labeled as follows: DPs: { 1: f^#(X, n__g(X), Y) -> c_1(f^#(activate(Y), activate(Y), activate(Y))) , 2: activate^#(X) -> c_2(X) , 3: activate^#(n__g(X)) -> c_3(g^#(X)) , 4: g^#(X) -> c_4(X) , 5: g^#(b()) -> c_5() , 6: b^#() -> c_6() } We are left with following problem, upon which TcT provides the certificate MAYBE. Strict DPs: { f^#(X, n__g(X), Y) -> c_1(f^#(activate(Y), activate(Y), activate(Y))) , activate^#(X) -> c_2(X) , activate^#(n__g(X)) -> c_3(g^#(X)) , g^#(X) -> c_4(X) } Strict Trs: { f(X, n__g(X), Y) -> f(activate(Y), activate(Y), activate(Y)) , activate(X) -> X , activate(n__g(X)) -> g(X) , g(X) -> n__g(X) , g(b()) -> c() , b() -> c() } Weak DPs: { g^#(b()) -> c_5() , b^#() -> c_6() } Obligation: runtime complexity Answer: MAYBE Empty strict component of the problem is NOT empty. Arrrr..