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:

minus(x, y) → cond(ge(x, s(y)), x, y)
cond(false, x, y) → 0
cond(true, x, y) → s(minus(x, s(y)))
ge(u, 0) → true
ge(0, s(v)) → false
ge(s(u), s(v)) → ge(u, v)

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:

minus(x, y) → cond(ge(x, s(y)), x, y)
cond(false, x, y) → 0'
cond(true, x, y) → s(minus(x, s(y)))
ge(u, 0') → true
ge(0', s(v)) → false
ge(s(u), s(v)) → ge(u, v)

S is empty.
Rewrite Strategy: INNERMOST

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

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
minus(x, y) → cond(ge(x, s(y)), x, y)
cond(false, x, y) → 0'
cond(true, x, y) → s(minus(x, s(y)))
ge(u, 0') → true
ge(0', s(v)) → false
ge(s(u), s(v)) → ge(u, v)

Types:
minus :: s:0' → s:0' → s:0'
cond :: false:true → s:0' → s:0' → s:0'
ge :: s:0' → s:0' → false:true
s :: s:0' → s:0'
false :: false:true
0' :: s:0'
true :: false:true
hole_s:0'1_0 :: s:0'
hole_false:true2_0 :: false:true
gen_s:0'3_0 :: Nat → s:0'

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

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

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

(6) Obligation:

Innermost TRS:
Rules:
minus(x, y) → cond(ge(x, s(y)), x, y)
cond(false, x, y) → 0'
cond(true, x, y) → s(minus(x, s(y)))
ge(u, 0') → true
ge(0', s(v)) → false
ge(s(u), s(v)) → ge(u, v)

Types:
minus :: s:0' → s:0' → s:0'
cond :: false:true → s:0' → s:0' → s:0'
ge :: s:0' → s:0' → false:true
s :: s:0' → s:0'
false :: false:true
0' :: s:0'
true :: false:true
hole_s:0'1_0 :: s:0'
hole_false:true2_0 :: false:true
gen_s:0'3_0 :: Nat → s:0'

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

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

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

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

Proved the following rewrite lemma:
ge(gen_s:0'3_0(n5_0), gen_s:0'3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

Induction Base:
ge(gen_s:0'3_0(0), gen_s:0'3_0(0)) →_R^Ω(1)
true

Induction Step:
ge(gen_s:0'3_0(+(n5_0, 1)), gen_s:0'3_0(+(n5_0, 1))) →_R^Ω(1)
ge(gen_s:0'3_0(n5_0), gen_s:0'3_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:
minus(x, y) → cond(ge(x, s(y)), x, y)
cond(false, x, y) → 0'
cond(true, x, y) → s(minus(x, s(y)))
ge(u, 0') → true
ge(0', s(v)) → false
ge(s(u), s(v)) → ge(u, v)

Types:
minus :: s:0' → s:0' → s:0'
cond :: false:true → s:0' → s:0' → s:0'
ge :: s:0' → s:0' → false:true
s :: s:0' → s:0'
false :: false:true
0' :: s:0'
true :: false:true
hole_s:0'1_0 :: s:0'
hole_false:true2_0 :: false:true
gen_s:0'3_0 :: Nat → s:0'

Lemmas:
ge(gen_s:0'3_0(n5_0), gen_s:0'3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

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

The following defined symbols remain to be analysed:
minus

(10) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

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

(11) Obligation:

Innermost TRS:
Rules:
minus(x, y) → cond(ge(x, s(y)), x, y)
cond(false, x, y) → 0'
cond(true, x, y) → s(minus(x, s(y)))
ge(u, 0') → true
ge(0', s(v)) → false
ge(s(u), s(v)) → ge(u, v)

Types:
minus :: s:0' → s:0' → s:0'
cond :: false:true → s:0' → s:0' → s:0'
ge :: s:0' → s:0' → false:true
s :: s:0' → s:0'
false :: false:true
0' :: s:0'
true :: false:true
hole_s:0'1_0 :: s:0'
hole_false:true2_0 :: false:true
gen_s:0'3_0 :: Nat → s:0'

Lemmas:
ge(gen_s:0'3_0(n5_0), gen_s:0'3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

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

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
ge(gen_s:0'3_0(n5_0), gen_s:0'3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

Innermost TRS:
Rules:
minus(x, y) → cond(ge(x, s(y)), x, y)
cond(false, x, y) → 0'
cond(true, x, y) → s(minus(x, s(y)))
ge(u, 0') → true
ge(0', s(v)) → false
ge(s(u), s(v)) → ge(u, v)

Types:
minus :: s:0' → s:0' → s:0'
cond :: false:true → s:0' → s:0' → s:0'
ge :: s:0' → s:0' → false:true
s :: s:0' → s:0'
false :: false:true
0' :: s:0'
true :: false:true
hole_s:0'1_0 :: s:0'
hole_false:true2_0 :: false:true
gen_s:0'3_0 :: Nat → s:0'

Lemmas:
ge(gen_s:0'3_0(n5_0), gen_s:0'3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

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

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
ge(gen_s:0'3_0(n5_0), gen_s:0'3_0(n5_0)) → true, rt ∈ Ω(1 + n5₀)

(16) BOUNDS(n^1, INF)