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


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