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