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