YES(?,O(n^1))

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

Strict Trs:
  { rec[fold_0][3](Nil()) -> 0()
  , rec[fold_0][3](Cons(x10, x6)) ->
    rec[plus_0][2](x10, rec[fold_0][3](x6))
  , rec[plus_0][2](0(), x18) -> x18
  , rec[plus_0][2](S(x10), x6) -> S(rec[plus_0][2](x10, x6))
  , main(x3) -> rec[fold_0][3](x3) }
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.
{ Nil_0() -> 1
, Nil_0() -> 2
, Nil_0() -> 4
, rec[fold_0][3]_0(2) -> 1
, rec[fold_0][3]_1(2) -> 1
, rec[fold_0][3]_1(2) -> 3
, 0_0() -> 1
, 0_0() -> 2
, 0_0() -> 4
, 0_1() -> 1
, 0_1() -> 3
, Cons_0(2, 2) -> 1
, Cons_0(2, 2) -> 2
, Cons_0(2, 2) -> 4
, rec[plus_0][2]_0(2, 2) -> 1
, rec[plus_0][2]_1(2, 2) -> 4
, rec[plus_0][2]_1(2, 3) -> 1
, rec[plus_0][2]_1(2, 3) -> 3
, S_0(2) -> 1
, S_0(2) -> 2
, S_0(2) -> 4
, S_1(1) -> 1
, S_1(3) -> 1
, S_1(3) -> 3
, S_1(4) -> 1
, S_1(4) -> 4
, main_0(2) -> 1
, 2 -> 1
, 2 -> 4
, 3 -> 1 }

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