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:

d(x) → e(u(x))
d(u(x)) → c(x)
c(u(x)) → b(x)
v(e(x)) → x
b(u(x)) → a(e(x))

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

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

d₁ > u₁
d₁ > c₁ > b₁ > e₁
d₁ > c₁ > b₁ > a₁

Status:

trivial

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

d(x) → e(u(x))
d(u(x)) → c(x)
c(u(x)) → b(x)
v(e(x)) → x
b(u(x)) → a(e(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