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

minus(0, y) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
plus(0, y) → y
plus(s(x), y) → plus(x, s(y))
zero(s(x)) → false
zero(0) → true
p(s(x)) → x
div(x, y) → quot(x, y, 0)
quot(x, y, z) → if(zero(x), x, y, plus(z, s(0)))
if(true, x, y, z) → p(z)
if(false, x, s(y), z) → quot(minus(x, s(y)), s(y), z)

Rewrite Strategy: INNERMOST

Renamed function symbols to avoid clashes with predefined symbol.

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

minus'(0', y) → 0'
minus'(x, 0') → x
minus'(s'(x), s'(y)) → minus'(x, y)
plus'(0', y) → y
plus'(s'(x), y) → plus'(x, s'(y))
zero'(s'(x)) → false'
zero'(0') → true'
p'(s'(x)) → x
div'(x, y) → quot'(x, y, 0')
quot'(x, y, z) → if'(zero'(x), x, y, plus'(z, s'(0')))
if'(true', x, y, z) → p'(z)
if'(false', x, s'(y), z) → quot'(minus'(x, s'(y)), s'(y), z)

Rewrite Strategy: INNERMOST

Infered types.

Rules:
minus'(0', y) → 0'
minus'(x, 0') → x
minus'(s'(x), s'(y)) → minus'(x, y)
plus'(0', y) → y
plus'(s'(x), y) → plus'(x, s'(y))
zero'(s'(x)) → false'
zero'(0') → true'
p'(s'(x)) → x
div'(x, y) → quot'(x, y, 0')
quot'(x, y, z) → if'(zero'(x), x, y, plus'(z, s'(0')))
if'(true', x, y, z) → p'(z)
if'(false', x, s'(y), z) → quot'(minus'(x, s'(y)), s'(y), z)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
plus' :: 0':s' → 0':s' → 0':s'
zero' :: 0':s' → false':true'
false' :: false':true'
true' :: false':true'
p' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
quot' :: 0':s' → 0':s' → 0':s' → 0':s'
if' :: false':true' → 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_hole_false':true'2 :: false':true'
_gen_0':s'3 :: Nat → 0':s'

Heuristically decided to analyse the following defined symbols:
minus', plus', quot'

They will be analysed ascendingly in the following order:
minus' < quot'
plus' < quot'

Rules:
minus'(0', y) → 0'
minus'(x, 0') → x
minus'(s'(x), s'(y)) → minus'(x, y)
plus'(0', y) → y
plus'(s'(x), y) → plus'(x, s'(y))
zero'(s'(x)) → false'
zero'(0') → true'
p'(s'(x)) → x
div'(x, y) → quot'(x, y, 0')
quot'(x, y, z) → if'(zero'(x), x, y, plus'(z, s'(0')))
if'(true', x, y, z) → p'(z)
if'(false', x, s'(y), z) → quot'(minus'(x, s'(y)), s'(y), z)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
plus' :: 0':s' → 0':s' → 0':s'
zero' :: 0':s' → false':true'
false' :: false':true'
true' :: false':true'
p' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
quot' :: 0':s' → 0':s' → 0':s' → 0':s'
if' :: false':true' → 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_hole_false':true'2 :: false':true'
_gen_0':s'3 :: Nat → 0':s'

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

The following defined symbols remain to be analysed:
minus', plus', quot'

They will be analysed ascendingly in the following order:
minus' < quot'
plus' < quot'

Proved the following rewrite lemma:
minus'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(0), rt ∈ Ω(1 + n5)

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

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

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

Rules:
minus'(0', y) → 0'
minus'(x, 0') → x
minus'(s'(x), s'(y)) → minus'(x, y)
plus'(0', y) → y
plus'(s'(x), y) → plus'(x, s'(y))
zero'(s'(x)) → false'
zero'(0') → true'
p'(s'(x)) → x
div'(x, y) → quot'(x, y, 0')
quot'(x, y, z) → if'(zero'(x), x, y, plus'(z, s'(0')))
if'(true', x, y, z) → p'(z)
if'(false', x, s'(y), z) → quot'(minus'(x, s'(y)), s'(y), z)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
plus' :: 0':s' → 0':s' → 0':s'
zero' :: 0':s' → false':true'
false' :: false':true'
true' :: false':true'
p' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
quot' :: 0':s' → 0':s' → 0':s' → 0':s'
if' :: false':true' → 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_hole_false':true'2 :: false':true'
_gen_0':s'3 :: Nat → 0':s'

Lemmas:
minus'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(0), rt ∈ Ω(1 + n5)

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

The following defined symbols remain to be analysed:
plus', quot'

They will be analysed ascendingly in the following order:
plus' < quot'

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

The following conjecture could not be proven:

plus'(_gen_0':s'3(_n769), _gen_0':s'3(b)) →? _gen_0':s'3(+(_n769, b))

Rules:
minus'(0', y) → 0'
minus'(x, 0') → x
minus'(s'(x), s'(y)) → minus'(x, y)
plus'(0', y) → y
plus'(s'(x), y) → plus'(x, s'(y))
zero'(s'(x)) → false'
zero'(0') → true'
p'(s'(x)) → x
div'(x, y) → quot'(x, y, 0')
quot'(x, y, z) → if'(zero'(x), x, y, plus'(z, s'(0')))
if'(true', x, y, z) → p'(z)
if'(false', x, s'(y), z) → quot'(minus'(x, s'(y)), s'(y), z)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
plus' :: 0':s' → 0':s' → 0':s'
zero' :: 0':s' → false':true'
false' :: false':true'
true' :: false':true'
p' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
quot' :: 0':s' → 0':s' → 0':s' → 0':s'
if' :: false':true' → 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_hole_false':true'2 :: false':true'
_gen_0':s'3 :: Nat → 0':s'

Lemmas:
minus'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(0), rt ∈ Ω(1 + n5)

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

The following defined symbols remain to be analysed:
quot'

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

Rules:
minus'(0', y) → 0'
minus'(x, 0') → x
minus'(s'(x), s'(y)) → minus'(x, y)
plus'(0', y) → y
plus'(s'(x), y) → plus'(x, s'(y))
zero'(s'(x)) → false'
zero'(0') → true'
p'(s'(x)) → x
div'(x, y) → quot'(x, y, 0')
quot'(x, y, z) → if'(zero'(x), x, y, plus'(z, s'(0')))
if'(true', x, y, z) → p'(z)
if'(false', x, s'(y), z) → quot'(minus'(x, s'(y)), s'(y), z)

Types:
minus' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
plus' :: 0':s' → 0':s' → 0':s'
zero' :: 0':s' → false':true'
false' :: false':true'
true' :: false':true'
p' :: 0':s' → 0':s'
div' :: 0':s' → 0':s' → 0':s'
quot' :: 0':s' → 0':s' → 0':s' → 0':s'
if' :: false':true' → 0':s' → 0':s' → 0':s' → 0':s'
_hole_0':s'1 :: 0':s'
_hole_false':true'2 :: false':true'
_gen_0':s'3 :: Nat → 0':s'

Lemmas:
minus'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(0), rt ∈ Ω(1 + n5)

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

No more defined symbols left to analyse.

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