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


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


YES

Problem:
 strict:
  c(a(b(x1))) -> c(b(b(x1)))
  b(c(c(x1))) -> c(c(c(x1)))
  a(a(a(x1))) -> c(c(b(x1)))
 weak:
  c(b(b(x1))) -> c(c(c(x1)))
  c(a(c(x1))) -> a(a(b(x1)))
  b(c(b(x1))) -> b(b(b(x1)))

Proof:
 String Reversal Processor:
  strict:
   b(a(c(x1))) -> b(b(c(x1)))
   c(c(b(x1))) -> c(c(c(x1)))
   a(a(a(x1))) -> b(c(c(x1)))
  weak:
   b(b(c(x1))) -> c(c(c(x1)))
   c(a(c(x1))) -> b(a(a(x1)))
   b(c(b(x1))) -> b(b(b(x1)))
  Bounds Processor:
   bound: 1
   enrichment: match-rt
   automaton:
    final states: {3,2,1}
    transitions:
     b1(128) -> 129*
     b1(23) -> 24*
     b1(198) -> 199*
     b1(124) -> 125*
     b1(214) -> 215*
     b1(104) -> 105*
     b1(194) -> 195*
     a1(102) -> 103*
     a1(188) -> 189*
     a1(186) -> 187*
     a1(174) -> 175*
     a1(103) -> 104*
     a1(110) -> 111*
     c1(21) -> 22*
     c1(241) -> 242*
     c1(47) -> 48*
     c1(31) -> 32*
     c1(257) -> 258*
     c1(255) -> 256*
     c1(49) -> 50*
     c1(148) -> 149*
     c1(22) -> 23*
     c1(142) -> 143*
     c1(233) -> 234*
     b0(3) -> 1*
     b0(2) -> 1*
     b0(1) -> 1*
     c0(1) -> 3*
     c0(3) -> 3*
     c0(2) -> 3*
     a0(2) -> 2*
     a0(1) -> 2*
     a0(3) -> 2*
     194 -> 257*
     24 -> 129,125,215,175,104,111,2
     195 -> 104*
     215 -> 23*
     242 -> 21*
     47 -> 186*
     198 -> 233*
     48 -> 22*
     256 -> 21*
     189 -> 103*
     234 -> 21*
     104 -> 148*
     258 -> 21*
     2 -> 214,110,21
     143 -> 21*
     124 -> 142*
     105 -> 149,242,124,22
     22 -> 24,215,195,199,105,128,3
     21 -> 174*
     125 -> 194,1
     1 -> 102,3,31
     31 -> 188*
     175 -> 103*
     199 -> 23*
     187 -> 103*
     50 -> 23,21
     3 -> 198,1,47
     149 -> 21*
     129 -> 104*
     214 -> 241*
     128 -> 255*
     32 -> 22*
     111 -> 103*
     23 -> 50,49
   problem:
    strict:
     b(a(c(x1))) -> b(b(c(x1)))
     c(c(b(x1))) -> c(c(c(x1)))
    weak:
     b(b(c(x1))) -> c(c(c(x1)))
     c(a(c(x1))) -> b(a(a(x1)))
     b(c(b(x1))) -> b(b(b(x1)))
   String Reversal Processor:
    strict:
     c(a(b(x1))) -> c(b(b(x1)))
     b(c(c(x1))) -> c(c(c(x1)))
    weak:
     c(b(b(x1))) -> c(c(c(x1)))
     c(a(c(x1))) -> a(a(b(x1)))
     b(c(b(x1))) -> b(b(b(x1)))
    Matrix Interpretation Processor: dim=2
     
     interpretation:
                [1 1]  
      [a](x0) = [0 0]x0,
      
                [1 0]     [0]
      [b](x0) = [0 0]x0 + [2],
      
                [1 0]     [0]
      [c](x0) = [0 0]x0 + [2]
     orientation:
                    [1 0]     [2]    [1 0]     [0]              
      c(a(b(x1))) = [0 0]x1 + [2] >= [0 0]x1 + [2] = c(b(b(x1)))
      
                    [1 0]     [0]    [1 0]     [0]              
      b(c(c(x1))) = [0 0]x1 + [2] >= [0 0]x1 + [2] = c(c(c(x1)))
      
                    [1 0]     [0]    [1 0]     [0]              
      c(b(b(x1))) = [0 0]x1 + [2] >= [0 0]x1 + [2] = c(c(c(x1)))
      
                    [1 0]     [2]    [1 0]     [2]              
      c(a(c(x1))) = [0 0]x1 + [2] >= [0 0]x1 + [0] = a(a(b(x1)))
      
                    [1 0]     [0]    [1 0]     [0]              
      b(c(b(x1))) = [0 0]x1 + [2] >= [0 0]x1 + [2] = b(b(b(x1)))
     problem:
      strict:
       b(c(c(x1))) -> c(c(c(x1)))
      weak:
       c(b(b(x1))) -> c(c(c(x1)))
       c(a(c(x1))) -> a(a(b(x1)))
       b(c(b(x1))) -> b(b(b(x1)))
     Arctic Interpretation Processor:
      dimension: 1
      interpretation:
       [a](x0) = x0,
       
       [b](x0) = 8x0,
       
       [c](x0) = 8x0
      orientation:
       b(c(c(x1))) = 24x1 >= 24x1 = c(c(c(x1)))
       
       c(b(b(x1))) = 24x1 >= 24x1 = c(c(c(x1)))
       
       c(a(c(x1))) = 16x1 >= 8x1 = a(a(b(x1)))
       
       b(c(b(x1))) = 24x1 >= 24x1 = b(b(b(x1)))
      problem:
       strict:
        b(c(c(x1))) -> c(c(c(x1)))
       weak:
        c(b(b(x1))) -> c(c(c(x1)))
        b(c(b(x1))) -> b(b(b(x1)))
      String Reversal Processor:
       strict:
        c(c(b(x1))) -> c(c(c(x1)))
       weak:
        b(b(c(x1))) -> c(c(c(x1)))
        b(c(b(x1))) -> b(b(b(x1)))
       Bounds Processor:
        bound: 1
        enrichment: match-rt
        automaton:
         final states: {3}
         transitions:
          c1(10) -> 11*
          c1(8) -> 9*
          c1(9) -> 10*
          b0(3) -> 3*
          c0(3) -> 3*
          11 -> 9,10,3
          3 -> 8*
        problem:
         strict:
          
         weak:
          b(b(c(x1))) -> c(c(c(x1)))
          b(c(b(x1))) -> b(b(b(x1)))
        Qed