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