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:

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

Q is empty.


QTRS
  ↳ RFCMatchBoundsTRSProof

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

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

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

The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 6, 7, 5, 4, 3, 11, 10, 9, 8, 15, 16, 14, 13, 12, 20, 19, 18, 17, 24, 25, 23, 22, 21, 29, 28, 27, 26, 33, 34, 32, 31, 30, 38, 37, 36, 35, 42, 43, 41, 40, 39, 47, 46, 45, 44, 51, 52, 50, 49, 48, 56, 55, 54, 53, 60, 61, 59, 58, 57, 65, 64, 63, 62, 69, 70, 68, 67, 66, 74, 73, 72, 71, 78, 79, 77, 76, 75, 83, 82, 81, 80, 92, 91, 90, 89, 88, 87, 86, 85, 84, 96, 97, 95, 94, 93, 101, 100, 99, 98, 115, 114, 113, 112, 111, 110, 109, 108, 107

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

Those nodes are connect through the following edges: