The Runtime Complexity (innermost) 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:

odd(S(x)) → even(x)
even(S(x)) → odd(x)
odd(0) → 0
even(0) → S(0)

Rewrite Strategy: INNERMOST

(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:

odd(S(x)) → even(x)
even(S(x)) → odd(x)
odd(0') → 0'
even(0') → S(0')

S is empty.
Rewrite Strategy: INNERMOST

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

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
odd(S(x)) → even(x)
even(S(x)) → odd(x)
odd(0') → 0'
even(0') → S(0')

Types:
odd :: S:0' → S:0'
S :: S:0' → S:0'
even :: 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:
odd, even

They will be analysed ascendingly in the following order:
odd = even

(6) Obligation:

Innermost TRS:
Rules:
odd(S(x)) → even(x)
even(S(x)) → odd(x)
odd(0') → 0'
even(0') → S(0')

Types:
odd :: S:0' → S:0'
S :: S:0' → S:0'
even :: 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:
even, odd

They will be analysed ascendingly in the following order:
odd = even

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

Proved the following rewrite lemma:
even(gen_S:0'2_0(*(2, n4_0))) → gen_S:0'2_0(1), rt ∈ Ω(1 + n4₀)

Induction Base:
even(gen_S:0'2_0(*(2, 0))) →_R^Ω(1)
S(0')

Induction Step:
even(gen_S:0'2_0(*(2, +(n4_0, 1)))) →_R^Ω(1)
odd(gen_S:0'2_0(+(1, *(2, n4_0)))) →_R^Ω(1)
even(gen_S:0'2_0(*(2, n4_0))) →_IH
gen_S:0'2_0(1)

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

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
odd(S(x)) → even(x)
even(S(x)) → odd(x)
odd(0') → 0'
even(0') → S(0')

Types:
odd :: S:0' → S:0'
S :: S:0' → S:0'
even :: S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
even(gen_S:0'2_0(*(2, n4_0))) → gen_S:0'2_0(1), rt ∈ Ω(1 + n4₀)

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:
odd

They will be analysed ascendingly in the following order:
odd = even

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol odd.

(11) Obligation:

Innermost TRS:
Rules:
odd(S(x)) → even(x)
even(S(x)) → odd(x)
odd(0') → 0'
even(0') → S(0')

Types:
odd :: S:0' → S:0'
S :: S:0' → S:0'
even :: S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
even(gen_S:0'2_0(*(2, n4_0))) → gen_S:0'2_0(1), rt ∈ Ω(1 + 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.

(12) LowerBoundsProof (EQUIVALENT transformation)

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

(13) BOUNDS(n^1, INF)

(14) Obligation:

Innermost TRS:
Rules:
odd(S(x)) → even(x)
even(S(x)) → odd(x)
odd(0') → 0'
even(0') → S(0')

Types:
odd :: S:0' → S:0'
S :: S:0' → S:0'
even :: S:0' → S:0'
0' :: S:0'
hole_S:0'1_0 :: S:0'
gen_S:0'2_0 :: Nat → S:0'

Lemmas:
even(gen_S:0'2_0(*(2, n4_0))) → gen_S:0'2_0(1), rt ∈ Ω(1 + 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.

(15) LowerBoundsProof (EQUIVALENT transformation)

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

(16) BOUNDS(n^1, INF)