MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> b(c(x1))
   a(b(x1)) -> c(a(x1))
   c(c(c(x1))) -> a(b(x1))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [b](x0) = x0 + 13,
    
    [c](x0) = x0 + 6,
    
    [a](x0) = x0 + 3
   orientation:
    a(x1) = x1 + 3 >= x1 + 19 = b(c(x1))
    
    a(b(x1)) = x1 + 16 >= x1 + 9 = c(a(x1))
    
    c(c(c(x1))) = x1 + 18 >= x1 + 16 = a(b(x1))
   problem:
    strict:
     a(x1) -> b(c(x1))
    weak:
     a(b(x1)) -> c(a(x1))
     c(c(c(x1))) -> a(b(x1))
   Open