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