The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(2^n, INF).

(0) Obligation:

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

rev1(0, nil) → 0
rev1(s(X), nil) → s(X)
rev1(X, cons(Y, L)) → rev1(Y, L)
rev(nil) → nil
rev(cons(X, L)) → cons(rev1(X, L), rev2(X, L))
rev2(X, nil) → nil
rev2(X, cons(Y, L)) → rev(cons(X, rev(rev2(Y, L))))

Rewrite Strategy: FULL

(1) DecreasingLoopProof (EQUIVALENT transformation)

The following loop(s) give(s) rise to the lower bound Ω(2ⁿ):
The rewrite sequence
rev2(X, cons(Y, L)) →⁺ cons(rev1(X, rev(rev2(Y, L))), rev2(X, rev(rev2(Y, L))))
gives rise to a decreasing loop by considering the right hand sides subterm at position [0,1,0].
The pumping substitution is [L / cons(Y, L)].
The result substitution is [X / Y].

The rewrite sequence
rev2(X, cons(Y, L)) →⁺ cons(rev1(X, rev(rev2(Y, L))), rev2(X, rev(rev2(Y, L))))
gives rise to a decreasing loop by considering the right hand sides subterm at position [1,1,0].
The pumping substitution is [L / cons(Y, L)].
The result substitution is [X / Y].

(2) BOUNDS(2^n, INF)