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