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