(1) RFCMatchBoundsTRSProof (EQUIVALENT transformation)
Termination of the TRS R could be shown with a Match Bound [MATCHBOUNDS1,MATCHBOUNDS2] of 2. This implies Q-termination of R.
The following rules were used to construct the certificate:
c(b(a(X))) → a(a(b(b(c(c(X))))))
a(X) → e
b(X) → e
c(X) → e
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
7474477, 7474478, 7474480, 7474481, 7474482, 7474483, 7474479, 7474484, 7474485, 7474486, 7474487, 7474488
Node 7474477 is start node and node 7474478 is final node.
Those nodes are connect through the following edges:
- 7474477 to 7474478 labelled e(0)
- 7474477 to 7474479 labelled a_1(0), e(1)
- 7474478 to 7474478 labelled #_1(0)
- 7474480 to 7474481 labelled b_1(0), e(1)
- 7474481 to 7474482 labelled b_1(0), e(1)
- 7474482 to 7474483 labelled c_1(0), e(1)
- 7474483 to 7474478 labelled c_1(0), e(1)
- 7474483 to 7474484 labelled a_1(1), e(2)
- 7474479 to 7474480 labelled a_1(0), e(1)
- 7474484 to 7474485 labelled a_1(1), e(2)
- 7474485 to 7474486 labelled b_1(1), e(2)
- 7474486 to 7474487 labelled b_1(1), e(2)
- 7474487 to 7474488 labelled c_1(1), e(2)
- 7474488 to 7474478 labelled c_1(1), e(2)
- 7474488 to 7474484 labelled a_1(1), e(2)