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


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