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:

cond1(s(x), y) → cond2(gr(s(x), y), s(x), y)
cond2(true, x, y) → cond1(y, y)
cond2(false, x, y) → cond1(p(x), y)
gr(0, x) → false
gr(s(x), 0) → true
gr(s(x), s(y)) → gr(x, y)
neq(0, 0) → false
neq(0, s(x)) → true
neq(s(x), 0) → true
neq(s(x), s(y)) → neq(x, y)
p(0) → 0
p(s(x)) → x

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:

cond1(s(x), y) → cond2(gr(s(x), y), s(x), y)
cond2(true, x, y) → cond1(y, y)
cond2(false, x, y) → cond1(p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

S is empty.
Rewrite Strategy: INNERMOST

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

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
cond1(s(x), y) → cond2(gr(s(x), y), s(x), y)
cond2(true, x, y) → cond1(y, y)
cond2(false, x, y) → cond1(p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: s:0' → s:0' → cond1:cond2
s :: s:0' → s:0'
cond2 :: true:false → s:0' → s:0' → cond1:cond2
gr :: s:0' → s:0' → true:false
true :: true:false
false :: true:false
p :: s:0' → s:0'
0' :: s:0'
neq :: s:0' → s:0' → true:false
hole_cond1:cond21_0 :: cond1:cond2
hole_s:0'2_0 :: s:0'
hole_true:false3_0 :: true:false
gen_s:0'4_0 :: Nat → s:0'

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

Heuristically decided to analyse the following defined symbols:
cond1, gr, neq

They will be analysed ascendingly in the following order:
gr < cond1

(6) Obligation:

Innermost TRS:
Rules:
cond1(s(x), y) → cond2(gr(s(x), y), s(x), y)
cond2(true, x, y) → cond1(y, y)
cond2(false, x, y) → cond1(p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: s:0' → s:0' → cond1:cond2
s :: s:0' → s:0'
cond2 :: true:false → s:0' → s:0' → cond1:cond2
gr :: s:0' → s:0' → true:false
true :: true:false
false :: true:false
p :: s:0' → s:0'
0' :: s:0'
neq :: s:0' → s:0' → true:false
hole_cond1:cond21_0 :: cond1:cond2
hole_s:0'2_0 :: s:0'
hole_true:false3_0 :: true:false
gen_s:0'4_0 :: Nat → s:0'

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

The following defined symbols remain to be analysed:
gr, cond1, neq

They will be analysed ascendingly in the following order:
gr < cond1

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

Proved the following rewrite lemma:
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

Induction Base:
gr(gen_s:0'4_0(0), gen_s:0'4_0(0)) →_R^Ω(1)
false

Induction Step:
gr(gen_s:0'4_0(+(n6_0, 1)), gen_s:0'4_0(+(n6_0, 1))) →_R^Ω(1)
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) →_IH
false

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

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
cond1(s(x), y) → cond2(gr(s(x), y), s(x), y)
cond2(true, x, y) → cond1(y, y)
cond2(false, x, y) → cond1(p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: s:0' → s:0' → cond1:cond2
s :: s:0' → s:0'
cond2 :: true:false → s:0' → s:0' → cond1:cond2
gr :: s:0' → s:0' → true:false
true :: true:false
false :: true:false
p :: s:0' → s:0'
0' :: s:0'
neq :: s:0' → s:0' → true:false
hole_cond1:cond21_0 :: cond1:cond2
hole_s:0'2_0 :: s:0'
hole_true:false3_0 :: true:false
gen_s:0'4_0 :: Nat → s:0'

Lemmas:
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

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

The following defined symbols remain to be analysed:
cond1, neq

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

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

(11) Obligation:

Innermost TRS:
Rules:
cond1(s(x), y) → cond2(gr(s(x), y), s(x), y)
cond2(true, x, y) → cond1(y, y)
cond2(false, x, y) → cond1(p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: s:0' → s:0' → cond1:cond2
s :: s:0' → s:0'
cond2 :: true:false → s:0' → s:0' → cond1:cond2
gr :: s:0' → s:0' → true:false
true :: true:false
false :: true:false
p :: s:0' → s:0'
0' :: s:0'
neq :: s:0' → s:0' → true:false
hole_cond1:cond21_0 :: cond1:cond2
hole_s:0'2_0 :: s:0'
hole_true:false3_0 :: true:false
gen_s:0'4_0 :: Nat → s:0'

Lemmas:
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

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

The following defined symbols remain to be analysed:
neq

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

Proved the following rewrite lemma:
neq(gen_s:0'4_0(n12126_0), gen_s:0'4_0(n12126_0)) → false, rt ∈ Ω(1 + n12126₀)

Induction Base:
neq(gen_s:0'4_0(0), gen_s:0'4_0(0)) →_R^Ω(1)
false

Induction Step:
neq(gen_s:0'4_0(+(n12126_0, 1)), gen_s:0'4_0(+(n12126_0, 1))) →_R^Ω(1)
neq(gen_s:0'4_0(n12126_0), gen_s:0'4_0(n12126_0)) →_IH
false

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

(13) Complex Obligation (BEST)

(14) Obligation:

Innermost TRS:
Rules:
cond1(s(x), y) → cond2(gr(s(x), y), s(x), y)
cond2(true, x, y) → cond1(y, y)
cond2(false, x, y) → cond1(p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: s:0' → s:0' → cond1:cond2
s :: s:0' → s:0'
cond2 :: true:false → s:0' → s:0' → cond1:cond2
gr :: s:0' → s:0' → true:false
true :: true:false
false :: true:false
p :: s:0' → s:0'
0' :: s:0'
neq :: s:0' → s:0' → true:false
hole_cond1:cond21_0 :: cond1:cond2
hole_s:0'2_0 :: s:0'
hole_true:false3_0 :: true:false
gen_s:0'4_0 :: Nat → s:0'

Lemmas:
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)
neq(gen_s:0'4_0(n12126_0), gen_s:0'4_0(n12126_0)) → false, rt ∈ Ω(1 + n12126₀)

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

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

(16) BOUNDS(n^1, INF)

(17) Obligation:

Innermost TRS:
Rules:
cond1(s(x), y) → cond2(gr(s(x), y), s(x), y)
cond2(true, x, y) → cond1(y, y)
cond2(false, x, y) → cond1(p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: s:0' → s:0' → cond1:cond2
s :: s:0' → s:0'
cond2 :: true:false → s:0' → s:0' → cond1:cond2
gr :: s:0' → s:0' → true:false
true :: true:false
false :: true:false
p :: s:0' → s:0'
0' :: s:0'
neq :: s:0' → s:0' → true:false
hole_cond1:cond21_0 :: cond1:cond2
hole_s:0'2_0 :: s:0'
hole_true:false3_0 :: true:false
gen_s:0'4_0 :: Nat → s:0'

Lemmas:
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)
neq(gen_s:0'4_0(n12126_0), gen_s:0'4_0(n12126_0)) → false, rt ∈ Ω(1 + n12126₀)

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

No more defined symbols left to analyse.

(18) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

(19) BOUNDS(n^1, INF)

(20) Obligation:

Innermost TRS:
Rules:
cond1(s(x), y) → cond2(gr(s(x), y), s(x), y)
cond2(true, x, y) → cond1(y, y)
cond2(false, x, y) → cond1(p(x), y)
gr(0', x) → false
gr(s(x), 0') → true
gr(s(x), s(y)) → gr(x, y)
neq(0', 0') → false
neq(0', s(x)) → true
neq(s(x), 0') → true
neq(s(x), s(y)) → neq(x, y)
p(0') → 0'
p(s(x)) → x

Types:
cond1 :: s:0' → s:0' → cond1:cond2
s :: s:0' → s:0'
cond2 :: true:false → s:0' → s:0' → cond1:cond2
gr :: s:0' → s:0' → true:false
true :: true:false
false :: true:false
p :: s:0' → s:0'
0' :: s:0'
neq :: s:0' → s:0' → true:false
hole_cond1:cond21_0 :: cond1:cond2
hole_s:0'2_0 :: s:0'
hole_true:false3_0 :: true:false
gen_s:0'4_0 :: Nat → s:0'

Lemmas:
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

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

No more defined symbols left to analyse.

(21) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
gr(gen_s:0'4_0(n6_0), gen_s:0'4_0(n6_0)) → false, rt ∈ Ω(1 + n6₀)

(22) BOUNDS(n^1, INF)