(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:
f(h(x)) → f(i(x))
g(i(x)) → g(h(x))
h(a) → b
i(a) → b
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
2, 4, 5, 8
Node 2 is start node and node 4 is final node.
Those nodes are connected through the following edges:
- 2 to 5 labelled f_1(0)
- 2 to 8 labelled g_1(0)
- 2 to 4 labelled b(0)
- 4 to 4 labelled #_1(0)
- 5 to 4 labelled i_1(0), b(1)
- 8 to 4 labelled h_1(0), b(1)