(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:
911001, 911002, 911004, 911003
Node 911001 is start node and node 911002 is final node.
Those nodes are connect through the following edges:
- 911001 to 911003 labelled g_1(0)
- 911001 to 911002 labelled f_1(0), f_1(1)
- 911002 to 911002 labelled #_1(0)
- 911004 to 911002 labelled 0(0)
- 911003 to 911004 labelled f_1(0)