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(b(a(a(x1)))) → a(a(b(a(a(b(c(b(a(c(x1))))))))))

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

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

c(b(a(a(x1)))) → a(a(b(a(a(b(c(b(a(c(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(b(a(a(x1)))) → a(a(b(a(a(b(c(b(a(c(x1))))))))))

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

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

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

Those nodes are connect through the following edges: