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