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:

c(a(b(a(x1)))) → a(b(a(a(c(a(b(c(a(b(x1))))))))))

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

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

c(a(b(a(x1)))) → a(b(a(a(c(a(b(c(a(b(x1))))))))))

Q is empty.

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

c(a(b(a(x1)))) → a(b(a(a(c(a(b(c(a(b(x1))))))))))

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 9, 10, 6, 7, 11, 8, 3, 4, 5, 18, 19, 15, 16, 20, 17, 12, 13, 14, 27, 28, 24, 25, 29, 26, 21, 22, 23, 36, 37, 33, 34, 38, 35, 30, 31, 32

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

Those nodes are connect through the following edges: