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