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