TRS:
 {       first(0(), X) -> nil(),
  first(s(X), cons(Y)) -> cons(Y),
               from(X) -> cons(X)}
 RPO Product:
  Quasi-Precedence:
  empty
  
  Qed


TRS:
 {       first(0(), X) -> nil(),
  first(s(X), cons(Y)) -> cons(Y),
               from(X) -> cons(X)}
 Cdiprover:
  Interpretation class: quasisimplemixed
  Complexity bound: POLYTIME COMPUTABLE IF RPO-TERMINATING
  from(X4) = + 2*X4^2 + 2 + 2*X4
  s(X3) = + 1*X3 + 1
  cons(X2) = + 1*X2 + 1
  0 = + 0
  first(X1, X0) = + 0*X1^2 + 0*X0^2 + 2*X1 + 0 + 1*X0 + 0*X0*X1
  nil = + 0
  
  Qed