/export/starexec/sandbox2/solver/bin/starexec_run_ttt2 /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


YES

Problem:
 f(f(X)) -> c(n__f(n__g(n__f(X))))
 c(X) -> d(activate(X))
 h(X) -> c(n__d(X))
 f(X) -> n__f(X)
 g(X) -> n__g(X)
 d(X) -> n__d(X)
 activate(n__f(X)) -> f(activate(X))
 activate(n__g(X)) -> g(X)
 activate(n__d(X)) -> d(X)
 activate(X) -> X

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [activate](x0) = x0,
   
   [g](x0) = x0,
   
   [n__f](x0) = 4x0 + 4,
   
   [c](x0) = x0,
   
   [d](x0) = x0,
   
   [f](x0) = 4x0 + 4,
   
   [n__d](x0) = x0,
   
   [h](x0) = 4x0 + 1,
   
   [n__g](x0) = x0
  orientation:
   f(f(X)) = 16X + 20 >= 16X + 20 = c(n__f(n__g(n__f(X))))
   
   c(X) = X >= X = d(activate(X))
   
   h(X) = 4X + 1 >= X = c(n__d(X))
   
   f(X) = 4X + 4 >= 4X + 4 = n__f(X)
   
   g(X) = X >= X = n__g(X)
   
   d(X) = X >= X = n__d(X)
   
   activate(n__f(X)) = 4X + 4 >= 4X + 4 = f(activate(X))
   
   activate(n__g(X)) = X >= X = g(X)
   
   activate(n__d(X)) = X >= X = d(X)
   
   activate(X) = X >= X = X
  problem:
   f(f(X)) -> c(n__f(n__g(n__f(X))))
   c(X) -> d(activate(X))
   f(X) -> n__f(X)
   g(X) -> n__g(X)
   d(X) -> n__d(X)
   activate(n__f(X)) -> f(activate(X))
   activate(n__g(X)) -> g(X)
   activate(n__d(X)) -> d(X)
   activate(X) -> X
  Matrix Interpretation Processor: dim=3
   
   interpretation:
                       
    [activate](x0) = x0
                       ,
    
              [1 0 0]  
    [g](x0) = [0 0 0]x0
              [0 0 0]  ,
    
                 [1 1 1]     [0]
    [n__f](x0) = [0 0 0]x0 + [1]
                 [1 0 0]     [1],
    
              [1 0 0]     [1]
    [c](x0) = [0 0 0]x0 + [1]
              [0 0 0]     [0],
    
              [1 0 0]     [0]
    [d](x0) = [0 0 0]x0 + [1]
              [0 0 0]     [0],
    
              [1 1 1]     [0]
    [f](x0) = [0 0 0]x0 + [1]
              [1 0 0]     [1],
    
                 [1 0 0]     [0]
    [n__d](x0) = [0 0 0]x0 + [1]
                 [0 0 0]     [0],
    
                 [1 0 0]  
    [n__g](x0) = [0 0 0]x0
                 [0 0 0]  
   orientation:
              [2 1 1]    [2]    [1 1 1]    [1]                         
    f(f(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = c(n__f(n__g(n__f(X))))
              [1 1 1]    [1]    [0 0 0]    [0]                         
    
           [1 0 0]    [1]    [1 0 0]    [0]                 
    c(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = d(activate(X))
           [0 0 0]    [0]    [0 0 0]    [0]                 
    
           [1 1 1]    [0]    [1 1 1]    [0]          
    f(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = n__f(X)
           [1 0 0]    [1]    [1 0 0]    [1]          
    
           [1 0 0]     [1 0 0]           
    g(X) = [0 0 0]X >= [0 0 0]X = n__g(X)
           [0 0 0]     [0 0 0]           
    
           [1 0 0]    [0]    [1 0 0]    [0]          
    d(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = n__d(X)
           [0 0 0]    [0]    [0 0 0]    [0]          
    
                        [1 1 1]    [0]    [1 1 1]    [0]                 
    activate(n__f(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = f(activate(X))
                        [1 0 0]    [1]    [1 0 0]    [1]                 
    
                        [1 0 0]     [1 0 0]        
    activate(n__g(X)) = [0 0 0]X >= [0 0 0]X = g(X)
                        [0 0 0]     [0 0 0]        
    
                        [1 0 0]    [0]    [1 0 0]    [0]       
    activate(n__d(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = d(X)
                        [0 0 0]    [0]    [0 0 0]    [0]       
    
                            
    activate(X) = X >= X = X
                            
   problem:
    f(X) -> n__f(X)
    g(X) -> n__g(X)
    d(X) -> n__d(X)
    activate(n__f(X)) -> f(activate(X))
    activate(n__g(X)) -> g(X)
    activate(n__d(X)) -> d(X)
    activate(X) -> X
   KBO Processor:
    weight function:
     w0 = 1
     w(g) = w(n__d) = w(d) = w(n__g) = w(n__f) = w(f) = 1
     w(activate) = 0
    precedence:
     activate > d > n__d > f > n__f > g > n__g
    problem:
     
    Qed