MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(a(x1)) -> b(a(c(b(x1))))
   b(x1) -> c(x1)
   b(c(x1)) -> a(x1)
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 1,
    
    [b](x0) = x0 + 17,
    
    [a](x0) = x0 + 21
   orientation:
    a(x1) = x1 + 21 >= x1 = x1
    
    a(a(x1)) = x1 + 42 >= x1 + 56 = b(a(c(b(x1))))
    
    b(x1) = x1 + 17 >= x1 + 1 = c(x1)
    
    b(c(x1)) = x1 + 18 >= x1 + 21 = a(x1)
   problem:
    strict:
     a(a(x1)) -> b(a(c(b(x1))))
     b(c(x1)) -> a(x1)
    weak:
     a(x1) -> x1
     b(x1) -> c(x1)
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 12,
     
     [b](x0) = x0 + 18,
     
     [a](x0) = x0 + 6
    orientation:
     a(a(x1)) = x1 + 12 >= x1 + 54 = b(a(c(b(x1))))
     
     b(c(x1)) = x1 + 30 >= x1 + 6 = a(x1)
     
     a(x1) = x1 + 6 >= x1 = x1
     
     b(x1) = x1 + 18 >= x1 + 12 = c(x1)
    problem:
     strict:
      a(a(x1)) -> b(a(c(b(x1))))
     weak:
      b(c(x1)) -> a(x1)
      a(x1) -> x1
      b(x1) -> c(x1)
    Open