Termination w.r.t. Q of the given QTRS could be proven:

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

2nd(cons(X, n__cons(Y, Z))) → activate(Y)
from(X) → cons(X, n__from(s(X)))
cons(X1, X2) → n__cons(X1, X2)
from(X) → n__from(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__from(X)) → from(X)
activate(X) → X

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Lexicographic path order with status [LPO].
Quasi-Precedence:

[2nd₁, activate₁, from₁] > cons₂ > [n_cons2, s₁]
[2nd₁, activate₁, from₁] > n_from1 > [n_cons2, s₁]

Status:

2nd₁: [1]
cons₂: [1,2]
n_cons2: [1,2]
activate₁: [1]
from₁: [1]
n_from1: [1]
s₁: [1]

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

2nd(cons(X, n__cons(Y, Z))) → activate(Y)
from(X) → cons(X, n__from(s(X)))
cons(X1, X2) → n__cons(X1, X2)
from(X) → n__from(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__from(X)) → from(X)
activate(X) → X

(2) Obligation:

Q restricted rewrite system:
R is empty.
Q is empty.

(3) RisEmptyProof (EQUIVALENT transformation)

The TRS R is empty. Hence, termination is trivially proven.

(4) TRUE