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

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

g(c(x1)) → g(f(c(x1)))
g(f(c(x1))) → g(f(f(c(x1))))
g(g(x1)) → g(f(g(x1)))
f(f(g(x1))) → g(f(x1))

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

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

g(c(x1)) → g(f(c(x1)))
g(f(c(x1))) → g(f(f(c(x1))))
g(g(x1)) → g(f(g(x1)))
f(f(g(x1))) → g(f(x1))

Q is empty.

Termination of the TRS R could be shown with a Match Bound [6,7] of 3. This implies Q-termination of R.
The following rules were used to construct the certificate:

g(c(x1)) → g(f(c(x1)))
g(f(c(x1))) → g(f(f(c(x1))))
g(g(x1)) → g(f(g(x1)))
f(f(g(x1))) → g(f(x1))

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 3, 6, 4, 5, 8, 7, 11, 9, 10, 12, 14, 13, 17, 15, 16, 19, 18, 21, 20

Node 1 is start node and node 2 is final node.

Those nodes are connect through the following edges: