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:

f(true, x, y, z) → g(gt(x, y), x, y, z)
g(true, x, y, z) → f(gt(x, z), x, s(y), z)
g(true, x, y, z) → f(gt(x, z), x, y, s(z))
gt(0, v) → false
gt(s(u), 0) → true
gt(s(u), s(v)) → gt(u, v)

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:

f(true, x, y, z) → g(gt(x, y), x, y, z)
g(true, x, y, z) → f(gt(x, z), x, s(y), z)
g(true, x, y, z) → f(gt(x, z), x, y, s(z))
gt(0', v) → false
gt(s(u), 0') → true
gt(s(u), s(v)) → gt(u, v)

S is empty.
Rewrite Strategy: FULL

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

Infered types.

(4) Obligation:

TRS:
Rules:
f(true, x, y, z) → g(gt(x, y), x, y, z)
g(true, x, y, z) → f(gt(x, z), x, s(y), z)
g(true, x, y, z) → f(gt(x, z), x, y, s(z))
gt(0', v) → false
gt(s(u), 0') → true
gt(s(u), s(v)) → gt(u, v)

Types:
f :: true:false → s:0' → s:0' → s:0' → f:g
true :: true:false
g :: true:false → s:0' → s:0' → s:0' → f:g
gt :: s:0' → s:0' → true:false
s :: s:0' → s:0'
0' :: s:0'
false :: true:false
hole_f:g1_0 :: f:g
hole_true:false2_0 :: true:false
hole_s:0'3_0 :: s:0'
gen_s:0'4_0 :: Nat → s:0'

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

Heuristically decided to analyse the following defined symbols:
f, g, gt

They will be analysed ascendingly in the following order:
f = g
gt < f
gt < g

(6) Obligation:

TRS:
Rules:
f(true, x, y, z) → g(gt(x, y), x, y, z)
g(true, x, y, z) → f(gt(x, z), x, s(y), z)
g(true, x, y, z) → f(gt(x, z), x, y, s(z))
gt(0', v) → false
gt(s(u), 0') → true
gt(s(u), s(v)) → gt(u, v)

Types:
f :: true:false → s:0' → s:0' → s:0' → f:g
true :: true:false
g :: true:false → s:0' → s:0' → s:0' → f:g
gt :: s:0' → s:0' → true:false
s :: s:0' → s:0'
0' :: s:0'
false :: true:false
hole_f:g1_0 :: f:g
hole_true:false2_0 :: true:false
hole_s:0'3_0 :: s:0'
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:
gt, f, g

They will be analysed ascendingly in the following order:
f = g
gt < f
gt < g

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

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

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

Induction Step:
gt(gen_s:0'4_0(+(n6_0, 1)), gen_s:0'4_0(+(n6_0, 1))) →_R^Ω(1)
gt(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:

TRS:
Rules:
f(true, x, y, z) → g(gt(x, y), x, y, z)
g(true, x, y, z) → f(gt(x, z), x, s(y), z)
g(true, x, y, z) → f(gt(x, z), x, y, s(z))
gt(0', v) → false
gt(s(u), 0') → true
gt(s(u), s(v)) → gt(u, v)

Types:
f :: true:false → s:0' → s:0' → s:0' → f:g
true :: true:false
g :: true:false → s:0' → s:0' → s:0' → f:g
gt :: s:0' → s:0' → true:false
s :: s:0' → s:0'
0' :: s:0'
false :: true:false
hole_f:g1_0 :: f:g
hole_true:false2_0 :: true:false
hole_s:0'3_0 :: s:0'
gen_s:0'4_0 :: Nat → s:0'

Lemmas:
gt(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:
g, f

They will be analysed ascendingly in the following order:
f = g

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

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

(11) Obligation:

TRS:
Rules:
f(true, x, y, z) → g(gt(x, y), x, y, z)
g(true, x, y, z) → f(gt(x, z), x, s(y), z)
g(true, x, y, z) → f(gt(x, z), x, y, s(z))
gt(0', v) → false
gt(s(u), 0') → true
gt(s(u), s(v)) → gt(u, v)

Types:
f :: true:false → s:0' → s:0' → s:0' → f:g
true :: true:false
g :: true:false → s:0' → s:0' → s:0' → f:g
gt :: s:0' → s:0' → true:false
s :: s:0' → s:0'
0' :: s:0'
false :: true:false
hole_f:g1_0 :: f:g
hole_true:false2_0 :: true:false
hole_s:0'3_0 :: s:0'
gen_s:0'4_0 :: Nat → s:0'

Lemmas:
gt(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:
f

They will be analysed ascendingly in the following order:
f = g

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

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

(13) Obligation:

TRS:
Rules:
f(true, x, y, z) → g(gt(x, y), x, y, z)
g(true, x, y, z) → f(gt(x, z), x, s(y), z)
g(true, x, y, z) → f(gt(x, z), x, y, s(z))
gt(0', v) → false
gt(s(u), 0') → true
gt(s(u), s(v)) → gt(u, v)

Types:
f :: true:false → s:0' → s:0' → s:0' → f:g
true :: true:false
g :: true:false → s:0' → s:0' → s:0' → f:g
gt :: s:0' → s:0' → true:false
s :: s:0' → s:0'
0' :: s:0'
false :: true:false
hole_f:g1_0 :: f:g
hole_true:false2_0 :: true:false
hole_s:0'3_0 :: s:0'
gen_s:0'4_0 :: Nat → s:0'

Lemmas:
gt(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.

(14) LowerBoundsProof (EQUIVALENT transformation)

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

(15) BOUNDS(n^1, INF)

(16) Obligation:

TRS:
Rules:
f(true, x, y, z) → g(gt(x, y), x, y, z)
g(true, x, y, z) → f(gt(x, z), x, s(y), z)
g(true, x, y, z) → f(gt(x, z), x, y, s(z))
gt(0', v) → false
gt(s(u), 0') → true
gt(s(u), s(v)) → gt(u, v)

Types:
f :: true:false → s:0' → s:0' → s:0' → f:g
true :: true:false
g :: true:false → s:0' → s:0' → s:0' → f:g
gt :: s:0' → s:0' → true:false
s :: s:0' → s:0'
0' :: s:0'
false :: true:false
hole_f:g1_0 :: f:g
hole_true:false2_0 :: true:false
hole_s:0'3_0 :: s:0'
gen_s:0'4_0 :: Nat → s:0'

Lemmas:
gt(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.

(17) LowerBoundsProof (EQUIVALENT transformation)

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

(18) BOUNDS(n^1, INF)