MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(b(x1)) -> b(b(a(c(x1))))
   b(x1) -> x1
   c(c(x1)) -> b(a(x1))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0,
    
    [b](x0) = x0,
    
    [a](x0) = x0 + 18
   orientation:
    a(x1) = x1 + 18 >= x1 = x1
    
    a(b(x1)) = x1 + 18 >= x1 + 18 = b(b(a(c(x1))))
    
    b(x1) = x1 >= x1 = x1
    
    c(c(x1)) = x1 >= x1 + 18 = b(a(x1))
   problem:
    strict:
     a(b(x1)) -> b(b(a(c(x1))))
     b(x1) -> x1
     c(c(x1)) -> b(a(x1))
    weak:
     a(x1) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 23,
     
     [b](x0) = x0,
     
     [a](x0) = x0 + 25
    orientation:
     a(b(x1)) = x1 + 25 >= x1 + 48 = b(b(a(c(x1))))
     
     b(x1) = x1 >= x1 = x1
     
     c(c(x1)) = x1 + 46 >= x1 + 25 = b(a(x1))
     
     a(x1) = x1 + 25 >= x1 = x1
    problem:
     strict:
      a(b(x1)) -> b(b(a(c(x1))))
      b(x1) -> x1
     weak:
      c(c(x1)) -> b(a(x1))
      a(x1) -> x1
    Matrix Interpretation Processor:
     dimension: 1
     interpretation:
      [c](x0) = x0 + 8,
      
      [b](x0) = x0 + 16,
      
      [a](x0) = x0
     orientation:
      a(b(x1)) = x1 + 16 >= x1 + 40 = b(b(a(c(x1))))
      
      b(x1) = x1 + 16 >= x1 = x1
      
      c(c(x1)) = x1 + 16 >= x1 + 16 = b(a(x1))
      
      a(x1) = x1 >= x1 = x1
     problem:
      strict:
       a(b(x1)) -> b(b(a(c(x1))))
      weak:
       b(x1) -> x1
       c(c(x1)) -> b(a(x1))
       a(x1) -> x1
     Open