MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> b(c(x1))
   b(a(b(x1))) -> a(a(a(x1)))
   c(c(x1)) -> a(x1)
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [b](x0) = x0,
    
    [c](x0) = x0 + 16,
    
    [a](x0) = x0 + 12
   orientation:
    a(x1) = x1 + 12 >= x1 + 16 = b(c(x1))
    
    b(a(b(x1))) = x1 + 12 >= x1 + 36 = a(a(a(x1)))
    
    c(c(x1)) = x1 + 32 >= x1 + 12 = a(x1)
   problem:
    strict:
     a(x1) -> b(c(x1))
     b(a(b(x1))) -> a(a(a(x1)))
    weak:
     c(c(x1)) -> a(x1)
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [b](x0) = x0 + 2,
     
     [c](x0) = x0 + 8,
     
     [a](x0) = x0 + 16
    orientation:
     a(x1) = x1 + 16 >= x1 + 10 = b(c(x1))
     
     b(a(b(x1))) = x1 + 20 >= x1 + 48 = a(a(a(x1)))
     
     c(c(x1)) = x1 + 16 >= x1 + 16 = a(x1)
    problem:
     strict:
      b(a(b(x1))) -> a(a(a(x1)))
     weak:
      a(x1) -> b(c(x1))
      c(c(x1)) -> a(x1)
    Open