Termination w.r.t. Q proof of TRS/nontermin/CSRExConc

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

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

f₁(X) -> g₁(h₁(f₁(X)))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

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

f₁(X) -> g₁(h₁(f₁(X)))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F₁(X) -> F₁(X)

The TRS R consists of the following rules:

f₁(X) -> g₁(h₁(f₁(X)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₁(X) -> F₁(X)

The TRS R consists of the following rules:

f₁(X) -> g₁(h₁(f₁(X)))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.