TRS:
 {f(g(X)) -> f(X)}
 RPO Product:
  Quasi-Precedence:
  empty
  
  Qed


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