(3) 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:
g(f(x)) → f(f(g(x)))
h(f(x)) → g(h(x))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
7473851, 7473852, 7473853, 7473854, 7473855, 7473856, 7473857, 7473858
Node 7473851 is start node and node 7473852 is final node.
Those nodes are connect through the following edges:
- 7473851 to 7473853 labelled f_1(0)
- 7473851 to 7473855 labelled g_1(0)
- 7473852 to 7473852 labelled #_1(0)
- 7473853 to 7473854 labelled f_1(0)
- 7473854 to 7473852 labelled g_1(0)
- 7473854 to 7473856 labelled f_1(1)
- 7473855 to 7473852 labelled h_1(0)
- 7473855 to 7473858 labelled g_1(1)
- 7473856 to 7473857 labelled f_1(1)
- 7473857 to 7473852 labelled g_1(1)
- 7473857 to 7473856 labelled f_1(1)
- 7473858 to 7473852 labelled h_1(1)
- 7473858 to 7473858 labelled g_1(1)