(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:
725507, 725508, 725509, 725510
Node 725507 is start node and node 725508 is final node.
Those nodes are connect through the following edges:
- 725507 to 725509 labelled g_1(0)
- 725507 to 725510 labelled f_1(0)
- 725508 to 725508 labelled #_1(0)
- 725509 to 725508 labelled a(0)
- 725510 to 725508 labelled b(0)