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:

half(0) → 0
half(s(s(x))) → s(half(x))
log(s(0)) → 0
log(s(s(x))) → s(log(s(half(x))))

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:

half(0') → 0'
half(s(s(x))) → s(half(x))
log(s(0')) → 0'
log(s(s(x))) → s(log(s(half(x))))

S is empty.
Rewrite Strategy: FULL

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

Infered types.

(4) Obligation:

TRS:
Rules:
half(0') → 0'
half(s(s(x))) → s(half(x))
log(s(0')) → 0'
log(s(s(x))) → s(log(s(half(x))))

Types:
half :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
log :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

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

Heuristically decided to analyse the following defined symbols:
half, log

They will be analysed ascendingly in the following order:
half < log

(6) Obligation:

TRS:
Rules:
half(0') → 0'
half(s(s(x))) → s(half(x))
log(s(0')) → 0'
log(s(s(x))) → s(log(s(half(x))))

Types:
half :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
log :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
half, log

They will be analysed ascendingly in the following order:
half < log

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

Proved the following rewrite lemma:
half(gen_0':s2_0(*(2, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Induction Base:
half(gen_0':s2_0(*(2, 0))) →_R^Ω(1)
0'

Induction Step:
half(gen_0':s2_0(*(2, +(n4_0, 1)))) →_R^Ω(1)
s(half(gen_0':s2_0(*(2, n4_0)))) →_IH
s(gen_0':s2_0(c5_0))

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

(8) Complex Obligation (BEST)

(9) Obligation:

TRS:
Rules:
half(0') → 0'
half(s(s(x))) → s(half(x))
log(s(0')) → 0'
log(s(s(x))) → s(log(s(half(x))))

Types:
half :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
log :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
half(gen_0':s2_0(*(2, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
log

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

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

(11) Obligation:

TRS:
Rules:
half(0') → 0'
half(s(s(x))) → s(half(x))
log(s(0')) → 0'
log(s(s(x))) → s(log(s(half(x))))

Types:
half :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
log :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
half(gen_0':s2_0(*(2, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
half(gen_0':s2_0(*(2, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

TRS:
Rules:
half(0') → 0'
half(s(s(x))) → s(half(x))
log(s(0')) → 0'
log(s(s(x))) → s(log(s(half(x))))

Types:
half :: 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
log :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
half(gen_0':s2_0(*(2, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
half(gen_0':s2_0(*(2, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

(16) BOUNDS(n^1, INF)