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


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