### (0) Obligation:

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

le(0, y) → true
le(s(x), 0) → false
le(s(x), s(y)) → le(x, y)
int(x, y) → if(le(x, y), x, y)
if(true, x, y) → cons(x, int(s(x), y))
if(false, x, y) → nil

Rewrite Strategy: FULL

### (1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n1):
The rewrite sequence
le(s(x), s(y)) →+ le(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 [ ].

### (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:

le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
int(x, y) → if(le(x, y), x, y)
if(true, x, y) → cons(x, int(s(x), y))
if(false, x, y) → nil

S is empty.
Rewrite Strategy: FULL

### (5) SlicingProof (LOWER BOUND(ID) transformation)

Sliced the following arguments:
cons/0

### (6) Obligation:

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

le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
int(x, y) → if(le(x, y), x, y)
if(true, x, y) → cons(int(s(x), y))
if(false, x, y) → nil

S is empty.
Rewrite Strategy: FULL

Infered types.

### (8) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
int(x, y) → if(le(x, y), x, y)
if(true, x, y) → cons(int(s(x), y))
if(false, x, y) → nil

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
int :: 0':s → 0':s → cons:nil
if :: true:false → 0':s → 0':s → cons:nil
cons :: cons:nil → cons:nil
nil :: cons:nil
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_cons:nil3_0 :: cons:nil
gen_0':s4_0 :: Nat → 0':s
gen_cons:nil5_0 :: Nat → cons:nil

### (9) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
le, int

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

### (10) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
int(x, y) → if(le(x, y), x, y)
if(true, x, y) → cons(int(s(x), y))
if(false, x, y) → nil

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
int :: 0':s → 0':s → cons:nil
if :: true:false → 0':s → 0':s → cons:nil
cons :: cons:nil → cons:nil
nil :: cons:nil
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_cons:nil3_0 :: cons:nil
gen_0':s4_0 :: Nat → 0':s
gen_cons:nil5_0 :: Nat → cons:nil

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))
gen_cons:nil5_0(0) ⇔ nil
gen_cons:nil5_0(+(x, 1)) ⇔ cons(gen_cons:nil5_0(x))

The following defined symbols remain to be analysed:
le, int

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

### (11) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
le(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) → true, rt ∈ Ω(1 + n70)

Induction Base:
le(gen_0':s4_0(0), gen_0':s4_0(0)) →RΩ(1)
true

Induction Step:
le(gen_0':s4_0(+(n7_0, 1)), gen_0':s4_0(+(n7_0, 1))) →RΩ(1)
le(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) →IH
true

We have rt ∈ Ω(n1) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).

### (13) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
int(x, y) → if(le(x, y), x, y)
if(true, x, y) → cons(int(s(x), y))
if(false, x, y) → nil

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
int :: 0':s → 0':s → cons:nil
if :: true:false → 0':s → 0':s → cons:nil
cons :: cons:nil → cons:nil
nil :: cons:nil
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_cons:nil3_0 :: cons:nil
gen_0':s4_0 :: Nat → 0':s
gen_cons:nil5_0 :: Nat → cons:nil

Lemmas:
le(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) → true, rt ∈ Ω(1 + n70)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))
gen_cons:nil5_0(0) ⇔ nil
gen_cons:nil5_0(+(x, 1)) ⇔ cons(gen_cons:nil5_0(x))

The following defined symbols remain to be analysed:
int

### (14) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

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

### (15) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
int(x, y) → if(le(x, y), x, y)
if(true, x, y) → cons(int(s(x), y))
if(false, x, y) → nil

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
int :: 0':s → 0':s → cons:nil
if :: true:false → 0':s → 0':s → cons:nil
cons :: cons:nil → cons:nil
nil :: cons:nil
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_cons:nil3_0 :: cons:nil
gen_0':s4_0 :: Nat → 0':s
gen_cons:nil5_0 :: Nat → cons:nil

Lemmas:
le(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) → true, rt ∈ Ω(1 + n70)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))
gen_cons:nil5_0(0) ⇔ nil
gen_cons:nil5_0(+(x, 1)) ⇔ cons(gen_cons:nil5_0(x))

No more defined symbols left to analyse.

### (16) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
le(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) → true, rt ∈ Ω(1 + n70)

### (18) Obligation:

TRS:
Rules:
le(0', y) → true
le(s(x), 0') → false
le(s(x), s(y)) → le(x, y)
int(x, y) → if(le(x, y), x, y)
if(true, x, y) → cons(int(s(x), y))
if(false, x, y) → nil

Types:
le :: 0':s → 0':s → true:false
0' :: 0':s
true :: true:false
s :: 0':s → 0':s
false :: true:false
int :: 0':s → 0':s → cons:nil
if :: true:false → 0':s → 0':s → cons:nil
cons :: cons:nil → cons:nil
nil :: cons:nil
hole_true:false1_0 :: true:false
hole_0':s2_0 :: 0':s
hole_cons:nil3_0 :: cons:nil
gen_0':s4_0 :: Nat → 0':s
gen_cons:nil5_0 :: Nat → cons:nil

Lemmas:
le(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) → true, rt ∈ Ω(1 + n70)

Generator Equations:
gen_0':s4_0(0) ⇔ 0'
gen_0':s4_0(+(x, 1)) ⇔ s(gen_0':s4_0(x))
gen_cons:nil5_0(0) ⇔ nil
gen_cons:nil5_0(+(x, 1)) ⇔ cons(gen_cons:nil5_0(x))

No more defined symbols left to analyse.

### (19) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n1) was proven with the following lemma:
le(gen_0':s4_0(n7_0), gen_0':s4_0(n7_0)) → true, rt ∈ Ω(1 + n70)