MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(a(x1)) -> b(x1)
   a(b(x1)) -> c(a(x1))
   b(c(x1)) -> c(b(a(x1)))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0,
    
    [b](x0) = x0 + 1,
    
    [a](x0) = x0
   orientation:
    a(a(x1)) = x1 >= x1 + 1 = b(x1)
    
    a(b(x1)) = x1 + 1 >= x1 = c(a(x1))
    
    b(c(x1)) = x1 + 1 >= x1 + 1 = c(b(a(x1)))
   problem:
    strict:
     a(a(x1)) -> b(x1)
     b(c(x1)) -> c(b(a(x1)))
    weak:
     a(b(x1)) -> c(a(x1))
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0,
     
     [b](x0) = x0 + 2,
     
     [a](x0) = x0 + 21
    orientation:
     a(a(x1)) = x1 + 42 >= x1 + 2 = b(x1)
     
     b(c(x1)) = x1 + 2 >= x1 + 23 = c(b(a(x1)))
     
     a(b(x1)) = x1 + 23 >= x1 + 21 = c(a(x1))
    problem:
     strict:
      b(c(x1)) -> c(b(a(x1)))
     weak:
      a(a(x1)) -> b(x1)
      a(b(x1)) -> c(a(x1))
    Open