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:

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

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

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

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

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

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 10, 8, 9, 6, 7, 5, 4, 3, 18, 16, 17, 14, 15, 13, 12, 11, 26, 24, 25, 22, 23, 21, 20, 19, 34, 32, 33, 30, 31, 29, 28, 27, 42, 40, 41, 38, 39, 37, 36, 35, 50, 48, 49, 46, 47, 45, 44, 43

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

Those nodes are connect through the following edges: