(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(a(x)))) → a(a(b(a(a(b(c(b(a(c(x))))))))))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 23, 25, 26, 28, 30, 32, 34, 35, 37, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58
Node 3 is start node and node 4 is final node.
Those nodes are connected through the following edges:
- 3 to 5 labelled a_1(0)
- 4 to 4 labelled #_1(0)
- 5 to 6 labelled a_1(0)
- 6 to 7 labelled b_1(0)
- 7 to 8 labelled a_1(0)
- 8 to 9 labelled a_1(0)
- 9 to 10 labelled b_1(0)
- 10 to 11 labelled c_1(0)
- 10 to 41 labelled a_1(1)
- 11 to 12 labelled b_1(0)
- 12 to 13 labelled a_1(0)
- 13 to 4 labelled c_1(0)
- 13 to 23 labelled a_1(1)
- 23 to 25 labelled a_1(1)
- 25 to 26 labelled b_1(1)
- 26 to 28 labelled a_1(1)
- 28 to 30 labelled a_1(1)
- 30 to 32 labelled b_1(1)
- 32 to 34 labelled c_1(1)
- 32 to 50 labelled a_1(2)
- 34 to 35 labelled b_1(1)
- 35 to 37 labelled a_1(1)
- 37 to 4 labelled c_1(1)
- 37 to 23 labelled a_1(1)
- 41 to 42 labelled a_1(1)
- 42 to 43 labelled b_1(1)
- 43 to 44 labelled a_1(1)
- 44 to 45 labelled a_1(1)
- 45 to 46 labelled b_1(1)
- 46 to 47 labelled c_1(1)
- 47 to 48 labelled b_1(1)
- 48 to 49 labelled a_1(1)
- 49 to 23 labelled c_1(1)
- 50 to 51 labelled a_1(2)
- 51 to 52 labelled b_1(2)
- 52 to 53 labelled a_1(2)
- 53 to 54 labelled a_1(2)
- 54 to 55 labelled b_1(2)
- 55 to 56 labelled c_1(2)
- 56 to 57 labelled b_1(2)
- 57 to 58 labelled a_1(2)
- 58 to 23 labelled c_1(2)