(1) RFCMatchBoundsTRSProof (EQUIVALENT transformation)
Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 0. This implies Q-termination of R.
The following rules were used to construct the certificate:
a(b(x)) → a(c(b(x)))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
2622462, 2622463, 2622464, 2622465
Node 2622462 is start node and node 2622463 is final node.
Those nodes are connect through the following edges:
- 2622462 to 2622464 labelled a_1(0)
- 2622463 to 2622463 labelled #_1(0)
- 2622464 to 2622465 labelled c_1(0)
- 2622465 to 2622463 labelled b_1(0)