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:

from(X) → cons(X, n__from(s(X)))
2ndspos(0, Z) → rnil
2ndspos(s(N), cons(X, n__cons(Y, Z))) → rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) → rnil
2ndsneg(s(N), cons(X, n__cons(Y, Z))) → rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) → 2ndspos(X, from(0))
plus(0, Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0, Y) → 0
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)
from(X) → n__from(X)
cons(X1, X2) → n__cons(X1, X2)
activate(n__from(X)) → from(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(X) → X

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

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

[0, pi₁] > [2ndspos₂, 2ndsneg₂] > [from₁, activate₁] > [cons₂, n_cons2] > rcons₂
[0, pi₁] > [2ndspos₂, 2ndsneg₂] > [from₁, activate₁] > [cons₂, n_cons2] > posrecip₁
[0, pi₁] > [2ndspos₂, 2ndsneg₂] > [from₁, activate₁] > n_from1
[0, pi₁] > [2ndspos₂, 2ndsneg₂] > [from₁, activate₁] > s₁
[0, pi₁] > [2ndspos₂, 2ndsneg₂] > rnil
[0, pi₁] > [2ndspos₂, 2ndsneg₂] > negrecip₁
square₁ > times₂ > plus₂ > s₁

Status:

from₁: [1]
plus₂: [1,2]
rnil: []
negrecip₁: [1]
n_cons2: [1,2]
rcons₂: [2,1]
posrecip₁: [1]
activate₁: [1]
pi₁: [1]
square₁: [1]
0: []
2ndsneg₂: [1,2]
cons₂: [1,2]
2ndspos₂: [1,2]
n_from1: [1]
times₂: [2,1]
s₁: [1]

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

from(X) → cons(X, n__from(s(X)))
2ndspos(0, Z) → rnil
2ndspos(s(N), cons(X, n__cons(Y, Z))) → rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) → rnil
2ndsneg(s(N), cons(X, n__cons(Y, Z))) → rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) → 2ndspos(X, from(0))
plus(0, Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0, Y) → 0
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)
from(X) → n__from(X)
activate(n__from(X)) → from(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(X) → X

(2) Obligation:

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

cons(X1, X2) → n__cons(X1, X2)

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

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

cons₂ > n_cons2

Status:

cons₂: [2,1]
n_cons2: [2,1]

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

cons(X1, X2) → n__cons(X1, X2)

(4) Obligation:

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

(5) RisEmptyProof (EQUIVALENT transformation)

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

(6) TRUE