MAYBE

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

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