MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(b(x1)) -> b(c(b(a(x1))))
   b(x1) -> a(x1)
   c(c(c(x1))) -> x1
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 17,
    
    [b](x0) = x0 + 16,
    
    [a](x0) = x0
   orientation:
    a(x1) = x1 >= x1 = x1
    
    a(b(x1)) = x1 + 16 >= x1 + 49 = b(c(b(a(x1))))
    
    b(x1) = x1 + 16 >= x1 = a(x1)
    
    c(c(c(x1))) = x1 + 51 >= x1 = x1
   problem:
    strict:
     a(x1) -> x1
     a(b(x1)) -> b(c(b(a(x1))))
    weak:
     b(x1) -> a(x1)
     c(c(c(x1))) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 1,
     
     [b](x0) = x0 + 8,
     
     [a](x0) = x0 + 8
    orientation:
     a(x1) = x1 + 8 >= x1 = x1
     
     a(b(x1)) = x1 + 16 >= x1 + 25 = b(c(b(a(x1))))
     
     b(x1) = x1 + 8 >= x1 + 8 = a(x1)
     
     c(c(c(x1))) = x1 + 3 >= x1 = x1
    problem:
     strict:
      a(b(x1)) -> b(c(b(a(x1))))
     weak:
      a(x1) -> x1
      b(x1) -> a(x1)
      c(c(c(x1))) -> x1
    Open