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