MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(b(x1)) -> c(a(x1))
   c(c(x1)) -> c(b(c(b(a(x1)))))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 16,
    
    [b](x0) = x0 + 1,
    
    [a](x0) = x0 + 19
   orientation:
    a(x1) = x1 + 19 >= x1 = x1
    
    a(b(x1)) = x1 + 20 >= x1 + 35 = c(a(x1))
    
    c(c(x1)) = x1 + 32 >= x1 + 53 = c(b(c(b(a(x1)))))
   problem:
    strict:
     a(b(x1)) -> c(a(x1))
     c(c(x1)) -> c(b(c(b(a(x1)))))
    weak:
     a(x1) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 8,
     
     [b](x0) = x0 + 16,
     
     [a](x0) = x0 + 1
    orientation:
     a(b(x1)) = x1 + 17 >= x1 + 9 = c(a(x1))
     
     c(c(x1)) = x1 + 16 >= x1 + 49 = c(b(c(b(a(x1)))))
     
     a(x1) = x1 + 1 >= x1 = x1
    problem:
     strict:
      c(c(x1)) -> c(b(c(b(a(x1)))))
     weak:
      a(b(x1)) -> c(a(x1))
      a(x1) -> x1
    Open