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

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

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

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

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 10, 6, 7, 5, 9, 8, 4, 3, 18, 14, 15, 13, 17, 16, 12, 11, 26, 22, 23, 21, 25, 24, 20, 19, 34, 30, 31, 29, 33, 32, 28, 27, 42, 38, 39, 37, 41, 40, 36, 35, 50, 46, 47, 45, 49, 48, 44, 43, 58, 54, 55, 53, 57, 56, 52, 51, 66, 62, 63, 61, 65, 64, 60, 59, 73, 74, 72, 71, 68, 69, 67, 70, 85, 81, 82, 80, 84, 83, 79, 78

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

Those nodes are connect through the following edges: