MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(b(x1)) -> b(a(c(x1)))
   b(b(x1)) -> x1
   c(c(x1)) -> b(a(x1))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 2,
    
    [b](x0) = x0,
    
    [a](x0) = x0 + 6
   orientation:
    a(x1) = x1 + 6 >= x1 = x1
    
    a(b(x1)) = x1 + 6 >= x1 + 8 = b(a(c(x1)))
    
    b(b(x1)) = x1 >= x1 = x1
    
    c(c(x1)) = x1 + 4 >= x1 + 6 = b(a(x1))
   problem:
    strict:
     a(b(x1)) -> b(a(c(x1)))
     b(b(x1)) -> x1
     c(c(x1)) -> b(a(x1))
    weak:
     a(x1) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 19,
     
     [b](x0) = x0 + 4,
     
     [a](x0) = x0 + 13
    orientation:
     a(b(x1)) = x1 + 17 >= x1 + 36 = b(a(c(x1)))
     
     b(b(x1)) = x1 + 8 >= x1 = x1
     
     c(c(x1)) = x1 + 38 >= x1 + 17 = b(a(x1))
     
     a(x1) = x1 + 13 >= x1 = x1
    problem:
     strict:
      a(b(x1)) -> b(a(c(x1)))
     weak:
      b(b(x1)) -> x1
      c(c(x1)) -> b(a(x1))
      a(x1) -> x1
    Open