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


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