MAYBE

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

Proof:
 RT Transformation Processor:
  strict:
   a(x1) -> x1
   a(x1) -> b(x1)
   a(c(x1)) -> c(c(a(a(b(x1)))))
   b(b(x1)) -> x1
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   interpretation:
    [c](x0) = x0 + 10,
    
    [b](x0) = x0 + 6,
    
    [a](x0) = x0 + 6
   orientation:
    a(x1) = x1 + 6 >= x1 = x1
    
    a(x1) = x1 + 6 >= x1 + 6 = b(x1)
    
    a(c(x1)) = x1 + 16 >= x1 + 38 = c(c(a(a(b(x1)))))
    
    b(b(x1)) = x1 + 12 >= x1 = x1
   problem:
    strict:
     a(x1) -> b(x1)
     a(c(x1)) -> c(c(a(a(b(x1)))))
    weak:
     a(x1) -> x1
     b(b(x1)) -> x1
   Matrix Interpretation Processor:
    dimension: 1
    interpretation:
     [c](x0) = x0,
     
     [b](x0) = x0 + 1,
     
     [a](x0) = x0 + 3
    orientation:
     a(x1) = x1 + 3 >= x1 + 1 = b(x1)
     
     a(c(x1)) = x1 + 3 >= x1 + 7 = c(c(a(a(b(x1)))))
     
     a(x1) = x1 + 3 >= x1 = x1
     
     b(b(x1)) = x1 + 2 >= x1 = x1
    problem:
     strict:
      a(c(x1)) -> c(c(a(a(b(x1)))))
     weak:
      a(x1) -> b(x1)
      a(x1) -> x1
      b(b(x1)) -> x1
    Open