MAYBE

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

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