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


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


YES

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

Proof:
 Matrix Interpretation Processor: dim=3
  
  interpretation:
                    [1 0 1]     [1]
   [activate](x0) = [0 1 0]x0 + [0]
                    [0 0 1]     [0],
   
         [1]
   [b] = [0]
         [1],
   
            [0]
   [n__b] = [0]
            [1],
   
         [0]
   [a] = [0]
         [1],
   
                 [1 0 0]     [1 0 0]  
   [f](x0, x1) = [0 0 0]x0 + [0 0 0]x1
                 [0 0 0]     [0 0 0]  
  orientation:
            [2 0 0]     [0]                
   f(X,X) = [0 0 0]X >= [0] = f(a(),n__b())
            [0 0 0]     [0]                
   
         [1]    [0]      
   b() = [0] >= [0] = a()
         [1]    [1]      
   
         [1]    [0]         
   b() = [0] >= [0] = n__b()
         [1]    [1]         
   
                      [2]    [1]      
   activate(n__b()) = [0] >= [0] = b()
                      [1]    [1]      
   
                 [1 0 1]    [1]         
   activate(X) = [0 1 0]X + [0] >= X = X
                 [0 0 1]    [0]         
  problem:
   f(X,X) -> f(a(),n__b())
  DP Processor:
   DPs:
    f#(X,X) -> f#(a(),n__b())
   TRS:
    f(X,X) -> f(a(),n__b())
   EDG Processor:
    DPs:
     f#(X,X) -> f#(a(),n__b())
    TRS:
     f(X,X) -> f(a(),n__b())
    graph:
     
    SCC Processor:
     #sccs: 0
     #rules: 0
     #arcs: 0/1