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:

c → f
f → g

Q is empty.

(1) DirectTerminationProof (EQUIVALENT transformation)

We use [DIRECT_TERMINATION] with the following order to prove termination.

Knuth-Bendix order [KBO] with precedence:

f > g > c

and weight map:

c=2
f=1
g=1

The variable weight is 1

(2) TRUE