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