MAYBE

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

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