(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(x)) → b(b(a(x)))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
9113194, 9113195, 9113196, 9113197, 9113199, 9113198
Node 9113194 is start node and node 9113195 is final node.
Those nodes are connect through the following edges:
- 9113194 to 9113196 labelled b_1(0)
- 9113195 to 9113195 labelled #_1(0)
- 9113196 to 9113197 labelled b_1(0)
- 9113197 to 9113195 labelled a_1(0)
- 9113197 to 9113198 labelled b_1(1)
- 9113199 to 9113195 labelled a_1(1)
- 9113199 to 9113198 labelled b_1(1)
- 9113198 to 9113199 labelled b_1(1)