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:

a__and(true, X) → mark(X)
a__and(false, Y) → false
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(add(X, Y))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))
a__from(X) → cons(X, from(s(X)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(add(X1, X2)) → a__add(mark(X1), X2)
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(from(X)) → a__from(X)
mark(true) → true
mark(false) → false
mark(0) → 0
mark(s(X)) → s(X)
mark(nil) → nil
mark(cons(X1, X2)) → cons(X1, X2)
a__and(X1, X2) → and(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)
a__add(X1, X2) → add(X1, X2)
a__first(X1, X2) → first(X1, X2)
a__from(X) → from(X)

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:

true > [a_and2, mark₁, a_if3, a_add2, add₂, a_from1, and₂, if₃] > a_first2 > [0, s₁, nil, cons₂, first₂]
true > [a_and2, mark₁, a_if3, a_add2, add₂, a_from1, and₂, if₃] > from₁ > [0, s₁, nil, cons₂, first₂]
false > [a_and2, mark₁, a_if3, a_add2, add₂, a_from1, and₂, if₃] > a_first2 > [0, s₁, nil, cons₂, first₂]
false > [a_and2, mark₁, a_if3, a_add2, add₂, a_from1, and₂, if₃] > from₁ > [0, s₁, nil, cons₂, first₂]

Status:

a_and2: multiset
true: multiset
mark₁: multiset
false: multiset
a_if3: multiset
a_add2: multiset
0: multiset
s₁: [1]
add₂: multiset
a_first2: [2,1]
nil: multiset
cons₂: [1,2]
first₂: multiset
a_from1: multiset
from₁: multiset
and₂: multiset
if₃: multiset

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

a__and(true, X) → mark(X)
a__and(false, Y) → false
a__if(true, X, Y) → mark(X)
a__if(false, X, Y) → mark(Y)
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(add(X, Y))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(Y, first(X, Z))
a__from(X) → cons(X, from(s(X)))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(if(X1, X2, X3)) → a__if(mark(X1), X2, X3)
mark(add(X1, X2)) → a__add(mark(X1), X2)
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(from(X)) → a__from(X)
mark(true) → true
mark(false) → false
mark(0) → 0
mark(s(X)) → s(X)
mark(nil) → nil
mark(cons(X1, X2)) → cons(X1, X2)
a__first(X1, X2) → first(X1, X2)
a__from(X) → from(X)

(2) Obligation:

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

a__and(X1, X2) → and(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)
a__add(X1, X2) → add(X1, X2)

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Recursive path order with status [RPO].
Quasi-Precedence:

a_and2 > and₂
a_if3 > if₃ > and₂
a_add2 > add₂ > and₂

Status:

a_and2: [1,2]
and₂: [1,2]
a_if3: [2,3,1]
if₃: multiset
a_add2: [1,2]
add₂: [1,2]

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

a__and(X1, X2) → and(X1, X2)
a__if(X1, X2, X3) → if(X1, X2, X3)
a__add(X1, X2) → add(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