YES(?,O(n^1))

Problem:
 f(f(x)) -> g(f(x))

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