MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(a(x1)) -> x1
   b(b(x1)) -> c(c(c(x1)))
   b(c(x1)) -> a(b(b(x1)))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 1,
    
    [b](x0) = x0 + 1,
    
    [a](x0) = x0 + 14
   orientation:
    a(a(x1)) = x1 + 28 >= x1 = x1
    
    b(b(x1)) = x1 + 2 >= x1 + 3 = c(c(c(x1)))
    
    b(c(x1)) = x1 + 2 >= x1 + 16 = a(b(b(x1)))
   problem:
    strict:
     b(b(x1)) -> c(c(c(x1)))
     b(c(x1)) -> a(b(b(x1)))
    weak:
     a(a(x1)) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 17,
     
     [b](x0) = x0,
     
     [a](x0) = x0
    orientation:
     b(b(x1)) = x1 >= x1 + 51 = c(c(c(x1)))
     
     b(c(x1)) = x1 + 17 >= x1 = a(b(b(x1)))
     
     a(a(x1)) = x1 >= x1 = x1
    problem:
     strict:
      b(b(x1)) -> c(c(c(x1)))
     weak:
      b(c(x1)) -> a(b(b(x1)))
      a(a(x1)) -> x1
    Open