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:

concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

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

[concat₂, cons₂, less_leaves2, true] > [leaf, false]

Status:

concat₂: [1,2]
leaf: multiset
cons₂: [1,2]
less_leaves2: multiset
false: multiset
true: multiset

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

concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true

(2) Obligation:

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

less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

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

[less_leaves2, cons₂] > concat₂

Status:

less_leaves2: [1,2]
cons₂: [1,2]
concat₂: [1,2]

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

less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

(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