/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:
 active(c()) -> mark(f(g(c())))
 active(f(g(X))) -> mark(g(X))
 mark(c()) -> active(c())
 mark(f(X)) -> active(f(X))
 mark(g(X)) -> active(g(X))
 f(mark(X)) -> f(X)
 f(active(X)) -> f(X)
 g(mark(X)) -> g(X)
 g(active(X)) -> g(X)

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