/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:
 f(a,empty()) -> g(a,empty())
 f(a,cons(x,k)) -> f(cons(x,a),k)
 g(empty(),d) -> d
 g(cons(x,k),d) -> g(k,cons(x,d))

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [cons](x0, x1) = x0 + x1,
   
   [g](x0, x1) = 4x0 + x1 + 1,
   
   [f](x0, x1) = 4x0 + 6x1,
   
   [empty] = 2
  orientation:
   f(a,empty()) = 4a + 12 >= 4a + 3 = g(a,empty())
   
   f(a,cons(x,k)) = 4a + 6k + 6x >= 4a + 6k + 4x = f(cons(x,a),k)
   
   g(empty(),d) = d + 9 >= d = d
   
   g(cons(x,k),d) = d + 4k + 4x + 1 >= d + 4k + x + 1 = g(k,cons(x,d))
  problem:
   f(a,cons(x,k)) -> f(cons(x,a),k)
   g(cons(x,k),d) -> g(k,cons(x,d))
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [cons](x0, x1) = 2x0 + x1 + 3,
    
    [g](x0, x1) = 7x0 + 4x1 + 4,
    
    [f](x0, x1) = 3x0 + 3x1 + 6
   orientation:
    f(a,cons(x,k)) = 3a + 3k + 6x + 15 >= 3a + 3k + 6x + 15 = f(cons(x,a),k)
    
    g(cons(x,k),d) = 4d + 7k + 14x + 25 >= 4d + 7k + 8x + 16 = g(k,cons(x,d))
   problem:
    f(a,cons(x,k)) -> f(cons(x,a),k)
   Matrix Interpretation Processor: dim=3
    
    interpretation:
                      [1 0 0]     [1 0 0]     [0]
     [cons](x0, x1) = [0 0 0]x0 + [0 0 0]x1 + [0]
                      [0 0 0]     [0 0 1]     [1],
     
                   [1 0 0]     [1 0 1]  
     [f](x0, x1) = [0 0 0]x0 + [0 0 0]x1
                   [0 0 0]     [0 0 0]  
    orientation:
                      [1 0 0]    [1 0 1]    [1 0 0]    [1]    [1 0 0]    [1 0 1]    [1 0 0]                  
     f(a,cons(x,k)) = [0 0 0]a + [0 0 0]k + [0 0 0]x + [0] >= [0 0 0]a + [0 0 0]k + [0 0 0]x = f(cons(x,a),k)
                      [0 0 0]    [0 0 0]    [0 0 0]    [0]    [0 0 0]    [0 0 0]    [0 0 0]                  
    problem:
     
    Qed