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

f(true, x, y, z) → f(and(gt(x, y), gt(x, z)), x, s(y), z)
f(true, x, y, z) → f(and(gt(x, y), gt(x, z)), x, y, s(z))
gt(0, v) → false
gt(s(u), 0) → true
gt(s(u), s(v)) → gt(u, v)
and(x, true) → x
and(x, false) → false

Rewrite Strategy: INNERMOST

Renamed function symbols to avoid clashes with predefined symbol.

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

f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, s'(y), z)
f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, y, s'(z))
gt'(0', v) → false'
gt'(s'(u), 0') → true'
gt'(s'(u), s'(v)) → gt'(u, v)
and'(x, true') → x
and'(x, false') → false'

Rewrite Strategy: INNERMOST

Infered types.

Rules:
f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, s'(y), z)
f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, y, s'(z))
gt'(0', v) → false'
gt'(s'(u), 0') → true'
gt'(s'(u), s'(v)) → gt'(u, v)
and'(x, true') → x
and'(x, false') → false'

Types:
f' :: true':false' → s':0' → s':0' → s':0' → f'
true' :: true':false'
and' :: true':false' → true':false' → true':false'
gt' :: s':0' → s':0' → true':false'
s' :: s':0' → s':0'
0' :: s':0'
false' :: true':false'
_hole_f'1 :: f'
_hole_true':false'2 :: true':false'
_hole_s':0'3 :: s':0'
_gen_s':0'4 :: Nat → s':0'

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

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

Rules:
f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, s'(y), z)
f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, y, s'(z))
gt'(0', v) → false'
gt'(s'(u), 0') → true'
gt'(s'(u), s'(v)) → gt'(u, v)
and'(x, true') → x
and'(x, false') → false'

Types:
f' :: true':false' → s':0' → s':0' → s':0' → f'
true' :: true':false'
and' :: true':false' → true':false' → true':false'
gt' :: s':0' → s':0' → true':false'
s' :: s':0' → s':0'
0' :: s':0'
false' :: true':false'
_hole_f'1 :: f'
_hole_true':false'2 :: true':false'
_hole_s':0'3 :: s':0'
_gen_s':0'4 :: Nat → s':0'

Generator Equations:
_gen_s':0'4(0) ⇔ 0'
_gen_s':0'4(+(x, 1)) ⇔ s'(_gen_s':0'4(x))

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

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

Proved the following rewrite lemma:
gt'(_gen_s':0'4(_n6), _gen_s':0'4(_n6)) → false', rt ∈ Ω(1 + n6)

Induction Base:
gt'(_gen_s':0'4(0), _gen_s':0'4(0)) →RΩ(1)
false'

Induction Step:
gt'(_gen_s':0'4(+(_\$n7, 1)), _gen_s':0'4(+(_\$n7, 1))) →RΩ(1)
gt'(_gen_s':0'4(_\$n7), _gen_s':0'4(_\$n7)) →IH
false'

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

Rules:
f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, s'(y), z)
f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, y, s'(z))
gt'(0', v) → false'
gt'(s'(u), 0') → true'
gt'(s'(u), s'(v)) → gt'(u, v)
and'(x, true') → x
and'(x, false') → false'

Types:
f' :: true':false' → s':0' → s':0' → s':0' → f'
true' :: true':false'
and' :: true':false' → true':false' → true':false'
gt' :: s':0' → s':0' → true':false'
s' :: s':0' → s':0'
0' :: s':0'
false' :: true':false'
_hole_f'1 :: f'
_hole_true':false'2 :: true':false'
_hole_s':0'3 :: s':0'
_gen_s':0'4 :: Nat → s':0'

Lemmas:
gt'(_gen_s':0'4(_n6), _gen_s':0'4(_n6)) → false', rt ∈ Ω(1 + n6)

Generator Equations:
_gen_s':0'4(0) ⇔ 0'
_gen_s':0'4(+(x, 1)) ⇔ s'(_gen_s':0'4(x))

The following defined symbols remain to be analysed:
f'

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

Rules:
f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, s'(y), z)
f'(true', x, y, z) → f'(and'(gt'(x, y), gt'(x, z)), x, y, s'(z))
gt'(0', v) → false'
gt'(s'(u), 0') → true'
gt'(s'(u), s'(v)) → gt'(u, v)
and'(x, true') → x
and'(x, false') → false'

Types:
f' :: true':false' → s':0' → s':0' → s':0' → f'
true' :: true':false'
and' :: true':false' → true':false' → true':false'
gt' :: s':0' → s':0' → true':false'
s' :: s':0' → s':0'
0' :: s':0'
false' :: true':false'
_hole_f'1 :: f'
_hole_true':false'2 :: true':false'
_hole_s':0'3 :: s':0'
_gen_s':0'4 :: Nat → s':0'

Lemmas:
gt'(_gen_s':0'4(_n6), _gen_s':0'4(_n6)) → false', rt ∈ Ω(1 + n6)

Generator Equations:
_gen_s':0'4(0) ⇔ 0'
_gen_s':0'4(+(x, 1)) ⇔ s'(_gen_s':0'4(x))

No more defined symbols left to analyse.

The lowerbound Ω(n) was proven with the following lemma:
gt'(_gen_s':0'4(_n6), _gen_s':0'4(_n6)) → false', rt ∈ Ω(1 + n6)