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

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

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

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

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

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

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

Those nodes are connect through the following edges: