MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> b(x1)
   a(b(x1)) -> x1
   b(a(x1)) -> a(c(a(b(x1))))
   c(c(x1)) -> x1
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 25,
    
    [b](x0) = x0 + 19,
    
    [a](x0) = x0 + 5
   orientation:
    a(x1) = x1 + 5 >= x1 + 19 = b(x1)
    
    a(b(x1)) = x1 + 24 >= x1 = x1
    
    b(a(x1)) = x1 + 24 >= x1 + 54 = a(c(a(b(x1))))
    
    c(c(x1)) = x1 + 50 >= x1 = x1
   problem:
    strict:
     a(x1) -> b(x1)
     b(a(x1)) -> a(c(a(b(x1))))
    weak:
     a(b(x1)) -> x1
     c(c(x1)) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 31,
     
     [b](x0) = x0,
     
     [a](x0) = x0 + 1
    orientation:
     a(x1) = x1 + 1 >= x1 = b(x1)
     
     b(a(x1)) = x1 + 1 >= x1 + 33 = a(c(a(b(x1))))
     
     a(b(x1)) = x1 + 1 >= x1 = x1
     
     c(c(x1)) = x1 + 62 >= x1 = x1
    problem:
     strict:
      b(a(x1)) -> a(c(a(b(x1))))
     weak:
      a(x1) -> b(x1)
      a(b(x1)) -> x1
      c(c(x1)) -> x1
    Open