MAYBE 897.23/297.03 MAYBE 897.23/297.03 897.23/297.03 We are left with following problem, upon which TcT provides the 897.23/297.03 certificate MAYBE. 897.23/297.03 897.23/297.03 Strict Trs: 897.23/297.03 { f(X, n__g(X), Y) -> f(activate(Y), activate(Y), activate(Y)) 897.23/297.03 , activate(X) -> X 897.23/297.03 , activate(n__g(X)) -> g(X) 897.23/297.03 , g(X) -> n__g(X) 897.23/297.03 , g(b()) -> c() 897.23/297.03 , b() -> c() } 897.23/297.03 Obligation: 897.23/297.03 runtime complexity 897.23/297.03 Answer: 897.23/297.03 MAYBE 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 897.23/297.03 following reason: 897.23/297.03 897.23/297.03 Computation stopped due to timeout after 297.0 seconds. 897.23/297.03 897.23/297.03 2) 'Best' failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 897.23/297.03 seconds)' failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'empty' failed due to the following reason: 897.23/297.03 897.23/297.03 Empty strict component of the problem is NOT empty. 897.23/297.03 897.23/297.03 2) 'With Problem ...' failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'empty' failed due to the following reason: 897.23/297.03 897.23/297.03 Empty strict component of the problem is NOT empty. 897.23/297.03 897.23/297.03 2) 'Fastest' failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'With Problem ...' failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'empty' failed due to the following reason: 897.23/297.03 897.23/297.03 Empty strict component of the problem is NOT empty. 897.23/297.03 897.23/297.03 2) 'With Problem ...' failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'empty' failed due to the following reason: 897.23/297.03 897.23/297.03 Empty strict component of the problem is NOT empty. 897.23/297.03 897.23/297.03 2) 'With Problem ...' failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'empty' failed due to the following reason: 897.23/297.03 897.23/297.03 Empty strict component of the problem is NOT empty. 897.23/297.03 897.23/297.03 2) 'With Problem ...' failed due to the following reason: 897.23/297.03 897.23/297.03 Empty strict component of the problem is NOT empty. 897.23/297.03 897.23/297.03 897.23/297.03 897.23/297.03 897.23/297.03 2) 'With Problem ...' failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'empty' failed due to the following reason: 897.23/297.03 897.23/297.03 Empty strict component of the problem is NOT empty. 897.23/297.03 897.23/297.03 2) 'With Problem ...' failed due to the following reason: 897.23/297.03 897.23/297.03 Empty strict component of the problem is NOT empty. 897.23/297.03 897.23/297.03 897.23/297.03 897.23/297.03 897.23/297.03 897.23/297.03 2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 897.23/297.03 failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 897.23/297.03 failed due to the following reason: 897.23/297.03 897.23/297.03 match-boundness of the problem could not be verified. 897.23/297.03 897.23/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 897.23/297.03 failed due to the following reason: 897.23/297.03 897.23/297.03 match-boundness of the problem could not be verified. 897.23/297.03 897.23/297.03 897.23/297.03 3) 'Best' failed due to the following reason: 897.23/297.03 897.23/297.03 None of the processors succeeded. 897.23/297.03 897.23/297.03 Details of failed attempt(s): 897.23/297.03 ----------------------------- 897.23/297.03 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 897.23/297.03 following reason: 897.23/297.03 897.23/297.03 The processor is inapplicable, reason: 897.23/297.03 Processor only applicable for innermost runtime complexity analysis 897.23/297.03 897.23/297.03 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 897.23/297.03 to the following reason: 897.23/297.03 897.23/297.03 The processor is inapplicable, reason: 897.23/297.03 Processor only applicable for innermost runtime complexity analysis 897.23/297.03 897.23/297.03 897.23/297.03 897.23/297.03 3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to 897.23/297.03 the following reason: 897.23/297.03 897.23/297.03 We add the following weak dependency pairs: 897.23/297.03 897.23/297.03 Strict DPs: 897.23/297.03 { f^#(X, n__g(X), Y) -> 897.23/297.03 c_1(f^#(activate(Y), activate(Y), activate(Y))) 897.23/297.03 , activate^#(X) -> c_2(X) 897.23/297.03 , activate^#(n__g(X)) -> c_3(g^#(X)) 897.23/297.03 , g^#(X) -> c_4(X) 897.23/297.03 , g^#(b()) -> c_5() 897.23/297.03 , b^#() -> c_6() } 897.23/297.03 897.23/297.03 and mark the set of starting terms. 897.23/297.03 897.23/297.03 We are left with following problem, upon which TcT provides the 897.23/297.03 certificate MAYBE. 897.23/297.03 897.23/297.03 Strict DPs: 897.23/297.03 { f^#(X, n__g(X), Y) -> 897.23/297.03 c_1(f^#(activate(Y), activate(Y), activate(Y))) 897.23/297.03 , activate^#(X) -> c_2(X) 897.23/297.03 , activate^#(n__g(X)) -> c_3(g^#(X)) 897.23/297.03 , g^#(X) -> c_4(X) 897.23/297.03 , g^#(b()) -> c_5() 897.23/297.03 , b^#() -> c_6() } 897.23/297.03 Strict Trs: 897.23/297.03 { f(X, n__g(X), Y) -> f(activate(Y), activate(Y), activate(Y)) 897.23/297.03 , activate(X) -> X 897.23/297.03 , activate(n__g(X)) -> g(X) 897.23/297.03 , g(X) -> n__g(X) 897.23/297.03 , g(b()) -> c() 897.23/297.03 , b() -> c() } 897.23/297.03 Obligation: 897.23/297.03 runtime complexity 897.23/297.03 Answer: 897.23/297.03 MAYBE 897.23/297.03 897.23/297.03 We estimate the number of application of {5,6} by applications of 897.23/297.03 Pre({5,6}) = {2,3,4}. Here rules are labeled as follows: 897.23/297.03 897.23/297.03 DPs: 897.23/297.03 { 1: f^#(X, n__g(X), Y) -> 897.23/297.03 c_1(f^#(activate(Y), activate(Y), activate(Y))) 897.23/297.03 , 2: activate^#(X) -> c_2(X) 897.23/297.03 , 3: activate^#(n__g(X)) -> c_3(g^#(X)) 897.23/297.03 , 4: g^#(X) -> c_4(X) 897.23/297.03 , 5: g^#(b()) -> c_5() 897.23/297.03 , 6: b^#() -> c_6() } 897.23/297.03 897.23/297.03 We are left with following problem, upon which TcT provides the 897.23/297.03 certificate MAYBE. 897.23/297.03 897.23/297.03 Strict DPs: 897.23/297.03 { f^#(X, n__g(X), Y) -> 897.23/297.03 c_1(f^#(activate(Y), activate(Y), activate(Y))) 897.23/297.03 , activate^#(X) -> c_2(X) 897.23/297.03 , activate^#(n__g(X)) -> c_3(g^#(X)) 897.23/297.03 , g^#(X) -> c_4(X) } 897.23/297.03 Strict Trs: 897.23/297.03 { f(X, n__g(X), Y) -> f(activate(Y), activate(Y), activate(Y)) 897.23/297.03 , activate(X) -> X 897.23/297.03 , activate(n__g(X)) -> g(X) 897.23/297.03 , g(X) -> n__g(X) 897.23/297.03 , g(b()) -> c() 897.23/297.03 , b() -> c() } 897.23/297.03 Weak DPs: 897.23/297.03 { g^#(b()) -> c_5() 897.23/297.03 , b^#() -> c_6() } 897.23/297.03 Obligation: 897.23/297.03 runtime complexity 897.23/297.03 Answer: 897.23/297.03 MAYBE 897.23/297.03 897.23/297.03 Empty strict component of the problem is NOT empty. 897.23/297.03 897.23/297.03 897.23/297.03 Arrrr.. 897.76/297.57 EOF