MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(a(x1)) -> b(x1)
   b(c(x1)) -> x1
   c(b(x1)) -> a(b(c(c(x1))))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 16,
    
    [b](x0) = x0 + 1,
    
    [a](x0) = x0
   orientation:
    a(x1) = x1 >= x1 = x1
    
    a(a(x1)) = x1 >= x1 + 1 = b(x1)
    
    b(c(x1)) = x1 + 17 >= x1 = x1
    
    c(b(x1)) = x1 + 17 >= x1 + 33 = a(b(c(c(x1))))
   problem:
    strict:
     a(x1) -> x1
     a(a(x1)) -> b(x1)
     c(b(x1)) -> a(b(c(c(x1))))
    weak:
     b(c(x1)) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 2,
     
     [b](x0) = x0 + 19,
     
     [a](x0) = x0 + 16
    orientation:
     a(x1) = x1 + 16 >= x1 = x1
     
     a(a(x1)) = x1 + 32 >= x1 + 19 = b(x1)
     
     c(b(x1)) = x1 + 21 >= x1 + 39 = a(b(c(c(x1))))
     
     b(c(x1)) = x1 + 21 >= x1 = x1
    problem:
     strict:
      c(b(x1)) -> a(b(c(c(x1))))
     weak:
      a(x1) -> x1
      a(a(x1)) -> b(x1)
      b(c(x1)) -> x1
    Open