/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(a(c(x1)))
  a(a(a(x1))) -> c(a(a(x1)))
  a(b(a(x1))) -> c(a(c(x1)))
  a(b(b(x1))) -> a(c(b(x1)))
 weak:
  a(b(b(x1))) -> a(a(c(x1)))
  b(c(c(x1))) -> b(a(b(x1)))

Proof:
 String Reversal Processor:
  strict:
   b(a(c(x1))) -> c(a(c(x1)))
   a(a(a(x1))) -> a(a(c(x1)))
   a(b(a(x1))) -> c(a(c(x1)))
   b(b(a(x1))) -> b(c(a(x1)))
  weak:
   b(b(a(x1))) -> c(a(a(x1)))
   c(c(b(x1))) -> b(a(b(x1)))
  Matrix Interpretation Processor: dim=2
   
   interpretation:
              [1 0]  
    [a](x0) = [0 0]x0,
    
              [1 1]     [0]
    [b](x0) = [0 0]x0 + [2],
    
                
    [c](x0) = x0
   orientation:
                  [1 0]     [0]    [1 0]                
    b(a(c(x1))) = [0 0]x1 + [2] >= [0 0]x1 = c(a(c(x1)))
    
                  [1 0]      [1 0]                
    a(a(a(x1))) = [0 0]x1 >= [0 0]x1 = a(a(c(x1)))
    
                  [1 0]      [1 0]                
    a(b(a(x1))) = [0 0]x1 >= [0 0]x1 = c(a(c(x1)))
    
                  [1 0]     [2]    [1 0]     [0]              
    b(b(a(x1))) = [0 0]x1 + [2] >= [0 0]x1 + [2] = b(c(a(x1)))
    
                  [1 0]     [2]    [1 0]                
    b(b(a(x1))) = [0 0]x1 + [2] >= [0 0]x1 = c(a(a(x1)))
    
                  [1 1]     [0]    [1 1]     [0]              
    c(c(b(x1))) = [0 0]x1 + [2] >= [0 0]x1 + [2] = b(a(b(x1)))
   problem:
    strict:
     b(a(c(x1))) -> c(a(c(x1)))
     a(a(a(x1))) -> a(a(c(x1)))
     a(b(a(x1))) -> c(a(c(x1)))
    weak:
     c(c(b(x1))) -> b(a(b(x1)))
   Bounds Processor:
    bound: 2
    enrichment: match-rt
    automaton:
     final states: {4}
     transitions:
      c1(11) -> 12*
      c1(9) -> 10*
      c1(84) -> 85*
      c1(82) -> 83*
      b1(45) -> 46*
      b1(43) -> 44*
      a1(83) -> 84*
      a1(10) -> 11*
      a1(37) -> 38*
      a1(44) -> 45*
      b0(4) -> 4*
      c0(4) -> 4*
      a0(4) -> 4*
      c2(68) -> 69*
      c2(70) -> 71*
      a2(69) -> 70*
      46 -> 10*
      85 -> 11*
      12 -> 45,44,37,4
      4 -> 43,9
      11 -> 68*
      38 -> 11*
      44 -> 82*
      71 -> 46*
    problem:
     strict:
      a(a(a(x1))) -> a(a(c(x1)))
      a(b(a(x1))) -> c(a(c(x1)))
     weak:
      c(c(b(x1))) -> b(a(b(x1)))
    String Reversal Processor:
     strict:
      a(a(a(x1))) -> c(a(a(x1)))
      a(b(a(x1))) -> c(a(c(x1)))
     weak:
      b(c(c(x1))) -> b(a(b(x1)))
     Arctic Interpretation Processor:
      dimension: 1
      interpretation:
       [a](x0) = 8x0,
       
       [b](x0) = x0,
       
       [c](x0) = 4x0
      orientation:
       a(a(a(x1))) = 24x1 >= 20x1 = c(a(a(x1)))
       
       a(b(a(x1))) = 16x1 >= 16x1 = c(a(c(x1)))
       
       b(c(c(x1))) = 8x1 >= 8x1 = b(a(b(x1)))
      problem:
       strict:
        a(b(a(x1))) -> c(a(c(x1)))
       weak:
        b(c(c(x1))) -> b(a(b(x1)))
      Bounds Processor:
       bound: 2
       enrichment: match-rt
       automaton:
        final states: {4}
        transitions:
         c1(11) -> 12*
         c1(9) -> 10*
         c1(21) -> 22*
         b1(13) -> 14*
         b1(15) -> 16*
         a1(10) -> 11*
         a1(14) -> 15*
         b0(4) -> 4*
         a0(4) -> 4*
         c0(4) -> 4*
         c2(25) -> 26*
         c2(23) -> 24*
         a2(24) -> 25*
         12 -> 4*
         14 -> 21*
         16 -> 4*
         4 -> 9*
         11 -> 13*
         22 -> 10*
         26 -> 15*
         10 -> 23*
       problem:
        strict:
         
        weak:
         b(c(c(x1))) -> b(a(b(x1)))
       Qed