(3) 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:
b(b(b(b(a(b(x)))))) → a(b(b(b(b(b(a(x)))))))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
3, 4, 11, 12, 13, 14, 15, 16, 29, 30, 31, 32, 33, 34
Node 3 is start node and node 4 is final node.
Those nodes are connected through the following edges:
- 3 to 11 labelled a_1(0)
- 4 to 4 labelled #_1(0)
- 11 to 12 labelled b_1(0)
- 12 to 13 labelled b_1(0)
- 12 to 29 labelled a_1(1)
- 13 to 14 labelled b_1(0)
- 14 to 15 labelled b_1(0)
- 15 to 16 labelled b_1(0)
- 16 to 4 labelled a_1(0)
- 29 to 30 labelled b_1(1)
- 30 to 31 labelled b_1(1)
- 30 to 29 labelled a_1(1)
- 31 to 32 labelled b_1(1)
- 32 to 33 labelled b_1(1)
- 33 to 34 labelled b_1(1)
- 34 to 4 labelled a_1(1)