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