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:

minus(x, x) → 0
minus(0, x) → 0
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
minus(s(x), s(y)) →⁺ minus(x, y)
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [x / s(x), y / s(y)].
The result substitution is [ ].

(2) BOUNDS(n^1, INF)

(3) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(4) Obligation:

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

minus(x, x) → 0'
minus(0', x) → 0'
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0'), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0'

S is empty.
Rewrite Strategy: FULL

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

Infered types.

(6) Obligation:

TRS:
Rules:
minus(x, x) → 0'
minus(0', x) → 0'
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0'), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0'

Types:
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
0' :: 0':s:divByZeroError
s :: 0':s:divByZeroError → 0':s:divByZeroError
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
true :: true:false
false :: true:false
quot :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_quot :: 0':s:divByZeroError → 0':s:divByZeroError → true:false → true:false → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_0':s:divByZeroError1_0 :: 0':s:divByZeroError
hole_true:false2_0 :: true:false
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

(7) OrderProof (LOWER BOUND(ID) transformation)

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

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

(8) Obligation:

TRS:
Rules:
minus(x, x) → 0'
minus(0', x) → 0'
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0'), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0'

Types:
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
0' :: 0':s:divByZeroError
s :: 0':s:divByZeroError → 0':s:divByZeroError
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
true :: true:false
false :: true:false
quot :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_quot :: 0':s:divByZeroError → 0':s:divByZeroError → true:false → true:false → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_0':s:divByZeroError1_0 :: 0':s:divByZeroError
hole_true:false2_0 :: true:false
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:
minus, le, quot

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

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

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

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(+(n5_0, 1)), gen_0':s:divByZeroError3_0(+(n5_0, 1))) →_R^Ω(1)
minus(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) →_IH
gen_0':s:divByZeroError3_0(0)

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

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
minus(x, x) → 0'
minus(0', x) → 0'
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0'), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0'

Types:
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
0' :: 0':s:divByZeroError
s :: 0':s:divByZeroError → 0':s:divByZeroError
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
true :: true:false
false :: true:false
quot :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_quot :: 0':s:divByZeroError → 0':s:divByZeroError → true:false → true:false → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_0':s:divByZeroError1_0 :: 0':s:divByZeroError
hole_true:false2_0 :: true:false
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
minus(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → gen_0':s:divByZeroError3_0(0), 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:
le, quot

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

(12) RewriteLemmaProof (LOWER BOUND(ID) transformation)

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

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(+(n395_0, 1)), gen_0':s:divByZeroError3_0(+(n395_0, 1))) →_R^Ω(1)
le(gen_0':s:divByZeroError3_0(n395_0), gen_0':s:divByZeroError3_0(n395_0)) →_IH
true

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

(13) Complex Obligation (BEST)

(14) Obligation:

TRS:
Rules:
minus(x, x) → 0'
minus(0', x) → 0'
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0'), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0'

Types:
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
0' :: 0':s:divByZeroError
s :: 0':s:divByZeroError → 0':s:divByZeroError
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
true :: true:false
false :: true:false
quot :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_quot :: 0':s:divByZeroError → 0':s:divByZeroError → true:false → true:false → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_0':s:divByZeroError1_0 :: 0':s:divByZeroError
hole_true:false2_0 :: true:false
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

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

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:
quot

(15) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

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

(16) Obligation:

TRS:
Rules:
minus(x, x) → 0'
minus(0', x) → 0'
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0'), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0'

Types:
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
0' :: 0':s:divByZeroError
s :: 0':s:divByZeroError → 0':s:divByZeroError
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
true :: true:false
false :: true:false
quot :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_quot :: 0':s:divByZeroError → 0':s:divByZeroError → true:false → true:false → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_0':s:divByZeroError1_0 :: 0':s:divByZeroError
hole_true:false2_0 :: true:false
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

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

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.

(17) LowerBoundsProof (EQUIVALENT transformation)

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

(18) BOUNDS(n^1, INF)

(19) Obligation:

TRS:
Rules:
minus(x, x) → 0'
minus(0', x) → 0'
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0'), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0'

Types:
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
0' :: 0':s:divByZeroError
s :: 0':s:divByZeroError → 0':s:divByZeroError
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
true :: true:false
false :: true:false
quot :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_quot :: 0':s:divByZeroError → 0':s:divByZeroError → true:false → true:false → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_0':s:divByZeroError1_0 :: 0':s:divByZeroError
hole_true:false2_0 :: true:false
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

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

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.

(20) LowerBoundsProof (EQUIVALENT transformation)

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

(21) BOUNDS(n^1, INF)

(22) Obligation:

TRS:
Rules:
minus(x, x) → 0'
minus(0', x) → 0'
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
quot(x, y) → if_quot(minus(x, y), y, le(y, 0'), le(y, x))
if_quot(x, y, true, z) → divByZeroError
if_quot(x, y, false, true) → s(quot(x, y))
if_quot(x, y, false, false) → 0'

Types:
minus :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
0' :: 0':s:divByZeroError
s :: 0':s:divByZeroError → 0':s:divByZeroError
le :: 0':s:divByZeroError → 0':s:divByZeroError → true:false
true :: true:false
false :: true:false
quot :: 0':s:divByZeroError → 0':s:divByZeroError → 0':s:divByZeroError
if_quot :: 0':s:divByZeroError → 0':s:divByZeroError → true:false → true:false → 0':s:divByZeroError
divByZeroError :: 0':s:divByZeroError
hole_0':s:divByZeroError1_0 :: 0':s:divByZeroError
hole_true:false2_0 :: true:false
gen_0':s:divByZeroError3_0 :: Nat → 0':s:divByZeroError

Lemmas:
minus(gen_0':s:divByZeroError3_0(n5_0), gen_0':s:divByZeroError3_0(n5_0)) → gen_0':s:divByZeroError3_0(0), 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.

(23) LowerBoundsProof (EQUIVALENT transformation)

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

(24) BOUNDS(n^1, INF)