(3) 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:
0'(half(x)) → 0'(x)
0'(s(half(x))) → 0'(x)
s(s(half(x))) → half(s(x))
0'(log(s(x))) → 0'(s(x))
s(log(x)) → s(half(log(s(x))))
The certificate found is represented by the following graph.
The certificate consists of the following enumerated nodes:
752466, 752467, 752468, 752470, 752471, 752469, 752472, 752475, 752473, 752474
Node 752466 is start node and node 752467 is final node.
Those nodes are connect through the following edges:
- 752466 to 752468 labelled half_1(0), 0'_1(0)
- 752466 to 752467 labelled 0'_1(0), 0'_1(1)
- 752466 to 752469 labelled s_1(0)
- 752466 to 752472 labelled 0'_1(1), 0'_1(2)
- 752466 to 752474 labelled 0'_1(1), 0'_1(2)
- 752467 to 752467 labelled #_1(0)
- 752468 to 752467 labelled s_1(0)
- 752468 to 752472 labelled half_1(1)
- 752468 to 752473 labelled s_1(1)
- 752470 to 752471 labelled log_1(0)
- 752471 to 752467 labelled s_1(0)
- 752471 to 752472 labelled half_1(1)
- 752471 to 752473 labelled s_1(1)
- 752469 to 752470 labelled half_1(0)
- 752472 to 752467 labelled s_1(1), s_1(2)
- 752472 to 752472 labelled half_1(1)
- 752472 to 752473 labelled s_1(1), s_1(2)
- 752475 to 752467 labelled s_1(1)
- 752475 to 752472 labelled half_1(1)
- 752475 to 752473 labelled s_1(1)
- 752473 to 752474 labelled half_1(1)
- 752474 to 752475 labelled log_1(1)