TRS:
 {   f(x, x) -> a(),
  f(g(x), y) -> f(x, y)}
 RPO Product:
  Quasi-Precedence:
  empty
  
  Qed


TRS:
 {   f(x, x) -> a(),
  f(g(x), y) -> f(x, y)}
 Cdiprover:
  Interpretation class: quasisimplemixed
  Complexity bound: POLYTIME COMPUTABLE IF RPO-TERMINATING
  g(X2) = + 1*X2 + 1
  f(X1, X0) = + 0*X1^2 + 0*X0^2 + 2*X1 + 0 + 2*X0 + 0*X0*X1
  a = + 0
  
  Qed