/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:
 a__g(X) -> a__h(X)
 a__c() -> d()
 a__h(d()) -> a__g(c())
 mark(g(X)) -> a__g(X)
 mark(h(X)) -> a__h(X)
 mark(c()) -> a__c()
 mark(d()) -> d()
 a__g(X) -> g(X)
 a__h(X) -> h(X)
 a__c() -> c()

Proof:
 Matrix Interpretation Processor: dim=3
  
  interpretation:
             [1 0 1]     [0]
   [h](x0) = [0 0 0]x0 + [1]
             [0 0 0]     [1],
   
                [1 0 0]     [1]
   [mark](x0) = [0 1 0]x0 + [0]
                [0 0 0]     [1],
   
             [1 0 1]     [0]
   [g](x0) = [0 0 0]x0 + [1]
             [0 0 0]     [1],
   
         [0]
   [c] = [0]
         [0],
   
         [0]
   [d] = [0]
         [1],
   
            [1]
   [a__c] = [0]
            [1],
   
                [1 0 1]     [0]
   [a__h](x0) = [0 0 0]x0 + [1]
                [0 0 0]     [1],
   
                [1 0 1]     [1]
   [a__g](x0) = [0 0 0]x0 + [1]
                [0 0 0]     [1]
  orientation:
             [1 0 1]    [1]    [1 0 1]    [0]          
   a__g(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = a__h(X)
             [0 0 0]    [1]    [0 0 0]    [1]          
   
            [1]    [0]      
   a__c() = [0] >= [0] = d()
            [1]    [1]      
   
               [1]    [1]            
   a__h(d()) = [1] >= [1] = a__g(c())
               [1]    [1]            
   
                [1 0 1]    [1]    [1 0 1]    [1]          
   mark(g(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = a__g(X)
                [0 0 0]    [1]    [0 0 0]    [1]          
   
                [1 0 1]    [1]    [1 0 1]    [0]          
   mark(h(X)) = [0 0 0]X + [1] >= [0 0 0]X + [1] = a__h(X)
                [0 0 0]    [1]    [0 0 0]    [1]          
   
               [1]    [1]         
   mark(c()) = [0] >= [0] = a__c()
               [1]    [1]         
   
               [1]    [0]      
   mark(d()) = [0] >= [0] = d()
               [1]    [1]      
   
             [1 0 1]    [1]    [1 0 1]    [0]       
   a__g(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = g(X)
             [0 0 0]    [1]    [0 0 0]    [1]       
   
             [1 0 1]    [0]    [1 0 1]    [0]       
   a__h(X) = [0 0 0]X + [1] >= [0 0 0]X + [1] = h(X)
             [0 0 0]    [1]    [0 0 0]    [1]       
   
            [1]    [0]      
   a__c() = [0] >= [0] = c()
            [1]    [0]      
  problem:
   a__h(d()) -> a__g(c())
   mark(g(X)) -> a__g(X)
   mark(c()) -> a__c()
   a__h(X) -> h(X)
  Matrix Interpretation Processor: dim=3
   
   interpretation:
              [1 0 0]  
    [h](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 0]  
    [g](x0) = [0 0 0]x0
              [0 0 0]  ,
    
          [0]
    [c] = [0]
          [0],
    
          [0]
    [d] = [0]
          [0],
    
             [0]
    [a__c] = [0]
             [0],
    
                 [1 0 0]     [1]
    [a__h](x0) = [0 0 0]x0 + [0]
                 [0 0 0]     [0],
    
                 [1 0 0]  
    [a__g](x0) = [0 0 0]x0
                 [0 0 0]  
   orientation:
                [1]    [0]            
    a__h(d()) = [0] >= [0] = a__g(c())
                [0]    [0]            
    
                 [1 0 0]    [1]    [1 0 0]           
    mark(g(X)) = [0 0 0]X + [0] >= [0 0 0]X = a__g(X)
                 [0 0 0]    [0]    [0 0 0]           
    
                [1]    [0]         
    mark(c()) = [0] >= [0] = a__c()
                [0]    [0]         
    
              [1 0 0]    [1]    [1 0 0]        
    a__h(X) = [0 0 0]X + [0] >= [0 0 0]X = h(X)
              [0 0 0]    [0]    [0 0 0]        
   problem:
    
   Qed