TRS:
 {   f(empty(), l) -> l,
  f(cons(x, k), l) -> g(k, l, cons(x, k)),
        g(a, b, c) -> f(a, cons(b, c))}
 Cdiprover:
  Interpretation class: pizerosimplemixed
  Complexity bound: POLYTIME COMPUTABLE
  cons(X6, X5) = + 1*X5 + 1*X6 + 1
  g(X4, X3, X2) = + 2*X4^2 + 0*X3^2 + 0*X2^2 + 0*X3*X4 + 1*X3 + 2 + 2*X4 + 0*X2*X4 + 1*X2 + 0*X2*X3 + 0*X2*X3*X4
  empty = + 1
  f(X1, X0) = + 2*X1^2 + 0*X0^2 + 2*X1 + 0 + 1*X0 + 0*X0*X1
  
  Qed