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:

le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
minus(x, x) → 0
minus(x, 0) → x
minus(0, x) → 0
minus(s(x), s(y)) → minus(x, y)
isZero(0) → true
isZero(s(x)) → false
mod(x, y) → if_mod(isZero(y), le(y, x), x, y, minus(x, y))
if_mod(true, b, x, y, z) → divByZeroError
if_mod(false, false, x, y, z) → x
if_mod(false, true, x, y, z) → mod(z, y)

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:

le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, x) → 0'
minus(x, 0') → x
minus(0', x) → 0'
minus(s(x), s(y)) → minus(x, y)
isZero(0') → true
isZero(s(x)) → false
mod(x, y) → if_mod(isZero(y), le(y, x), x, y, minus(x, y))
if_mod(true, b, x, y, z) → divByZeroError
if_mod(false, false, x, y, z) → x
if_mod(false, true, x, y, z) → mod(z, y)

S is empty.
Rewrite Strategy: INNERMOST

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

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, x) → 0'
minus(x, 0') → x
minus(0', x) → 0'
minus(s(x), s(y)) → minus(x, y)
isZero(0') → true
isZero(s(x)) → false
mod(x, y) → if_mod(isZero(y), le(y, x), x, y, minus(x, y))
if_mod(true, b, x, y, z) → divByZeroError
if_mod(false, false, x, y, z) → x
if_mod(false, true, x, y, z) → mod(z, y)

Types:
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
isZero :: 0':s:divByZeroError → true:false
mod :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_mod :: true:false → true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

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

Heuristically decided to analyse the following defined symbols:
le, minus, mod

They will be analysed ascendingly in the following order:
le < mod
minus < mod

(6) Obligation:

Innermost TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, x) → 0'
minus(x, 0') → x
minus(0', x) → 0'
minus(s(x), s(y)) → minus(x, y)
isZero(0') → true
isZero(s(x)) → false
mod(x, y) → if_mod(isZero(y), le(y, x), x, y, minus(x, y))
if_mod(true, b, x, y, z) → divByZeroError
if_mod(false, false, x, y, z) → x
if_mod(false, true, x, y, z) → mod(z, y)

Types:
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
isZero :: 0':s:divByZeroError → true:false
mod :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_mod :: true:false → true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

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

The following defined symbols remain to be analysed:
le, minus, mod

They will be analysed ascendingly in the following order:
le < mod
minus < mod

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

Proved the following rewrite lemma:
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Induction Base:
le(gen_0':s:divByZeroError3_0(0), gen_0':s:divByZeroError3_0(0)) →_R^Ω(1)
true

Induction Step:
le(gen_0':s:divByZeroError3_0(+(n5_0, 1)), gen_0':s:divByZeroError3_0(+(n5_0, 1))) →_R^Ω(1)
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) →_IH
true

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

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, x) → 0'
minus(x, 0') → x
minus(0', x) → 0'
minus(s(x), s(y)) → minus(x, y)
isZero(0') → true
isZero(s(x)) → false
mod(x, y) → if_mod(isZero(y), le(y, x), x, y, minus(x, y))
if_mod(true, b, x, y, z) → divByZeroError
if_mod(false, false, x, y, z) → x
if_mod(false, true, x, y, z) → mod(z, y)

Types:
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
isZero :: 0':s:divByZeroError → true:false
mod :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_mod :: true:false → true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

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

The following defined symbols remain to be analysed:
minus, mod

They will be analysed ascendingly in the following order:
minus < mod

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
minus(gen_0':s:divByZeroError3_0(n342_0), gen_0':s:divByZeroError3_0(n342_0)) → gen_0':s:divByZeroError3_0(0), rt ∈ Ω(1 + n342₀)

Induction Base:
minus(gen_0':s:divByZeroError3_0(0), gen_0':s:divByZeroError3_0(0)) →_R^Ω(1)
0'

Induction Step:
minus(gen_0':s:divByZeroError3_0(+(n342_0, 1)), gen_0':s:divByZeroError3_0(+(n342_0, 1))) →_R^Ω(1)
minus(gen_0':s:divByZeroError3_0(n342_0), gen_0':s:divByZeroError3_0(n342_0)) →_IH
gen_0':s:divByZeroError3_0(0)

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

(11) Complex Obligation (BEST)

(12) Obligation:

Innermost TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, x) → 0'
minus(x, 0') → x
minus(0', x) → 0'
minus(s(x), s(y)) → minus(x, y)
isZero(0') → true
isZero(s(x)) → false
mod(x, y) → if_mod(isZero(y), le(y, x), x, y, minus(x, y))
if_mod(true, b, x, y, z) → divByZeroError
if_mod(false, false, x, y, z) → x
if_mod(false, true, x, y, z) → mod(z, y)

Types:
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
isZero :: 0':s:divByZeroError → true:false
mod :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_mod :: true:false → true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s:divByZeroError3_0(n342_0), gen_0':s:divByZeroError3_0(n342_0)) → gen_0':s:divByZeroError3_0(0), rt ∈ Ω(1 + n342₀)

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

The following defined symbols remain to be analysed:
mod

(13) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

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

(14) Obligation:

Innermost TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, x) → 0'
minus(x, 0') → x
minus(0', x) → 0'
minus(s(x), s(y)) → minus(x, y)
isZero(0') → true
isZero(s(x)) → false
mod(x, y) → if_mod(isZero(y), le(y, x), x, y, minus(x, y))
if_mod(true, b, x, y, z) → divByZeroError
if_mod(false, false, x, y, z) → x
if_mod(false, true, x, y, z) → mod(z, y)

Types:
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
isZero :: 0':s:divByZeroError → true:false
mod :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_mod :: true:false → true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s:divByZeroError3_0(n342_0), gen_0':s:divByZeroError3_0(n342_0)) → gen_0':s:divByZeroError3_0(0), rt ∈ Ω(1 + n342₀)

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

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(16) BOUNDS(n^1, INF)

(17) Obligation:

Innermost TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, x) → 0'
minus(x, 0') → x
minus(0', x) → 0'
minus(s(x), s(y)) → minus(x, y)
isZero(0') → true
isZero(s(x)) → false
mod(x, y) → if_mod(isZero(y), le(y, x), x, y, minus(x, y))
if_mod(true, b, x, y, z) → divByZeroError
if_mod(false, false, x, y, z) → x
if_mod(false, true, x, y, z) → mod(z, y)

Types:
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
isZero :: 0':s:divByZeroError → true:false
mod :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_mod :: true:false → true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s:divByZeroError3_0(n342_0), gen_0':s:divByZeroError3_0(n342_0)) → gen_0':s:divByZeroError3_0(0), rt ∈ Ω(1 + n342₀)

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

No more defined symbols left to analyse.

(18) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(19) BOUNDS(n^1, INF)

(20) Obligation:

Innermost TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
minus(x, x) → 0'
minus(x, 0') → x
minus(0', x) → 0'
minus(s(x), s(y)) → minus(x, y)
isZero(0') → true
isZero(s(x)) → false
mod(x, y) → if_mod(isZero(y), le(y, x), x, y, minus(x, y))
if_mod(true, b, x, y, z) → divByZeroError
if_mod(false, false, x, y, z) → x
if_mod(false, true, x, y, z) → mod(z, y)

Types:
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
0' :: 0':s:divByZeroError
true :: true:false
s :: 0':s:divByZeroError → 0':s:divByZeroError
false :: true:false
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
isZero :: 0':s:divByZeroError → true:false
mod :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_mod :: true:false → true:false → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_true:false1_0 :: true:false
hole_0':s:divByZeroError2_0 :: 0':s:divByZeroError
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

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

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
le(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(22) BOUNDS(n^1, INF)