MAYBE

Problem:
 f(g(X)) -> g(f(f(X)))
 f(h(X)) -> h(g(X))

Proof:
 Complexity Transformation Processor:
  strict:
   f(g(X)) -> g(f(f(X)))
   f(h(X)) -> h(g(X))
  weak:
   
  Matrix Interpretation Processor:
   dimension: 1
   max_matrix:
    1
    interpretation:
     [h](x0) = x0 + 1,
     
     [f](x0) = x0 + 1,
     
     [g](x0) = x0
    orientation:
     f(g(X)) = X + 1 >= X + 2 = g(f(f(X)))
     
     f(h(X)) = X + 2 >= X + 1 = h(g(X))
    problem:
     strict:
      f(g(X)) -> g(f(f(X)))
     weak:
      f(h(X)) -> h(g(X))
    Open