MAYBE

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

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