MAYBE

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

Proof:
 Complexity Transformation Processor:
  strict:
   a(a(x1)) -> c(b(x1))
   b(b(x1)) -> c(a(x1))
   c(c(x1)) -> b(a(x1))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [c](x0) = x0,
     
     [b](x0) = x0,
     
     [a](x0) = x0 + 1
    orientation:
     a(a(x1)) = x1 + 2 >= x1 = c(b(x1))
     
     b(b(x1)) = x1 >= x1 + 1 = c(a(x1))
     
     c(c(x1)) = x1 >= x1 + 1 = b(a(x1))
    problem:
     strict:
      b(b(x1)) -> c(a(x1))
      c(c(x1)) -> b(a(x1))
     weak:
      a(a(x1)) -> c(b(x1))
    Matrix Interpretation Processor:
     dimension: 1
     max_matrix:
      1
      interpretation:
       [c](x0) = x0 + 1,
       
       [b](x0) = x0,
       
       [a](x0) = x0 + 1
      orientation:
       b(b(x1)) = x1 >= x1 + 2 = c(a(x1))
       
       c(c(x1)) = x1 + 2 >= x1 + 1 = b(a(x1))
       
       a(a(x1)) = x1 + 2 >= x1 + 1 = c(b(x1))
      problem:
       strict:
        b(b(x1)) -> c(a(x1))
       weak:
        c(c(x1)) -> b(a(x1))
        a(a(x1)) -> c(b(x1))
      Open