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