MAYBE

Problem:
 a(p(x1)) -> p(a(A(x1)))
 a(A(x1)) -> A(a(x1))
 p(A(A(x1))) -> a(p(x1))

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