/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


YES

Problem:
 strict:
  n(s(x1)) -> s(x1)
  o(s(x1)) -> s(x1)
 weak:
  t(x1) -> t(c(n(x1)))
  c(n(x1)) -> n(c(x1))
  c(o(x1)) -> o(c(x1))
  c(o(x1)) -> o(x1)

Proof:
 Arctic Interpretation Processor:
  dimension: 1
  interpretation:
   [c](x0) = x0,
   
   [n](x0) = x0,
   
   [t](x0) = 1x0,
   
   [s](x0) = x0,
   
   [o](x0) = 7x0
  orientation:
   n(s(x1)) = x1 >= x1 = s(x1)
   
   o(s(x1)) = 7x1 >= x1 = s(x1)
   
   t(x1) = 1x1 >= 1x1 = t(c(n(x1)))
   
   c(n(x1)) = x1 >= x1 = n(c(x1))
   
   c(o(x1)) = 7x1 >= 7x1 = o(c(x1))
   
   c(o(x1)) = 7x1 >= 7x1 = o(x1)
  problem:
   strict:
    n(s(x1)) -> s(x1)
   weak:
    t(x1) -> t(c(n(x1)))
    c(n(x1)) -> n(c(x1))
    c(o(x1)) -> o(c(x1))
    c(o(x1)) -> o(x1)
  String Reversal Processor:
   strict:
    s(n(x1)) -> s(x1)
   weak:
    t(x1) -> n(c(t(x1)))
    n(c(x1)) -> c(n(x1))
    o(c(x1)) -> c(o(x1))
    o(c(x1)) -> o(x1)
   Matrix Interpretation Processor: dim=2
    
    interpretation:
               [1 0]  
     [c](x0) = [1 0]x0,
     
                    [0]
     [n](x0) = x0 + [1],
     
               [1 0]     [2]
     [t](x0) = [2 1]x0 + [3],
     
               [2 2]     [1]
     [s](x0) = [0 0]x0 + [0],
     
               [2 0]  
     [o](x0) = [2 0]x0
    orientation:
                [2 2]     [3]    [2 2]     [1]        
     s(n(x1)) = [0 0]x1 + [0] >= [0 0]x1 + [0] = s(x1)
     
             [1 0]     [2]    [1 0]     [2]              
     t(x1) = [2 1]x1 + [3] >= [1 0]x1 + [3] = n(c(t(x1)))
     
                [1 0]     [0]    [1 0]             
     n(c(x1)) = [1 0]x1 + [1] >= [1 0]x1 = c(n(x1))
     
                [2 0]      [2 0]             
     o(c(x1)) = [2 0]x1 >= [2 0]x1 = c(o(x1))
     
                [2 0]      [2 0]          
     o(c(x1)) = [2 0]x1 >= [2 0]x1 = o(x1)
    problem:
     strict:
      
     weak:
      t(x1) -> n(c(t(x1)))
      n(c(x1)) -> c(n(x1))
      o(c(x1)) -> c(o(x1))
      o(c(x1)) -> o(x1)
    Qed