MAYBE

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

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