(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(0) → cons(0)
f(s(0)) → f(p(s(0)))
p(s(0)) → 0
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
2324115, 2324116, 2324117, 2324119, 2324118
Node 2324115 is start node and node 2324116 is final node.
Those nodes are connect through the following edges:
- 2324115 to 2324116 labelled 0(0)
- 2324115 to 2324115 labelled cons_1(0)
- 2324115 to 2324117 labelled f_1(0), cons_1(1)
- 2324116 to 2324116 labelled #_1(0)
- 2324117 to 2324118 labelled p_1(0)
- 2324117 to 2324116 labelled 0(1)
- 2324119 to 2324116 labelled 0(0)
- 2324118 to 2324119 labelled s_1(0)