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

minus(x, x) → 0
minus(s(x), s(y)) → minus(x, y)
minus(0, x) → 0
minus(x, 0) → x
div(s(x), s(y)) → s(div(minus(x, y), s(y)))
div(0, s(y)) → 0
f(x, 0, b) → x
f(x, s(y), b) → div(f(x, minus(s(y), s(0)), b), b)

Rewrite Strategy: INNERMOST

Renamed function symbols to avoid clashes with predefined symbol.

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

minus'(x, x) → 0'
minus'(s'(x), s'(y)) → minus'(x, y)
minus'(0', x) → 0'
minus'(x, 0') → x
div'(s'(x), s'(y)) → s'(div'(minus'(x, y), s'(y)))
div'(0', s'(y)) → 0'
f'(x, 0', b) → x
f'(x, s'(y), b) → div'(f'(x, minus'(s'(y), s'(0')), b), b)

Rewrite Strategy: INNERMOST

Infered types.

Rules:
minus'(x, x) → 0'
minus'(s'(x), s'(y)) → minus'(x, y)
minus'(0', x) → 0'
minus'(x, 0') → x
div'(s'(x), s'(y)) → s'(div'(minus'(x, y), s'(y)))
div'(0', s'(y)) → 0'
f'(x, 0', b) → x
f'(x, s'(y), b) → div'(f'(x, minus'(s'(y), s'(0')), b), b)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_gen_0':s'2 :: Nat → 0':s'

Heuristically decided to analyse the following defined symbols:
minus', div', f'

They will be analysed ascendingly in the following order:
minus' < div'
minus' < f'
div' < f'

Rules:
minus'(x, x) → 0'
minus'(s'(x), s'(y)) → minus'(x, y)
minus'(0', x) → 0'
minus'(x, 0') → x
div'(s'(x), s'(y)) → s'(div'(minus'(x, y), s'(y)))
div'(0', s'(y)) → 0'
f'(x, 0', b) → x
f'(x, s'(y), b) → div'(f'(x, minus'(s'(y), s'(0')), b), b)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_gen_0':s'2 :: Nat → 0':s'

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

The following defined symbols remain to be analysed:
minus', div', f'

They will be analysed ascendingly in the following order:
minus' < div'
minus' < f'
div' < f'

Proved the following rewrite lemma:
minus'(_gen_0':s'2(_n4), _gen_0':s'2(_n4)) → _gen_0':s'2(0), rt ∈ Ω(1 + n4)

Induction Base:
minus'(_gen_0':s'2(0), _gen_0':s'2(0)) →RΩ(1)
0'

Induction Step:
minus'(_gen_0':s'2(+(_\$n5, 1)), _gen_0':s'2(+(_\$n5, 1))) →RΩ(1)
minus'(_gen_0':s'2(_\$n5), _gen_0':s'2(_\$n5)) →IH
_gen_0':s'2(0)

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

Rules:
minus'(x, x) → 0'
minus'(s'(x), s'(y)) → minus'(x, y)
minus'(0', x) → 0'
minus'(x, 0') → x
div'(s'(x), s'(y)) → s'(div'(minus'(x, y), s'(y)))
div'(0', s'(y)) → 0'
f'(x, 0', b) → x
f'(x, s'(y), b) → div'(f'(x, minus'(s'(y), s'(0')), b), b)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_gen_0':s'2 :: Nat → 0':s'

Lemmas:
minus'(_gen_0':s'2(_n4), _gen_0':s'2(_n4)) → _gen_0':s'2(0), rt ∈ Ω(1 + n4)

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

The following defined symbols remain to be analysed:
div', f'

They will be analysed ascendingly in the following order:
div' < f'

Could not prove a rewrite lemma for the defined symbol div'.

Rules:
minus'(x, x) → 0'
minus'(s'(x), s'(y)) → minus'(x, y)
minus'(0', x) → 0'
minus'(x, 0') → x
div'(s'(x), s'(y)) → s'(div'(minus'(x, y), s'(y)))
div'(0', s'(y)) → 0'
f'(x, 0', b) → x
f'(x, s'(y), b) → div'(f'(x, minus'(s'(y), s'(0')), b), b)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_gen_0':s'2 :: Nat → 0':s'

Lemmas:
minus'(_gen_0':s'2(_n4), _gen_0':s'2(_n4)) → _gen_0':s'2(0), rt ∈ Ω(1 + n4)

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

The following defined symbols remain to be analysed:
f'

Could not prove a rewrite lemma for the defined symbol f'.

Rules:
minus'(x, x) → 0'
minus'(s'(x), s'(y)) → minus'(x, y)
minus'(0', x) → 0'
minus'(x, 0') → x
div'(s'(x), s'(y)) → s'(div'(minus'(x, y), s'(y)))
div'(0', s'(y)) → 0'
f'(x, 0', b) → x
f'(x, s'(y), b) → div'(f'(x, minus'(s'(y), s'(0')), b), b)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_gen_0':s'2 :: Nat → 0':s'

Lemmas:
minus'(_gen_0':s'2(_n4), _gen_0':s'2(_n4)) → _gen_0':s'2(0), rt ∈ Ω(1 + n4)

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

No more defined symbols left to analyse.

The lowerbound Ω(n) was proven with the following lemma:
minus'(_gen_0':s'2(_n4), _gen_0':s'2(_n4)) → _gen_0':s'2(0), rt ∈ Ω(1 + n4)