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