YES(?,O(n^1))

We are left with following problem, upon which TcT provides the
certificate YES(?,O(n^1)).

Strict Trs:
  { f(s(X)) -> f(X)
  , g(cons(s(X), Y)) -> s(X)
  , g(cons(0(), Y)) -> g(Y)
  , h(cons(X, Y)) -> h(g(cons(X, Y))) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,O(n^1))

The problem is match-bounded by 1. The enriched problem is
compatible with the following automaton.
{ f_0(2) -> 1
, f_1(2) -> 1
, s_0(2) -> 2
, s_1(2) -> 1
, s_1(2) -> 3
, g_0(2) -> 1
, g_1(2) -> 1
, g_1(2) -> 3
, g_1(4) -> 3
, cons_0(2, 2) -> 2
, cons_1(2, 2) -> 4
, 0_0() -> 2
, h_0(2) -> 1
, h_1(3) -> 1 }

Hurray, we answered YES(?,O(n^1))