MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(b(x1)) -> x1
   a(c(x1)) -> c(b(b(c(a(a(x1))))))
   b(c(x1)) -> x1
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 18,
    
    [a](x0) = x0,
    
    [b](x0) = x0
   orientation:
    a(b(x1)) = x1 >= x1 = x1
    
    a(c(x1)) = x1 + 18 >= x1 + 36 = c(b(b(c(a(a(x1))))))
    
    b(c(x1)) = x1 + 18 >= x1 = x1
   problem:
    strict:
     a(b(x1)) -> x1
     a(c(x1)) -> c(b(b(c(a(a(x1))))))
    weak:
     b(c(x1)) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0,
     
     [a](x0) = x0 + 13,
     
     [b](x0) = x0 + 12
    orientation:
     a(b(x1)) = x1 + 25 >= x1 = x1
     
     a(c(x1)) = x1 + 13 >= x1 + 50 = c(b(b(c(a(a(x1))))))
     
     b(c(x1)) = x1 + 12 >= x1 = x1
    problem:
     strict:
      a(c(x1)) -> c(b(b(c(a(a(x1))))))
     weak:
      a(b(x1)) -> x1
      b(c(x1)) -> x1
    Open