The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

average(s(x), y) → average(x, s(y))
average(x, s(s(s(y)))) → s(average(s(x), y))
average(0, 0) → 0
average(0, s(0)) → 0
average(0, s(s(0))) → s(0)

Rewrite Strategy: FULL

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

average(s(x), y) → average(x, s(y))
average(x, s(s(s(y)))) → s(average(s(x), y))
average(0', 0') → 0'
average(0', s(0')) → 0'
average(0', s(s(0'))) → s(0')

S is empty.
Rewrite Strategy: FULL

(3) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(4) Obligation:

TRS:
Rules:
average(s(x), y) → average(x, s(y))
average(x, s(s(s(y)))) → s(average(s(x), y))
average(0', 0') → 0'
average(0', s(0')) → 0'
average(0', s(s(0'))) → s(0')

Types:
average :: s:0' → s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
hole_s:0'1_0 :: s:0'
gen_s:0'2_0 :: Nat → s:0'

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
average

(6) Obligation:

TRS:
Rules:
average(s(x), y) → average(x, s(y))
average(x, s(s(s(y)))) → s(average(s(x), y))
average(0', 0') → 0'
average(0', s(0')) → 0'
average(0', s(s(0'))) → s(0')

Types:
average :: s:0' → s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
hole_s:0'1_0 :: s:0'
gen_s:0'2_0 :: Nat → s:0'

Generator Equations:
gen_s:0'2_0(0) ⇔ 0'
gen_s:0'2_0(+(x, 1)) ⇔ s(gen_s:0'2_0(x))

The following defined symbols remain to be analysed:
average

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
average(gen_s:0'2_0(+(1, n4_0)), gen_s:0'2_0(b)) → *3_0, rt ∈ Ω(n4₀)

Induction Base:
average(gen_s:0'2_0(+(1, 0)), gen_s:0'2_0(b))

Induction Step:
average(gen_s:0'2_0(+(1, +(n4_0, 1))), gen_s:0'2_0(b)) →_R^Ω(1)
average(gen_s:0'2_0(+(1, n4_0)), s(gen_s:0'2_0(b))) →_IH
*3_0

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
average(s(x), y) → average(x, s(y))
average(x, s(s(s(y)))) → s(average(s(x), y))
average(0', 0') → 0'
average(0', s(0')) → 0'
average(0', s(s(0'))) → s(0')

Types:
average :: s:0' → s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
hole_s:0'1_0 :: s:0'
gen_s:0'2_0 :: Nat → s:0'

Lemmas:
average(gen_s:0'2_0(+(1, n4_0)), gen_s:0'2_0(b)) → *3_0, rt ∈ Ω(n4₀)

Generator Equations:
gen_s:0'2_0(0) ⇔ 0'
gen_s:0'2_0(+(x, 1)) ⇔ s(gen_s:0'2_0(x))

No more defined symbols left to analyse.

(10) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
average(gen_s:0'2_0(+(1, n4_0)), gen_s:0'2_0(b)) → *3_0, rt ∈ Ω(n4₀)

(11) BOUNDS(n^1, INF)

(12) Obligation:

TRS:
Rules:
average(s(x), y) → average(x, s(y))
average(x, s(s(s(y)))) → s(average(s(x), y))
average(0', 0') → 0'
average(0', s(0')) → 0'
average(0', s(s(0'))) → s(0')

Types:
average :: s:0' → s:0' → s:0'
s :: s:0' → s:0'
0' :: s:0'
hole_s:0'1_0 :: s:0'
gen_s:0'2_0 :: Nat → s:0'

Lemmas:
average(gen_s:0'2_0(+(1, n4_0)), gen_s:0'2_0(b)) → *3_0, rt ∈ Ω(n4₀)

Generator Equations:
gen_s:0'2_0(0) ⇔ 0'
gen_s:0'2_0(+(x, 1)) ⇔ s(gen_s:0'2_0(x))

No more defined symbols left to analyse.

(13) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
average(gen_s:0'2_0(+(1, n4_0)), gen_s:0'2_0(b)) → *3_0, rt ∈ Ω(n4₀)

(14) BOUNDS(n^1, INF)