MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> b(x1)
   a(b(x1)) -> b(a(c(x1)))
   b(b(x1)) -> x1
   c(c(x1)) -> a(x1)
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 18,
    
    [b](x0) = x0 + 16,
    
    [a](x0) = x0 + 14
   orientation:
    a(x1) = x1 + 14 >= x1 + 16 = b(x1)
    
    a(b(x1)) = x1 + 30 >= x1 + 48 = b(a(c(x1)))
    
    b(b(x1)) = x1 + 32 >= x1 = x1
    
    c(c(x1)) = x1 + 36 >= x1 + 14 = a(x1)
   problem:
    strict:
     a(x1) -> b(x1)
     a(b(x1)) -> b(a(c(x1)))
    weak:
     b(b(x1)) -> x1
     c(c(x1)) -> a(x1)
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 2,
     
     [b](x0) = x0 + 1,
     
     [a](x0) = x0 + 4
    orientation:
     a(x1) = x1 + 4 >= x1 + 1 = b(x1)
     
     a(b(x1)) = x1 + 5 >= x1 + 7 = b(a(c(x1)))
     
     b(b(x1)) = x1 + 2 >= x1 = x1
     
     c(c(x1)) = x1 + 4 >= x1 + 4 = a(x1)
    problem:
     strict:
      a(b(x1)) -> b(a(c(x1)))
     weak:
      a(x1) -> b(x1)
      b(b(x1)) -> x1
      c(c(x1)) -> a(x1)
    Open