MAYBE

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

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