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

(0) Obligation:

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

g → h
c → d
h → g

Q is empty.

(1) QTRS Reverse (EQUIVALENT transformation)

We applied the QTRS Reverse Processor [REVERSE].

(2) Obligation:

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

g'(x) → h'(x)
c'(x) → d'(x)
h'(x) → g'(x)

Q is empty.

(3) NonTerminationProof (EQUIVALENT transformation)

We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.

Found the self-embedding DerivationStructure:

h' → h'

h' → h'
by OverlapClosure OC 2

h' → g'
by original rule (OC 1)

g' → h'
by original rule (OC 1)

(4) NO