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


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


YES

Problem:
 f(f(a())) -> c(n__f(g(f(a()))))
 f(X) -> n__f(X)
 activate(n__f(X)) -> f(X)
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=3
  
  interpretation:
                         [1]
   [activate](x0) = x0 + [0]
                         [0],
   
             [1 0 0]  
   [c](x0) = [0 0 0]x0
             [0 0 0]  ,
   
                [1 0 1]  
   [n__f](x0) = [0 0 0]x0
                [0 1 1]  ,
   
             [1 0 0]  
   [g](x0) = [0 0 0]x0
             [0 0 0]  ,
   
             [1 0 1]  
   [f](x0) = [0 0 0]x0
             [0 1 1]  ,
   
         [0]
   [a] = [1]
         [0]
  orientation:
               [1]    [0]                     
   f(f(a())) = [0] >= [0] = c(n__f(g(f(a()))))
               [1]    [0]                     
   
          [1 0 1]     [1 0 1]           
   f(X) = [0 0 0]X >= [0 0 0]X = n__f(X)
          [0 1 1]     [0 1 1]           
   
                       [1 0 1]    [1]    [1 0 1]        
   activate(n__f(X)) = [0 0 0]X + [0] >= [0 0 0]X = f(X)
                       [0 1 1]    [0]    [0 1 1]        
   
                     [1]         
   activate(X) = X + [0] >= X = X
                     [0]         
  problem:
   f(X) -> n__f(X)
  Matrix Interpretation Processor: dim=3
   
   interpretation:
                 [1 0 0]  
    [n__f](x0) = [0 0 0]x0
                 [0 0 0]  ,
    
              [1 0 0]     [1]
    [f](x0) = [0 0 0]x0 + [0]
              [0 0 1]     [0]
   orientation:
           [1 0 0]    [1]    [1 0 0]           
    f(X) = [0 0 0]X + [0] >= [0 0 0]X = n__f(X)
           [0 0 1]    [0]    [0 0 0]           
   problem:
    
   Qed