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:

anchored(Cons(x, xs), y) → anchored(xs, Cons(Cons(Nil, Nil), y))
anchored(Nil, y) → y
goal(x, y) → anchored(x, y)

Rewrite Strategy: INNERMOST

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(n¹):
The rewrite sequence
anchored(Cons(x, xs), y) →⁺ anchored(xs, Cons(Cons(Nil, Nil), y))
gives rise to a decreasing loop by considering the right hand sides subterm at position [].
The pumping substitution is [xs / Cons(x, xs)].
The result substitution is [y / Cons(Cons(Nil, Nil), y)].

(2) BOUNDS(n^1, INF)