MAYBE

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

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