/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:
 strict:
  o(l(x1)) -> r(x1)
  n(l(o(x1))) -> r(o(x1))
  L(l(o(x1))) -> L(r(o(x1)))
  r(o(x1)) -> l(x1)
  o(r(n(x1))) -> o(l(x1))
  o(r(R(x1))) -> o(l(R(x1)))
 weak:
  L(x1) -> L(n(x1))
  R(x1) -> n(R(x1))

Proof:
 Arctic Interpretation Processor:
  dimension: 1
  interpretation:
   [R](x0) = 4x0,
   
   [L](x0) = x0,
   
   [n](x0) = x0,
   
   [r](x0) = x0,
   
   [o](x0) = 1x0,
   
   [l](x0) = x0
  orientation:
   o(l(x1)) = 1x1 >= x1 = r(x1)
   
   n(l(o(x1))) = 1x1 >= 1x1 = r(o(x1))
   
   L(l(o(x1))) = 1x1 >= 1x1 = L(r(o(x1)))
   
   r(o(x1)) = 1x1 >= x1 = l(x1)
   
   o(r(n(x1))) = 1x1 >= 1x1 = o(l(x1))
   
   o(r(R(x1))) = 5x1 >= 5x1 = o(l(R(x1)))
   
   L(x1) = x1 >= x1 = L(n(x1))
   
   R(x1) = 4x1 >= 4x1 = n(R(x1))
  problem:
   strict:
    n(l(o(x1))) -> r(o(x1))
    L(l(o(x1))) -> L(r(o(x1)))
    o(r(n(x1))) -> o(l(x1))
    o(r(R(x1))) -> o(l(R(x1)))
   weak:
    L(x1) -> L(n(x1))
    R(x1) -> n(R(x1))
  String Reversal Processor:
   strict:
    o(l(n(x1))) -> o(r(x1))
    o(l(L(x1))) -> o(r(L(x1)))
    n(r(o(x1))) -> l(o(x1))
    R(r(o(x1))) -> R(l(o(x1)))
   weak:
    L(x1) -> n(L(x1))
    R(x1) -> R(n(x1))
   Matrix Interpretation Processor: dim=2
    
    interpretation:
               [1 2]  
     [R](x0) = [0 2]x0,
     
               [1 0]  
     [L](x0) = [1 0]x0,
     
               [1 0]  
     [n](x0) = [0 0]x0,
     
               [2 0]     [0]
     [r](x0) = [0 0]x0 + [1],
     
               [1 0]  
     [o](x0) = [0 0]x0,
     
               [2 0]  
     [l](x0) = [0 0]x0
    orientation:
                   [2 0]      [2 0]             
     o(l(n(x1))) = [0 0]x1 >= [0 0]x1 = o(r(x1))
     
                   [2 0]      [2 0]                
     o(l(L(x1))) = [0 0]x1 >= [0 0]x1 = o(r(L(x1)))
     
                   [2 0]      [2 0]             
     n(r(o(x1))) = [0 0]x1 >= [0 0]x1 = l(o(x1))
     
                   [2 0]     [2]    [2 0]                
     R(r(o(x1))) = [0 0]x1 + [2] >= [0 0]x1 = R(l(o(x1)))
     
             [1 0]      [1 0]             
     L(x1) = [1 0]x1 >= [0 0]x1 = n(L(x1))
     
             [1 2]      [1 0]             
     R(x1) = [0 2]x1 >= [0 0]x1 = R(n(x1))
    problem:
     strict:
      o(l(n(x1))) -> o(r(x1))
      o(l(L(x1))) -> o(r(L(x1)))
      n(r(o(x1))) -> l(o(x1))
     weak:
      L(x1) -> n(L(x1))
      R(x1) -> R(n(x1))
    Bounds Processor:
     bound: 1
     enrichment: match-rt
     automaton:
      final states: {7}
      transitions:
       o1(12) -> 13*
       o1(88) -> 89*
       r1(59) -> 60*
       r1(11) -> 12*
       L1(42) -> 43*
       l1(36) -> 37*
       R1(66) -> 67*
       n1(65) -> 66*
       n1(116) -> 117*
       n1(43) -> 44*
       o0(7) -> 7*
       l0(7) -> 7*
       n0(7) -> 7*
       r0(7) -> 7*
       L0(7) -> 7*
       R0(7) -> 7*
       7 -> 88,65,42,11
       13 -> 89,36,7
       37 -> 66,7
       43 -> 59*
       44 -> 43,7
       60 -> 12*
       66 -> 116*
       67 -> 7*
       89 -> 36*
       117 -> 66*
     problem:
      strict:
       o(l(L(x1))) -> o(r(L(x1)))
       n(r(o(x1))) -> l(o(x1))
      weak:
       L(x1) -> n(L(x1))
       R(x1) -> R(n(x1))
     Matrix Interpretation Processor: dim=2
      
      interpretation:
                 [1 0]     [1]
       [R](x0) = [0 0]x0 + [2],
       
                 [1 0]  
       [L](x0) = [0 0]x0,
       
                   
       [n](x0) = x0,
       
                 [1 1]     [0]
       [r](x0) = [1 0]x0 + [2],
       
                 [2 0]     [1]
       [o](x0) = [0 0]x0 + [1],
       
                 [1 0]  
       [l](x0) = [1 2]x0
      orientation:
                     [2 0]     [1]    [2 0]     [1]              
       o(l(L(x1))) = [0 0]x1 + [1] >= [0 0]x1 + [1] = o(r(L(x1)))
       
                     [2 0]     [2]    [2 0]     [1]           
       n(r(o(x1))) = [2 0]x1 + [3] >= [2 0]x1 + [3] = l(o(x1))
       
               [1 0]      [1 0]             
       L(x1) = [0 0]x1 >= [0 0]x1 = n(L(x1))
       
               [1 0]     [1]    [1 0]     [1]           
       R(x1) = [0 0]x1 + [2] >= [0 0]x1 + [2] = R(n(x1))
      problem:
       strict:
        o(l(L(x1))) -> o(r(L(x1)))
       weak:
        L(x1) -> n(L(x1))
        R(x1) -> R(n(x1))
      Arctic Interpretation Processor:
       dimension: 1
       interpretation:
        [R](x0) = 8x0,
        
        [L](x0) = 8x0,
        
        [n](x0) = x0,
        
        [r](x0) = x0,
        
        [o](x0) = x0,
        
        [l](x0) = 8x0
       orientation:
        o(l(L(x1))) = 16x1 >= 8x1 = o(r(L(x1)))
        
        L(x1) = 8x1 >= 8x1 = n(L(x1))
        
        R(x1) = 8x1 >= 8x1 = R(n(x1))
       problem:
        strict:
         
        weak:
         L(x1) -> n(L(x1))
         R(x1) -> R(n(x1))
       Qed