(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(f(x)) → f(x)
g(0) → g(f(0))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
2939511, 2939512, 2939514, 2939513
Node 2939511 is start node and node 2939512 is final node.
Those nodes are connect through the following edges:
- 2939511 to 2939513 labelled g_1(0)
- 2939511 to 2939512 labelled f_1(0), f_1(1)
- 2939512 to 2939512 labelled #_1(0)
- 2939514 to 2939512 labelled 0(0)
- 2939513 to 2939514 labelled f_1(0)