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