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:

duplicate(Cons(x, xs)) → Cons(x, Cons(x, duplicate(xs)))
duplicate(Nil) → Nil
goal(x) → duplicate(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:

duplicate(Cons(x, xs)) → Cons(x, Cons(x, duplicate(xs)))
duplicate(Nil) → Nil
goal(x) → duplicate(x)

S is empty.
Rewrite Strategy: INNERMOST

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

duplicate(Cons(xs)) → Cons(Cons(duplicate(xs)))
duplicate(Nil) → Nil
goal(x) → duplicate(x)

S is empty.
Rewrite Strategy: INNERMOST

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

Infered types.

(6) Obligation:

Innermost TRS:
Rules:
duplicate(Cons(xs)) → Cons(Cons(duplicate(xs)))
duplicate(Nil) → Nil
goal(x) → duplicate(x)

Types:
duplicate :: Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

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

Heuristically decided to analyse the following defined symbols:
duplicate

(8) Obligation:

Innermost TRS:
Rules:
duplicate(Cons(xs)) → Cons(Cons(duplicate(xs)))
duplicate(Nil) → Nil
goal(x) → duplicate(x)

Types:
duplicate :: Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

Generator Equations:
gen_Cons:Nil2_0(0) ⇔ Nil
gen_Cons:Nil2_0(+(x, 1)) ⇔ Cons(gen_Cons:Nil2_0(x))

The following defined symbols remain to be analysed:
duplicate

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

Proved the following rewrite lemma:
duplicate(gen_Cons:Nil2_0(n4_0)) → gen_Cons:Nil2_0(*(2, n4_0)), rt ∈ Ω(1 + n4₀)

Induction Base:
duplicate(gen_Cons:Nil2_0(0)) →_R^Ω(1)
Nil

Induction Step:
duplicate(gen_Cons:Nil2_0(+(n4_0, 1))) →_R^Ω(1)
Cons(Cons(duplicate(gen_Cons:Nil2_0(n4_0)))) →_IH
Cons(Cons(gen_Cons:Nil2_0(*(2, c5_0))))

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

(10) Complex Obligation (BEST)

(11) Obligation:

Innermost TRS:
Rules:
duplicate(Cons(xs)) → Cons(Cons(duplicate(xs)))
duplicate(Nil) → Nil
goal(x) → duplicate(x)

Types:
duplicate :: Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

Lemmas:
duplicate(gen_Cons:Nil2_0(n4_0)) → gen_Cons:Nil2_0(*(2, n4_0)), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_Cons:Nil2_0(0) ⇔ Nil
gen_Cons:Nil2_0(+(x, 1)) ⇔ Cons(gen_Cons:Nil2_0(x))

No more defined symbols left to analyse.

(12) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
duplicate(gen_Cons:Nil2_0(n4_0)) → gen_Cons:Nil2_0(*(2, n4_0)), rt ∈ Ω(1 + n4₀)

(13) BOUNDS(n^1, INF)

(14) Obligation:

Innermost TRS:
Rules:
duplicate(Cons(xs)) → Cons(Cons(duplicate(xs)))
duplicate(Nil) → Nil
goal(x) → duplicate(x)

Types:
duplicate :: Cons:Nil → Cons:Nil
Cons :: Cons:Nil → Cons:Nil
Nil :: Cons:Nil
goal :: Cons:Nil → Cons:Nil
hole_Cons:Nil1_0 :: Cons:Nil
gen_Cons:Nil2_0 :: Nat → Cons:Nil

Lemmas:
duplicate(gen_Cons:Nil2_0(n4_0)) → gen_Cons:Nil2_0(*(2, n4_0)), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_Cons:Nil2_0(0) ⇔ Nil
gen_Cons:Nil2_0(+(x, 1)) ⇔ Cons(gen_Cons:Nil2_0(x))

No more defined symbols left to analyse.

(15) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
duplicate(gen_Cons:Nil2_0(n4_0)) → gen_Cons:Nil2_0(*(2, n4_0)), rt ∈ Ω(1 + n4₀)

(16) BOUNDS(n^1, INF)