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(x1))))) → 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(x1))))) → 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 4. This implies Q-termination of R.
The following rules were used to construct the certificate:

b(a(b(a(a(x1))))) → 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, 9, 7, 8, 5, 6, 4, 3, 16, 14, 15, 12, 13, 11, 10, 23, 21, 22, 19, 20, 18, 17, 30, 28, 29, 26, 27, 25, 24, 37, 35, 36, 33, 34, 32, 31, 44, 42, 43, 40, 41, 39, 38, 51, 49, 50, 47, 48, 46, 45, 58, 56, 57, 54, 55, 53, 52, 64, 65, 62, 63, 60, 61, 59, 71, 72, 69, 70, 67, 68, 66

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

Those nodes are connect through the following edges: