(1) RFCMatchBoundsTRSProof (EQUIVALENT transformation)
Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 1. This implies Q-termination of R.
The following rules were used to construct the certificate:
a(a(x)) → a(b(a(x)))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
5, 6, 9, 10, 13, 14
Node 5 is start node and node 6 is final node.
Those nodes are connected through the following edges:
- 5 to 9 labelled a_1(0)
- 6 to 6 labelled #_1(0)
- 9 to 10 labelled b_1(0)
- 10 to 6 labelled a_1(0)
- 10 to 13 labelled a_1(1)
- 13 to 14 labelled b_1(1)
- 14 to 6 labelled a_1(1)
- 14 to 13 labelled a_1(1)