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:

ge(x, 0) → true
ge(0, s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0) → x
minus(0, y) → 0
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0)
div(x, y, z) → if(ge(y, s(0)), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

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:

ge(x, 0') → true
ge(0', s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(0', y) → 0'
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0')
div(x, y, z) → if(ge(y, s(0')), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

S is empty.
Rewrite Strategy: FULL

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

Infered types.

(4) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(0', y) → 0'
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0')
div(x, y, z) → if(ge(y, s(0')), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

Types:
ge :: 0':s:div_by_zero → 0':s:div_by_zero → true:false
0' :: 0':s:div_by_zero
true :: true:false
s :: 0':s:div_by_zero → 0':s:div_by_zero
false :: true:false
minus :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
id_inc :: 0':s:div_by_zero → 0':s:div_by_zero
quot :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
if :: true:false → true:false → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div_by_zero :: 0':s:div_by_zero
hole_true:false1_0 :: true:false
hole_0':s:div_by_zero2_0 :: 0':s:div_by_zero
gen_0':s:div_by_zero3_0 :: Nat → 0':s:div_by_zero

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

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

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

(6) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(0', y) → 0'
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0')
div(x, y, z) → if(ge(y, s(0')), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

Types:
ge :: 0':s:div_by_zero → 0':s:div_by_zero → true:false
0' :: 0':s:div_by_zero
true :: true:false
s :: 0':s:div_by_zero → 0':s:div_by_zero
false :: true:false
minus :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
id_inc :: 0':s:div_by_zero → 0':s:div_by_zero
quot :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
if :: true:false → true:false → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div_by_zero :: 0':s:div_by_zero
hole_true:false1_0 :: true:false
hole_0':s:div_by_zero2_0 :: 0':s:div_by_zero
gen_0':s:div_by_zero3_0 :: Nat → 0':s:div_by_zero

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

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

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

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

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

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

Induction Step:
ge(gen_0':s:div_by_zero3_0(+(n5_0, 1)), gen_0':s:div_by_zero3_0(+(n5_0, 1))) →_R^Ω(1)
ge(gen_0':s:div_by_zero3_0(n5_0), gen_0':s:div_by_zero3_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:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(0', y) → 0'
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0')
div(x, y, z) → if(ge(y, s(0')), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

Types:
ge :: 0':s:div_by_zero → 0':s:div_by_zero → true:false
0' :: 0':s:div_by_zero
true :: true:false
s :: 0':s:div_by_zero → 0':s:div_by_zero
false :: true:false
minus :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
id_inc :: 0':s:div_by_zero → 0':s:div_by_zero
quot :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
if :: true:false → true:false → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div_by_zero :: 0':s:div_by_zero
hole_true:false1_0 :: true:false
hole_0':s:div_by_zero2_0 :: 0':s:div_by_zero
gen_0':s:div_by_zero3_0 :: Nat → 0':s:div_by_zero

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

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

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

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

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

Proved the following rewrite lemma:
minus(gen_0':s:div_by_zero3_0(n294_0), gen_0':s:div_by_zero3_0(n294_0)) → gen_0':s:div_by_zero3_0(0), rt ∈ Ω(1 + n294₀)

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

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

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

(11) Complex Obligation (BEST)

(12) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(0', y) → 0'
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0')
div(x, y, z) → if(ge(y, s(0')), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

Types:
ge :: 0':s:div_by_zero → 0':s:div_by_zero → true:false
0' :: 0':s:div_by_zero
true :: true:false
s :: 0':s:div_by_zero → 0':s:div_by_zero
false :: true:false
minus :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
id_inc :: 0':s:div_by_zero → 0':s:div_by_zero
quot :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
if :: true:false → true:false → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div_by_zero :: 0':s:div_by_zero
hole_true:false1_0 :: true:false
hole_0':s:div_by_zero2_0 :: 0':s:div_by_zero
gen_0':s:div_by_zero3_0 :: Nat → 0':s:div_by_zero

Lemmas:
ge(gen_0':s:div_by_zero3_0(n5_0), gen_0':s:div_by_zero3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s:div_by_zero3_0(n294_0), gen_0':s:div_by_zero3_0(n294_0)) → gen_0':s:div_by_zero3_0(0), rt ∈ Ω(1 + n294₀)

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

The following defined symbols remain to be analysed:
div

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

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

(14) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(0', y) → 0'
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0')
div(x, y, z) → if(ge(y, s(0')), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

Types:
ge :: 0':s:div_by_zero → 0':s:div_by_zero → true:false
0' :: 0':s:div_by_zero
true :: true:false
s :: 0':s:div_by_zero → 0':s:div_by_zero
false :: true:false
minus :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
id_inc :: 0':s:div_by_zero → 0':s:div_by_zero
quot :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
if :: true:false → true:false → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div_by_zero :: 0':s:div_by_zero
hole_true:false1_0 :: true:false
hole_0':s:div_by_zero2_0 :: 0':s:div_by_zero
gen_0':s:div_by_zero3_0 :: Nat → 0':s:div_by_zero

Lemmas:
ge(gen_0':s:div_by_zero3_0(n5_0), gen_0':s:div_by_zero3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s:div_by_zero3_0(n294_0), gen_0':s:div_by_zero3_0(n294_0)) → gen_0':s:div_by_zero3_0(0), rt ∈ Ω(1 + n294₀)

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

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

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

(16) BOUNDS(n^1, INF)

(17) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(0', y) → 0'
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0')
div(x, y, z) → if(ge(y, s(0')), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

Types:
ge :: 0':s:div_by_zero → 0':s:div_by_zero → true:false
0' :: 0':s:div_by_zero
true :: true:false
s :: 0':s:div_by_zero → 0':s:div_by_zero
false :: true:false
minus :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
id_inc :: 0':s:div_by_zero → 0':s:div_by_zero
quot :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
if :: true:false → true:false → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div_by_zero :: 0':s:div_by_zero
hole_true:false1_0 :: true:false
hole_0':s:div_by_zero2_0 :: 0':s:div_by_zero
gen_0':s:div_by_zero3_0 :: Nat → 0':s:div_by_zero

Lemmas:
ge(gen_0':s:div_by_zero3_0(n5_0), gen_0':s:div_by_zero3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)
minus(gen_0':s:div_by_zero3_0(n294_0), gen_0':s:div_by_zero3_0(n294_0)) → gen_0':s:div_by_zero3_0(0), rt ∈ Ω(1 + n294₀)

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

No more defined symbols left to analyse.

(18) LowerBoundsProof (EQUIVALENT transformation)

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

(19) BOUNDS(n^1, INF)

(20) Obligation:

TRS:
Rules:
ge(x, 0') → true
ge(0', s(y)) → false
ge(s(x), s(y)) → ge(x, y)
minus(x, 0') → x
minus(0', y) → 0'
minus(s(x), s(y)) → minus(x, y)
id_inc(x) → x
id_inc(x) → s(x)
quot(x, y) → div(x, y, 0')
div(x, y, z) → if(ge(y, s(0')), ge(x, y), x, y, z)
if(false, b, x, y, z) → div_by_zero
if(true, false, x, y, z) → z
if(true, true, x, y, z) → div(minus(x, y), y, id_inc(z))

Types:
ge :: 0':s:div_by_zero → 0':s:div_by_zero → true:false
0' :: 0':s:div_by_zero
true :: true:false
s :: 0':s:div_by_zero → 0':s:div_by_zero
false :: true:false
minus :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
id_inc :: 0':s:div_by_zero → 0':s:div_by_zero
quot :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div :: 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
if :: true:false → true:false → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero → 0':s:div_by_zero
div_by_zero :: 0':s:div_by_zero
hole_true:false1_0 :: true:false
hole_0':s:div_by_zero2_0 :: 0':s:div_by_zero
gen_0':s:div_by_zero3_0 :: Nat → 0':s:div_by_zero

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

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

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

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

(22) BOUNDS(n^1, INF)