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

(0) Obligation:

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

f(X) → f(a)
b → a

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

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

f₁ > a
b > a

Status:

f₁: [1]
a: multiset
b: multiset

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

b → a

(2) Obligation:

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

f(X) → f(a)

Q is empty.