MAYBE

Problem:
 a(l(x1)) -> l(a(x1))
 a(c(x1)) -> c(a(x1))
 c(a(r(x1))) -> r(a(x1))
 l(r(a(a(x1)))) -> a(a(l(c(c(c(r(x1)))))))

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