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:

rev(ls) → r1(ls, empty)
r1(empty, a) → a
r1(cons(x, k), a) → r1(k, cons(x, a))

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:

rev(ls) → r1(ls, empty)
r1(empty, a) → a
r1(cons(x, k), a) → r1(k, cons(x, a))

S is empty.
Rewrite Strategy: FULL

(3) SlicingProof (LOWER BOUND(ID) transformation)

Sliced the following arguments:
cons/0

(4) Obligation:

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

rev(ls) → r1(ls, empty)
r1(empty, a) → a
r1(cons(k), a) → r1(k, cons(a))

S is empty.
Rewrite Strategy: FULL

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

Infered types.

(6) Obligation:

TRS:
Rules:
rev(ls) → r1(ls, empty)
r1(empty, a) → a
r1(cons(k), a) → r1(k, cons(a))

Types:
rev :: empty:cons → empty:cons
r1 :: empty:cons → empty:cons → empty:cons
empty :: empty:cons
cons :: empty:cons → empty:cons
hole_empty:cons1_0 :: empty:cons
gen_empty:cons2_0 :: Nat → empty:cons

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

Heuristically decided to analyse the following defined symbols:
r1

(8) Obligation:

TRS:
Rules:
rev(ls) → r1(ls, empty)
r1(empty, a) → a
r1(cons(k), a) → r1(k, cons(a))

Types:
rev :: empty:cons → empty:cons
r1 :: empty:cons → empty:cons → empty:cons
empty :: empty:cons
cons :: empty:cons → empty:cons
hole_empty:cons1_0 :: empty:cons
gen_empty:cons2_0 :: Nat → empty:cons

Generator Equations:
gen_empty:cons2_0(0) ⇔ empty
gen_empty:cons2_0(+(x, 1)) ⇔ cons(gen_empty:cons2_0(x))

The following defined symbols remain to be analysed:
r1

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

Proved the following rewrite lemma:
r1(gen_empty:cons2_0(n4_0), gen_empty:cons2_0(b)) → gen_empty:cons2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

Induction Base:
r1(gen_empty:cons2_0(0), gen_empty:cons2_0(b)) →_R^Ω(1)
gen_empty:cons2_0(b)

Induction Step:
r1(gen_empty:cons2_0(+(n4_0, 1)), gen_empty:cons2_0(b)) →_R^Ω(1)
r1(gen_empty:cons2_0(n4_0), cons(gen_empty:cons2_0(b))) →_IH
gen_empty:cons2_0(+(+(b, 1), c5_0))

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

(10) Complex Obligation (BEST)

(11) Obligation:

TRS:
Rules:
rev(ls) → r1(ls, empty)
r1(empty, a) → a
r1(cons(k), a) → r1(k, cons(a))

Types:
rev :: empty:cons → empty:cons
r1 :: empty:cons → empty:cons → empty:cons
empty :: empty:cons
cons :: empty:cons → empty:cons
hole_empty:cons1_0 :: empty:cons
gen_empty:cons2_0 :: Nat → empty:cons

Lemmas:
r1(gen_empty:cons2_0(n4_0), gen_empty:cons2_0(b)) → gen_empty:cons2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_empty:cons2_0(0) ⇔ empty
gen_empty:cons2_0(+(x, 1)) ⇔ cons(gen_empty:cons2_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
r1(gen_empty:cons2_0(n4_0), gen_empty:cons2_0(b)) → gen_empty:cons2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

TRS:
Rules:
rev(ls) → r1(ls, empty)
r1(empty, a) → a
r1(cons(k), a) → r1(k, cons(a))

Types:
rev :: empty:cons → empty:cons
r1 :: empty:cons → empty:cons → empty:cons
empty :: empty:cons
cons :: empty:cons → empty:cons
hole_empty:cons1_0 :: empty:cons
gen_empty:cons2_0 :: Nat → empty:cons

Lemmas:
r1(gen_empty:cons2_0(n4_0), gen_empty:cons2_0(b)) → gen_empty:cons2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_empty:cons2_0(0) ⇔ empty
gen_empty:cons2_0(+(x, 1)) ⇔ cons(gen_empty:cons2_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
r1(gen_empty:cons2_0(n4_0), gen_empty:cons2_0(b)) → gen_empty:cons2_0(+(n4_0, b)), rt ∈ Ω(1 + n4₀)

(16) BOUNDS(n^1, INF)