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(X) → h(X)
c → d
h(d) → g(c)

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)
d'(h(x)) → c'(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:

d' h → d' h

d' h → d' h
by OverlapClosure OC 2

d' h → d' g
by OverlapClosure OC 3

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

c' → d'
by original rule (OC 1)

g → h
by original rule (OC 1)

(4) NO