MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(b(b(x1))) -> b(b(b(c(x1))))
   b(c(x1)) -> a(a(x1))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 29,
    
    [b](x0) = x0 + 5,
    
    [a](x0) = x0 + 18
   orientation:
    a(x1) = x1 + 18 >= x1 = x1
    
    a(b(b(x1))) = x1 + 28 >= x1 + 44 = b(b(b(c(x1))))
    
    b(c(x1)) = x1 + 34 >= x1 + 36 = a(a(x1))
   problem:
    strict:
     a(b(b(x1))) -> b(b(b(c(x1))))
     b(c(x1)) -> a(a(x1))
    weak:
     a(x1) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 7,
     
     [b](x0) = x0 + 18,
     
     [a](x0) = x0 + 8
    orientation:
     a(b(b(x1))) = x1 + 44 >= x1 + 61 = b(b(b(c(x1))))
     
     b(c(x1)) = x1 + 25 >= x1 + 16 = a(a(x1))
     
     a(x1) = x1 + 8 >= x1 = x1
    problem:
     strict:
      a(b(b(x1))) -> b(b(b(c(x1))))
     weak:
      b(c(x1)) -> a(a(x1))
      a(x1) -> x1
    Open