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