Problem:
 f(x,x) -> a()
 f(g(x),y) -> f(x,y)

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