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