(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:

1, 4, 5, 7, 9, 10, 11, 15, 16, 17, 18, 19

Node 1 is start node and node 4 is final node.

Those nodes are connected through the following edges:

• 1 to 5 labelled a_1(0), e(1)
• 1 to 4 labelled e(0)
• 4 to 4 labelled #_1(0)
• 5 to 7 labelled a_1(0), e(1)
• 7 to 9 labelled b_1(0), e(1)
• 9 to 10 labelled b_1(0), e(1)
• 10 to 11 labelled c_1(0), e(1)
• 11 to 4 labelled c_1(0), e(1)
• 11 to 15 labelled a_1(1), e(2)
• 15 to 16 labelled a_1(1), e(2)
• 16 to 17 labelled b_1(1), e(2)
• 17 to 18 labelled b_1(1), e(2)
• 18 to 19 labelled c_1(1), e(2)
• 19 to 4 labelled c_1(1), e(2)
• 19 to 15 labelled a_1(1), e(2)