(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:
f(a) → f(b)
g(b) → g(a)
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
2622057, 2622058, 2622059, 2622060
Node 2622057 is start node and node 2622058 is final node.
Those nodes are connect through the following edges:
- 2622057 to 2622059 labelled g_1(0)
- 2622057 to 2622060 labelled f_1(0)
- 2622058 to 2622058 labelled #_1(0)
- 2622059 to 2622058 labelled a(0)
- 2622060 to 2622058 labelled b(0)