/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:
 r(e(x1)) -> w(r(x1))
 i(t(x1)) -> e(r(x1))
 e(w(x1)) -> r(i(x1))
 t(e(x1)) -> r(e(x1))
 w(r(x1)) -> i(t(x1))
 e(r(x1)) -> e(w(x1))
 r(i(t(e(r(x1))))) -> e(w(r(i(t(e(x1))))))

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [i](x0) = x0,
   
   [t](x0) = x0 + 3,
   
   [w](x0) = x0 + 1,
   
   [r](x0) = x0 + 2,
   
   [e](x0) = x0 + 1
  orientation:
   r(e(x1)) = x1 + 3 >= x1 + 3 = w(r(x1))
   
   i(t(x1)) = x1 + 3 >= x1 + 3 = e(r(x1))
   
   e(w(x1)) = x1 + 2 >= x1 + 2 = r(i(x1))
   
   t(e(x1)) = x1 + 4 >= x1 + 3 = r(e(x1))
   
   w(r(x1)) = x1 + 3 >= x1 + 3 = i(t(x1))
   
   e(r(x1)) = x1 + 3 >= x1 + 2 = e(w(x1))
   
   r(i(t(e(r(x1))))) = x1 + 8 >= x1 + 8 = e(w(r(i(t(e(x1))))))
  problem:
   r(e(x1)) -> w(r(x1))
   i(t(x1)) -> e(r(x1))
   e(w(x1)) -> r(i(x1))
   w(r(x1)) -> i(t(x1))
   r(i(t(e(r(x1))))) -> e(w(r(i(t(e(x1))))))
  String Reversal Processor:
   e(r(x1)) -> r(w(x1))
   t(i(x1)) -> r(e(x1))
   w(e(x1)) -> i(r(x1))
   r(w(x1)) -> t(i(x1))
   r(e(t(i(r(x1))))) -> e(t(i(r(w(e(x1))))))
   Matrix Interpretation Processor: dim=3
    
    interpretation:
               [1 0 0]  
     [i](x0) = [0 0 0]x0
               [0 1 0]  ,
     
               [1 0 1]     [0]
     [t](x0) = [0 0 0]x0 + [1]
               [0 0 0]     [0],
     
               [1 1 0]     [0]
     [w](x0) = [0 0 0]x0 + [0]
               [0 0 0]     [1],
     
               [1 1 0]     [0]
     [r](x0) = [0 0 0]x0 + [1]
               [0 0 0]     [0],
     
               [1 0 0]  
     [e](x0) = [0 1 0]x0
               [0 0 0]  
    orientation:
                [1 1 0]     [0]    [1 1 0]     [0]           
     e(r(x1)) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = r(w(x1))
                [0 0 0]     [0]    [0 0 0]     [0]           
     
                [1 1 0]     [0]    [1 1 0]     [0]           
     t(i(x1)) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = r(e(x1))
                [0 0 0]     [0]    [0 0 0]     [0]           
     
                [1 1 0]     [0]    [1 1 0]     [0]           
     w(e(x1)) = [0 0 0]x1 + [0] >= [0 0 0]x1 + [0] = i(r(x1))
                [0 0 0]     [1]    [0 0 0]     [1]           
     
                [1 1 0]     [0]    [1 1 0]     [0]           
     r(w(x1)) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = t(i(x1))
                [0 0 0]     [0]    [0 0 0]     [0]           
     
                         [1 1 0]     [2]    [1 1 0]     [1]                       
     r(e(t(i(r(x1))))) = [0 0 0]x1 + [1] >= [0 0 0]x1 + [1] = e(t(i(r(w(e(x1))))))
                         [0 0 0]     [0]    [0 0 0]     [0]                       
    problem:
     e(r(x1)) -> r(w(x1))
     t(i(x1)) -> r(e(x1))
     w(e(x1)) -> i(r(x1))
     r(w(x1)) -> t(i(x1))
    Bounds Processor:
     bound: 2
     enrichment: match
     automaton:
      final states: {8,6,4,1}
      transitions:
       t1(20) -> 21*
       i1(19) -> 20*
       r1(11) -> 12*
       e1(10) -> 11*
       r2(23) -> 24*
       e2(22) -> 23*
       f50() -> 2*
       r0(5) -> 4*
       r0(2) -> 7*
       r0(3) -> 1*
       w0(2) -> 3*
       e0(2) -> 5*
       i0(7) -> 6*
       i0(2) -> 9*
       t0(9) -> 8*
       1 -> 23,5,11
       2 -> 19,10
       6 -> 3*
       8 -> 7*
       12 -> 8*
       19 -> 22*
       21 -> 1*
       24 -> 21,1
     problem:
      
     Qed