MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(x1) -> b(x1)
   b(a(c(x1))) -> c(c(a(b(a(x1)))))
   c(x1) -> x1
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 9,
    
    [b](x0) = x0 + 16,
    
    [a](x0) = x0
   orientation:
    a(x1) = x1 >= x1 = x1
    
    a(x1) = x1 >= x1 + 16 = b(x1)
    
    b(a(c(x1))) = x1 + 25 >= x1 + 34 = c(c(a(b(a(x1)))))
    
    c(x1) = x1 + 9 >= x1 = x1
   problem:
    strict:
     a(x1) -> x1
     a(x1) -> b(x1)
     b(a(c(x1))) -> c(c(a(b(a(x1)))))
    weak:
     c(x1) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0,
     
     [b](x0) = x0 + 5,
     
     [a](x0) = x0 + 16
    orientation:
     a(x1) = x1 + 16 >= x1 = x1
     
     a(x1) = x1 + 16 >= x1 + 5 = b(x1)
     
     b(a(c(x1))) = x1 + 21 >= x1 + 37 = c(c(a(b(a(x1)))))
     
     c(x1) = x1 >= x1 = x1
    problem:
     strict:
      b(a(c(x1))) -> c(c(a(b(a(x1)))))
     weak:
      a(x1) -> x1
      a(x1) -> b(x1)
      c(x1) -> x1
    Open