MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(a(x1)) -> b(b(c(x1)))
   c(x1) -> x1
   c(b(x1)) -> b(c(a(x1)))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [b](x0) = x0,
    
    [c](x0) = x0,
    
    [a](x0) = x0 + 2
   orientation:
    a(x1) = x1 + 2 >= x1 = x1
    
    a(a(x1)) = x1 + 4 >= x1 = b(b(c(x1)))
    
    c(x1) = x1 >= x1 = x1
    
    c(b(x1)) = x1 >= x1 + 2 = b(c(a(x1)))
   problem:
    strict:
     c(x1) -> x1
     c(b(x1)) -> b(c(a(x1)))
    weak:
     a(x1) -> x1
     a(a(x1)) -> b(b(c(x1)))
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [b](x0) = x0 + 2,
     
     [c](x0) = x0 + 4,
     
     [a](x0) = x0 + 12
    orientation:
     c(x1) = x1 + 4 >= x1 = x1
     
     c(b(x1)) = x1 + 6 >= x1 + 18 = b(c(a(x1)))
     
     a(x1) = x1 + 12 >= x1 = x1
     
     a(a(x1)) = x1 + 24 >= x1 + 8 = b(b(c(x1)))
    problem:
     strict:
      c(b(x1)) -> b(c(a(x1)))
     weak:
      c(x1) -> x1
      a(x1) -> x1
      a(a(x1)) -> b(b(c(x1)))
    Open