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