MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(b(x1)) -> x1
   b(c(x1)) -> a(a(x1))
   c(a(x1)) -> b(b(c(c(x1))))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 28,
    
    [a](x0) = x0,
    
    [b](x0) = x0
   orientation:
    a(b(x1)) = x1 >= x1 = x1
    
    b(c(x1)) = x1 + 28 >= x1 = a(a(x1))
    
    c(a(x1)) = x1 + 28 >= x1 + 56 = b(b(c(c(x1))))
   problem:
    strict:
     a(b(x1)) -> x1
     c(a(x1)) -> b(b(c(c(x1))))
    weak:
     b(c(x1)) -> a(a(x1))
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 2,
     
     [a](x0) = x0 + 6,
     
     [b](x0) = x0 + 11
    orientation:
     a(b(x1)) = x1 + 17 >= x1 = x1
     
     c(a(x1)) = x1 + 8 >= x1 + 26 = b(b(c(c(x1))))
     
     b(c(x1)) = x1 + 13 >= x1 + 12 = a(a(x1))
    problem:
     strict:
      c(a(x1)) -> b(b(c(c(x1))))
     weak:
      a(b(x1)) -> x1
      b(c(x1)) -> a(a(x1))
    Open