/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

Problem:
 f(n__b(),X,n__c()) -> f(X,c(),X)
 c() -> b()
 b() -> n__b()
 c() -> n__c()
 activate(n__b()) -> b()
 activate(n__c()) -> c()
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [activate](x0) = x0 + 5,
   
   [b] = 3,
   
   [c] = 3,
   
   [f](x0, x1, x2) = x0 + 6x1 + 5x2 + 1,
   
   [n__c] = 3,
   
   [n__b] = 3
  orientation:
   f(n__b(),X,n__c()) = 6X + 19 >= 6X + 19 = f(X,c(),X)
   
   c() = 3 >= 3 = b()
   
   b() = 3 >= 3 = n__b()
   
   c() = 3 >= 3 = n__c()
   
   activate(n__b()) = 8 >= 3 = b()
   
   activate(n__c()) = 8 >= 3 = c()
   
   activate(X) = X + 5 >= X = X
  problem:
   f(n__b(),X,n__c()) -> f(X,c(),X)
   c() -> b()
   b() -> n__b()
   c() -> n__c()
  Unfolding Processor:
   loop length: 4
   terms:
    f(c(),c(),c())
    f(c(),c(),n__c())
    f(b(),c(),n__c())
    f(n__b(),c(),n__c())
   context: []
   substitution:
    
   Qed