MAYBE

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

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