MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(b(x1)) -> x1
   a(b(x1)) -> b(c(x1))
   a(c(x1)) -> b(a(a(a(x1))))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 29,
    
    [a](x0) = x0 + 6,
    
    [b](x0) = x0 + 19
   orientation:
    a(b(x1)) = x1 + 25 >= x1 = x1
    
    a(b(x1)) = x1 + 25 >= x1 + 48 = b(c(x1))
    
    a(c(x1)) = x1 + 35 >= x1 + 37 = b(a(a(a(x1))))
   problem:
    strict:
     a(b(x1)) -> b(c(x1))
     a(c(x1)) -> b(a(a(a(x1))))
    weak:
     a(b(x1)) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0 + 25,
     
     [a](x0) = x0 + 10,
     
     [b](x0) = x0 + 2
    orientation:
     a(b(x1)) = x1 + 12 >= x1 + 27 = b(c(x1))
     
     a(c(x1)) = x1 + 35 >= x1 + 32 = b(a(a(a(x1))))
     
     a(b(x1)) = x1 + 12 >= x1 = x1
    problem:
     strict:
      a(b(x1)) -> b(c(x1))
     weak:
      a(c(x1)) -> b(a(a(a(x1))))
      a(b(x1)) -> x1
    Open