MAYBE

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

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