(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:
2623947, 2623948, 2623949, 2623950
Node 2623947 is start node and node 2623948 is final node.
Those nodes are connect through the following edges:
- 2623947 to 2623949 labelled g_1(0)
- 2623947 to 2623950 labelled f_1(0)
- 2623947 to 2623948 labelled b(0)
- 2623948 to 2623948 labelled #_1(0)
- 2623949 to 2623948 labelled h_1(0), b(1)
- 2623950 to 2623948 labelled i_1(0), b(1)