MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(a(x1)) -> b(b(a(c(c(c(x1))))))
   c(b(x1)) -> a(x1)
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [b](x0) = x0 + 9,
    
    [c](x0) = x0 + 6,
    
    [a](x0) = x0
   orientation:
    a(x1) = x1 >= x1 = x1
    
    a(a(x1)) = x1 >= x1 + 36 = b(b(a(c(c(c(x1))))))
    
    c(b(x1)) = x1 + 15 >= x1 = a(x1)
   problem:
    strict:
     a(x1) -> x1
     a(a(x1)) -> b(b(a(c(c(c(x1))))))
    weak:
     c(b(x1)) -> a(x1)
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [b](x0) = x0 + 20,
     
     [c](x0) = x0 + 2,
     
     [a](x0) = x0 + 10
    orientation:
     a(x1) = x1 + 10 >= x1 = x1
     
     a(a(x1)) = x1 + 20 >= x1 + 56 = b(b(a(c(c(c(x1))))))
     
     c(b(x1)) = x1 + 22 >= x1 + 10 = a(x1)
    problem:
     strict:
      a(a(x1)) -> b(b(a(c(c(c(x1))))))
     weak:
      a(x1) -> x1
      c(b(x1)) -> a(x1)
    Open