/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /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:
   [L](x0) = 4x0,
   
   [o](x0) = 1x0,
   
   [n](x0) = x0,
   
   [R](x0) = x0,
   
   [l](x0) = x0,
   
   [r](x0) = x0
  orientation:
   o(l(x1)) = 1x1 >= x1 = r(x1)
   
   n(l(o(x1))) = 1x1 >= 1x1 = r(o(x1))
   
   L(l(o(x1))) = 5x1 >= 5x1 = L(r(o(x1)))
   
   r(o(x1)) = 1x1 >= x1 = l(x1)
   
   o(r(n(x1))) = 1x1 >= 1x1 = o(l(x1))
   
   o(r(R(x1))) = 1x1 >= 1x1 = o(l(R(x1)))
   
   L(x1) = 4x1 >= 4x1 = L(n(x1))
   
   R(x1) = x1 >= x1 = 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))
  Bounds Processor:
   bound: 1
   enrichment: match-rt
   automaton:
    final states: {7}
    transitions:
     n0(7) -> 7*
     L1(62) -> 63*
     R1(93) -> 94*
     o0(7) -> 7*
     l0(7) -> 7*
     o1(26) -> 27*
     o1(125) -> 126*
     r1(40) -> 41*
     r0(7) -> 7*
     R0(7) -> 7*
     L0(7) -> 7*
     n1(150) -> 151*
     n1(94) -> 95*
     n1(72) -> 73*
     l1(25) -> 26*
     l1(102) -> 103*
     94 -> 102*
     151 -> 62*
     27 -> 126,40,7
     126 -> 40*
     7 -> 125,93,72,25
     63 -> 7*
     73 -> 62*
     62 -> 150*
     95 -> 94,7
     41 -> 73,62,7
     103 -> 26*
   problem:
    strict:
     n(l(o(x1))) -> r(o(x1))
     L(l(o(x1))) -> L(r(o(x1)))
     o(r(R(x1))) -> o(l(R(x1)))
    weak:
     L(x1) -> L(n(x1))
     R(x1) -> n(R(x1))
   Bounds Processor:
    bound: 1
    enrichment: match-rt
    automaton:
     final states: {7}
     transitions:
      n0(7) -> 7*
      L1(47) -> 48*
      R1(39) -> 40*
      o0(7) -> 7*
      l0(7) -> 7*
      o1(11) -> 12*
      r1(12) -> 13*
      r0(7) -> 7*
      R0(7) -> 7*
      L0(7) -> 7*
      n1(83) -> 84*
      n1(46) -> 47*
      n1(69) -> 70*
      l1(40) -> 41*
      70 -> 40,7
      47 -> 83*
      48 -> 7*
      7 -> 46,39,11
      13 -> 47,7
      40 -> 69*
      41 -> 11*
      84 -> 47*
    problem:
     strict:
      L(l(o(x1))) -> L(r(o(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(L(x1))) -> o(r(L(x1)))
      R(r(o(x1))) -> R(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:
        n0(7) -> 7*
        L1(24) -> 25*
        R1(22) -> 23*
        o0(7) -> 7*
        l0(7) -> 7*
        o1(20) -> 21*
        r1(25) -> 26*
        r0(7) -> 7*
        R0(7) -> 7*
        L0(7) -> 7*
        n1(42) -> 43*
        n1(54) -> 55*
        n1(40) -> 41*
        l1(21) -> 22*
        43 -> 22*
        7 -> 42,24,20
        22 -> 54*
        26 -> 20*
        55 -> 22*
        41 -> 25,7
        25 -> 40*
        23 -> 7*
      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:
        [L](x0) = x0,
        
        [o](x0) = 8x0,
        
        [n](x0) = x0,
        
        [R](x0) = 2x0,
        
        [l](x0) = 8x0,
        
        [r](x0) = x0
       orientation:
        o(l(L(x1))) = 16x1 >= 8x1 = o(r(L(x1)))
        
        L(x1) = x1 >= x1 = n(L(x1))
        
        R(x1) = 2x1 >= 2x1 = R(n(x1))
       problem:
        strict:
         
        weak:
         L(x1) -> n(L(x1))
         R(x1) -> R(n(x1))
       Qed