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