MAYBE
327.83/106.74	MAYBE
327.83/106.74	
327.83/106.74	We are left with following problem, upon which TcT provides the
327.83/106.74	certificate MAYBE.
327.83/106.74	
327.83/106.74	Strict Trs:
327.83/106.74	  { a(x1) -> b(c(x1))
327.83/106.74	  , b(b(x1)) -> x1
327.83/106.74	  , c(c(b(x1))) -> b(c(a(c(x1)))) }
327.83/106.74	Obligation:
327.83/106.74	  derivational complexity
327.83/106.74	Answer:
327.83/106.74	  MAYBE
327.83/106.74	
327.83/106.74	None of the processors succeeded.
327.83/106.74	
327.83/106.74	Details of failed attempt(s):
327.83/106.74	-----------------------------
327.83/106.74	1) 'Inspecting Problem... (timeout of 297 seconds)' failed due to
327.83/106.74	   the following reason:
327.83/106.74	   
327.83/106.74	   The weightgap principle applies (using the following nonconstant
327.83/106.74	   growth matrix-interpretation)
327.83/106.74	   
327.83/106.74	   TcT has computed the following triangular matrix interpretation.
327.83/106.74	   Note that the diagonal of the component-wise maxima of
327.83/106.74	   interpretation-entries contains no more than 1 non-zero entries.
327.83/106.74	   
327.83/106.74	     [a](x1) = [1] x1 + [1]
327.83/106.74	                           
327.83/106.74	     [b](x1) = [1] x1 + [0]
327.83/106.74	                           
327.83/106.74	     [c](x1) = [1] x1 + [0]
327.83/106.74	   
327.83/106.74	   The order satisfies the following ordering constraints:
327.83/106.74	   
327.83/106.74	           [a(x1)] =  [1] x1 + [1]    
327.83/106.74	                   >  [1] x1 + [0]    
327.83/106.74	                   =  [b(c(x1))]      
327.83/106.74	                                      
327.83/106.74	        [b(b(x1))] =  [1] x1 + [0]    
327.83/106.74	                   >= [1] x1 + [0]    
327.83/106.74	                   =  [x1]            
327.83/106.74	                                      
327.83/106.74	     [c(c(b(x1)))] =  [1] x1 + [0]    
327.83/106.74	                   ?  [1] x1 + [1]    
327.83/106.74	                   =  [b(c(a(c(x1))))]
327.83/106.74	                                      
327.83/106.74	   
327.83/106.74	   Further, it can be verified that all rules not oriented are covered by the weightgap condition.
327.83/106.74	   
327.83/106.74	   We are left with following problem, upon which TcT provides the
327.83/106.74	   certificate MAYBE.
327.83/106.74	   
327.83/106.74	   Strict Trs:
327.83/106.74	     { b(b(x1)) -> x1
327.83/106.74	     , c(c(b(x1))) -> b(c(a(c(x1)))) }
327.83/106.74	   Weak Trs: { a(x1) -> b(c(x1)) }
327.83/106.74	   Obligation:
327.83/106.74	     derivational complexity
327.83/106.74	   Answer:
327.83/106.74	     MAYBE
327.83/106.74	   
327.83/106.74	   The weightgap principle applies (using the following nonconstant
327.83/106.74	   growth matrix-interpretation)
327.83/106.74	   
327.83/106.74	   TcT has computed the following triangular matrix interpretation.
327.83/106.74	   Note that the diagonal of the component-wise maxima of
327.83/106.74	   interpretation-entries contains no more than 1 non-zero entries.
327.83/106.74	   
327.83/106.74	     [a](x1) = [1] x1 + [2]
327.83/106.74	                           
327.83/106.74	     [b](x1) = [1] x1 + [1]
327.83/106.74	                           
327.83/106.74	     [c](x1) = [1] x1 + [0]
327.83/106.74	   
327.83/106.74	   The order satisfies the following ordering constraints:
327.83/106.74	   
327.83/106.74	           [a(x1)] = [1] x1 + [2]    
327.83/106.74	                   > [1] x1 + [1]    
327.83/106.74	                   = [b(c(x1))]      
327.83/106.74	                                     
327.83/106.74	        [b(b(x1))] = [1] x1 + [2]    
327.83/106.74	                   > [1] x1 + [0]    
327.83/106.74	                   = [x1]            
327.83/106.74	                                     
327.83/106.74	     [c(c(b(x1)))] = [1] x1 + [1]    
327.83/106.74	                   ? [1] x1 + [3]    
327.83/106.74	                   = [b(c(a(c(x1))))]
327.83/106.74	                                     
327.83/106.74	   
327.83/106.74	   Further, it can be verified that all rules not oriented are covered by the weightgap condition.
327.83/106.74	   
327.83/106.74	   We are left with following problem, upon which TcT provides the
327.83/106.74	   certificate MAYBE.
327.83/106.74	   
327.83/106.74	   Strict Trs: { c(c(b(x1))) -> b(c(a(c(x1)))) }
327.83/106.74	   Weak Trs:
327.83/106.74	     { a(x1) -> b(c(x1))
327.83/106.74	     , b(b(x1)) -> x1 }
327.83/106.74	   Obligation:
327.83/106.74	     derivational complexity
327.83/106.74	   Answer:
327.83/106.74	     MAYBE
327.83/106.74	   
327.83/106.74	   None of the processors succeeded.
327.83/106.74	   
327.83/106.74	   Details of failed attempt(s):
327.83/106.74	   -----------------------------
327.83/106.74	   1) 'empty' failed due to the following reason:
327.83/106.74	      
327.83/106.74	      Empty strict component of the problem is NOT empty.
327.83/106.74	   
327.83/106.74	   2) 'Fastest' failed due to the following reason:
327.83/106.74	      
327.83/106.74	      None of the processors succeeded.
327.83/106.74	      
327.83/106.74	      Details of failed attempt(s):
327.83/106.74	      -----------------------------
327.83/106.74	      1) 'Fastest' failed due to the following reason:
327.83/106.74	         
327.83/106.74	         None of the processors succeeded.
327.83/106.74	         
327.83/106.74	         Details of failed attempt(s):
327.83/106.74	         -----------------------------
327.83/106.74	         1) 'matrix interpretation of dimension 6' failed due to the
327.83/106.74	            following reason:
327.83/106.74	            
327.83/106.74	            The input cannot be shown compatible
327.83/106.74	         
327.83/106.74	         2) 'matrix interpretation of dimension 5' failed due to the
327.83/106.74	            following reason:
327.83/106.74	            
327.83/106.74	            The input cannot be shown compatible
327.83/106.74	         
327.83/106.74	         3) 'matrix interpretation of dimension 4' failed due to the
327.83/106.74	            following reason:
327.83/106.74	            
327.83/106.74	            The input cannot be shown compatible
327.83/106.74	         
327.83/106.74	         4) 'matrix interpretation of dimension 3' failed due to the
327.83/106.74	            following reason:
327.83/106.74	            
327.83/106.74	            The input cannot be shown compatible
327.83/106.74	         
327.83/106.74	         5) 'matrix interpretation of dimension 2' failed due to the
327.83/106.74	            following reason:
327.83/106.74	            
327.83/106.74	            The input cannot be shown compatible
327.83/106.74	         
327.83/106.74	         6) 'matrix interpretation of dimension 1' failed due to the
327.83/106.74	            following reason:
327.83/106.74	            
327.83/106.74	            The input cannot be shown compatible
327.83/106.74	         
327.83/106.74	      
327.83/106.74	      2) 'Fastest (timeout of 30 seconds)' failed due to the following
327.83/106.74	         reason:
327.83/106.74	         
327.83/106.74	         Computation stopped due to timeout after 30.0 seconds.
327.83/106.74	      
327.83/106.74	      3) 'iteProgress' failed due to the following reason:
327.83/106.74	         
327.83/106.74	         Fail
327.83/106.74	      
327.83/106.74	      4) 'bsearch-matrix' failed due to the following reason:
327.83/106.74	         
327.83/106.74	         The input cannot be shown compatible
327.83/106.74	      
327.83/106.74	   
327.83/106.74	
327.83/106.74	2) 'Fastest (timeout of 60 seconds)' failed due to the following
327.83/106.74	   reason:
327.83/106.74	   
327.83/106.74	   Computation stopped due to timeout after 60.0 seconds.
327.83/106.74	
327.83/106.74	3) 'iteProgress (timeout of 297 seconds)' failed due to the
327.83/106.74	   following reason:
327.83/106.74	   
327.83/106.74	   Fail
327.83/106.74	
327.83/106.74	4) 'bsearch-matrix (timeout of 297 seconds)' failed due to the
327.83/106.74	   following reason:
327.83/106.74	   
327.83/106.74	   The input cannot be shown compatible
327.83/106.74	
327.83/106.74	
327.83/106.74	Arrrr..
327.83/106.76	EOF