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