(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:
2624650, 2624651, 2624652, 2624653, 2624654, 2624655
Node 2624650 is start node and node 2624651 is final node.
Those nodes are connect through the following edges:
- 2624650 to 2624652 labelled a_1(0)
- 2624651 to 2624651 labelled #_1(0)
- 2624652 to 2624653 labelled b_1(0)
- 2624653 to 2624651 labelled a_1(0)
- 2624653 to 2624654 labelled a_1(1)
- 2624654 to 2624655 labelled b_1(1)
- 2624655 to 2624651 labelled a_1(1)
- 2624655 to 2624654 labelled a_1(1)