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

Proof:
 Matrix Interpretation Processor: dim=3
  
  interpretation:
               [1 0 1]  
   [top](x0) = [0 0 0]x0
               [0 0 0]  ,
   
              [1 0 1]  
   [ok](x0) = [0 0 0]x0
              [0 1 0]  ,
   
                  [1 0 0]  
   [proper](x0) = [0 0 0]x0
                  [0 1 0]  ,
   
                [1 1 1]  
   [mark](x0) = [0 0 0]x0
                [0 0 0]  ,
   
             [1 1 1]  
   [f](x0) = [0 0 0]x0
             [0 0 0]  ,
   
             [1 0 0]  
   [g](x0) = [0 0 0]x0
             [0 0 0]  ,
   
                  [1 1 0]     [0]
   [active](x0) = [0 0 0]x0 + [1]
                  [0 0 0]     [0],
   
         [0]
   [c] = [1]
         [0]
  orientation:
                 [1]    [0]                  
   active(c()) = [1] >= [0] = mark(f(g(c())))
                 [0]    [0]                  
   
                     [1 0 0]    [0]    [1 0 0]              
   active(f(g(X))) = [0 0 0]X + [1] >= [0 0 0]X = mark(g(X))
                     [0 0 0]    [0]    [0 0 0]              
   
                 [0]    [0]          
   proper(c()) = [0] >= [0] = ok(c())
                 [1]    [1]          
   
                  [1 1 1]     [1 1 0]                
   proper(f(X)) = [0 0 0]X >= [0 0 0]X = f(proper(X))
                  [0 0 0]     [0 0 0]                
   
                  [1 0 0]     [1 0 0]                
   proper(g(X)) = [0 0 0]X >= [0 0 0]X = g(proper(X))
                  [0 0 0]     [0 0 0]                
   
              [1 1 1]     [1 1 1]            
   f(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(f(X))
              [0 0 0]     [0 0 0]            
   
              [1 0 1]     [1 0 0]            
   g(ok(X)) = [0 0 0]X >= [0 0 0]X = ok(g(X))
              [0 0 0]     [0 0 0]            
   
                  [1 1 1]     [1 1 0]                  
   top(mark(X)) = [0 0 0]X >= [0 0 0]X = top(proper(X))
                  [0 0 0]     [0 0 0]                  
   
                [1 1 1]     [1 1 0]                  
   top(ok(X)) = [0 0 0]X >= [0 0 0]X = top(active(X))
                [0 0 0]     [0 0 0]                  
  problem:
   active(f(g(X))) -> mark(g(X))
   proper(c()) -> ok(c())
   proper(f(X)) -> f(proper(X))
   proper(g(X)) -> g(proper(X))
   f(ok(X)) -> ok(f(X))
   g(ok(X)) -> ok(g(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [top](x0) = x0,
    
    [ok](x0) = x0,
    
    [proper](x0) = x0,
    
    [mark](x0) = 4x0,
    
    [f](x0) = 5x0,
    
    [g](x0) = x0 + 2,
    
    [active](x0) = x0,
    
    [c] = 0
   orientation:
    active(f(g(X))) = 5X + 10 >= 4X + 8 = mark(g(X))
    
    proper(c()) = 0 >= 0 = ok(c())
    
    proper(f(X)) = 5X >= 5X = f(proper(X))
    
    proper(g(X)) = X + 2 >= X + 2 = g(proper(X))
    
    f(ok(X)) = 5X >= 5X = ok(f(X))
    
    g(ok(X)) = X + 2 >= X + 2 = ok(g(X))
    
    top(mark(X)) = 4X >= X = top(proper(X))
    
    top(ok(X)) = X >= X = top(active(X))
   problem:
    proper(c()) -> ok(c())
    proper(f(X)) -> f(proper(X))
    proper(g(X)) -> g(proper(X))
    f(ok(X)) -> ok(f(X))
    g(ok(X)) -> ok(g(X))
    top(mark(X)) -> top(proper(X))
    top(ok(X)) -> top(active(X))
   Matrix Interpretation Processor: dim=1
    
    interpretation:
     [top](x0) = x0 + 5,
     
     [ok](x0) = 4x0 + 3,
     
     [proper](x0) = 4x0 + 3,
     
     [mark](x0) = 4x0 + 3,
     
     [f](x0) = 4x0 + 3,
     
     [g](x0) = 2x0 + 1,
     
     [active](x0) = 4x0 + 2,
     
     [c] = 0
    orientation:
     proper(c()) = 3 >= 3 = ok(c())
     
     proper(f(X)) = 16X + 15 >= 16X + 15 = f(proper(X))
     
     proper(g(X)) = 8X + 7 >= 8X + 7 = g(proper(X))
     
     f(ok(X)) = 16X + 15 >= 16X + 15 = ok(f(X))
     
     g(ok(X)) = 8X + 7 >= 8X + 7 = ok(g(X))
     
     top(mark(X)) = 4X + 8 >= 4X + 8 = top(proper(X))
     
     top(ok(X)) = 4X + 8 >= 4X + 7 = top(active(X))
    problem:
     proper(c()) -> ok(c())
     proper(f(X)) -> f(proper(X))
     proper(g(X)) -> g(proper(X))
     f(ok(X)) -> ok(f(X))
     g(ok(X)) -> ok(g(X))
     top(mark(X)) -> top(proper(X))
    Matrix Interpretation Processor: dim=3
     
     interpretation:
                  [1 0 0]  
      [top](x0) = [0 0 0]x0
                  [0 0 0]  ,
      
                   
      [ok](x0) = x0
                   ,
      
                     [1 1 1]  
      [proper](x0) = [0 1 1]x0
                     [0 0 1]  ,
      
                   [1 1 1]  
      [mark](x0) = [0 0 0]x0
                   [0 0 0]  ,
      
                     [0]
      [f](x0) = x0 + [1]
                     [0],
      
                     [0]
      [g](x0) = x0 + [0]
                     [1],
      
            [0]
      [c] = [1]
            [0]
     orientation:
                    [1]    [0]          
      proper(c()) = [1] >= [1] = ok(c())
                    [0]    [0]          
      
                     [1 1 1]    [1]    [1 1 1]    [0]               
      proper(f(X)) = [0 1 1]X + [1] >= [0 1 1]X + [1] = f(proper(X))
                     [0 0 1]    [0]    [0 0 1]    [0]               
      
                     [1 1 1]    [1]    [1 1 1]    [0]               
      proper(g(X)) = [0 1 1]X + [1] >= [0 1 1]X + [0] = g(proper(X))
                     [0 0 1]    [1]    [0 0 1]    [1]               
      
                     [0]        [0]           
      f(ok(X)) = X + [1] >= X + [1] = ok(f(X))
                     [0]        [0]           
      
                     [0]        [0]           
      g(ok(X)) = X + [0] >= X + [0] = ok(g(X))
                     [1]        [1]           
      
                     [1 1 1]     [1 1 1]                  
      top(mark(X)) = [0 0 0]X >= [0 0 0]X = top(proper(X))
                     [0 0 0]     [0 0 0]                  
     problem:
      f(ok(X)) -> ok(f(X))
      g(ok(X)) -> ok(g(X))
      top(mark(X)) -> top(proper(X))
     Matrix Interpretation Processor: dim=3
      
      interpretation:
                   [1 0 0]  
       [top](x0) = [0 0 0]x0
                   [0 0 0]  ,
       
                  [1 0 1]     [0]
       [ok](x0) = [1 0 1]x0 + [1]
                  [0 1 0]     [1],
       
                      [1 0 0]  
       [proper](x0) = [0 0 0]x0
                      [0 0 0]  ,
       
                    [1 0 0]     [1]
       [mark](x0) = [0 0 0]x0 + [0]
                    [0 0 0]     [0],
       
                 [1 0 1]  
       [f](x0) = [1 0 1]x0
                 [0 1 0]  ,
       
                 [1 0 1]  
       [g](x0) = [1 0 1]x0
                 [0 1 0]  
      orientation:
                  [1 1 1]    [1]    [1 1 1]    [0]           
       f(ok(X)) = [1 1 1]X + [1] >= [1 1 1]X + [1] = ok(f(X))
                  [1 0 1]    [1]    [1 0 1]    [1]           
       
                  [1 1 1]    [1]    [1 1 1]    [0]           
       g(ok(X)) = [1 1 1]X + [1] >= [1 1 1]X + [1] = ok(g(X))
                  [1 0 1]    [1]    [1 0 1]    [1]           
       
                      [1 0 0]    [1]    [1 0 0]                  
       top(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X = top(proper(X))
                      [0 0 0]    [0]    [0 0 0]                  
      problem:
       
      Qed