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

Strict Trs:
  { f(c(s(x), y)) -> f(c(x, s(y)))
  , g(c(x, s(y))) -> g(c(s(x), y))
  , g(s(f(x))) -> g(f(x)) }
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_0(3) -> 1
, f_1(5) -> 1
, c_0(2, 2) -> 2
, c_0(2, 3) -> 2
, c_0(3, 2) -> 2
, c_0(3, 3) -> 2
, c_1(2, 6) -> 5
, c_1(3, 6) -> 5
, c_1(6, 2) -> 7
, c_1(6, 3) -> 7
, s_0(2) -> 3
, s_0(3) -> 3
, s_1(2) -> 6
, s_1(3) -> 6
, s_1(6) -> 6
, g_0(2) -> 4
, g_0(3) -> 4
, g_1(7) -> 4 }

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