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