(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(b(a(x))) → b(a(b(x)))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
1, 3, 5, 7, 9, 10
Node 1 is start node and node 3 is final node.
Those nodes are connected through the following edges:
- 1 to 5 labelled b_1(0)
- 3 to 3 labelled #_1(0)
- 5 to 7 labelled a_1(0)
- 5 to 9 labelled b_1(1)
- 7 to 3 labelled b_1(0)
- 9 to 10 labelled a_1(1)
- 9 to 9 labelled b_1(1)
- 10 to 3 labelled b_1(1)