(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:
a(b(x)) → b(b(a(x)))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
2623782, 2623783, 2623784, 2623785, 2623786, 2623787
Node 2623782 is start node and node 2623783 is final node.
Those nodes are connect through the following edges:
- 2623782 to 2623784 labelled b_1(0)
- 2623783 to 2623783 labelled #_1(0)
- 2623784 to 2623785 labelled b_1(0)
- 2623785 to 2623783 labelled a_1(0)
- 2623785 to 2623786 labelled b_1(1)
- 2623786 to 2623787 labelled b_1(1)
- 2623787 to 2623783 labelled a_1(1)
- 2623787 to 2623786 labelled b_1(1)