Certification Problem

Input (TPDB SRS_Relative/ICFP_2010_relative/4181)

The relative rewrite relation R/S is considered where R is the following TRS

0(1(0(x1))) 2(3(3(2(2(3(2(4(2(4(x1)))))))))) (1)
0(0(0(4(0(x1))))) 3(4(4(4(1(2(2(0(3(4(x1)))))))))) (2)
0(4(4(1(1(x1))))) 0(4(2(3(2(2(2(2(2(2(x1)))))))))) (3)
0(5(4(1(2(x1))))) 3(2(1(3(3(4(2(3(2(1(x1)))))))))) (4)
1(0(0(3(0(x1))))) 1(1(2(3(2(3(2(4(3(0(x1)))))))))) (5)
0(0(0(0(4(5(x1)))))) 0(2(3(2(4(1(5(2(3(5(x1)))))))))) (6)
0(0(0(2(0(4(x1)))))) 3(2(2(1(2(4(1(1(0(4(x1)))))))))) (7)
0(0(4(5(3(0(x1)))))) 1(2(2(3(5(2(2(1(1(4(x1)))))))))) (8)
0(1(5(3(1(1(x1)))))) 3(2(1(3(2(1(2(5(5(3(x1)))))))))) (9)
0(2(0(0(1(1(x1)))))) 3(4(2(3(1(2(3(2(3(3(x1)))))))))) (10)
0(5(0(0(0(2(x1)))))) 2(3(2(0(5(4(3(1(2(1(x1)))))))))) (11)
1(4(0(3(0(4(x1)))))) 3(2(2(5(3(3(2(1(4(4(x1)))))))))) (12)
3(0(0(1(3(5(x1)))))) 2(1(3(3(2(0(5(3(1(5(x1)))))))))) (13)
3(1(4(0(1(2(x1)))))) 2(3(2(2(1(0(3(1(1(2(x1)))))))))) (14)
4(0(0(1(3(1(x1)))))) 3(2(2(1(2(0(5(4(4(1(x1)))))))))) (15)
4(5(0(2(4(1(x1)))))) 2(1(4(2(3(2(2(3(4(1(x1)))))))))) (16)
5(4(3(0(1(5(x1)))))) 5(2(3(3(3(2(1(5(3(2(x1)))))))))) (17)
0(0(1(2(3(0(5(x1))))))) 3(2(1(3(2(1(4(3(5(5(x1)))))))))) (18)
0(0(5(1(5(1(3(x1))))))) 3(3(1(3(3(5(0(3(2(2(x1)))))))))) (19)
0(0(5(2(5(2(1(x1))))))) 2(3(5(3(4(2(2(1(2(0(x1)))))))))) (20)
0(0(5(4(2(0(2(x1))))))) 3(2(3(2(2(0(0(3(1(3(x1)))))))))) (21)
0(1(0(5(5(2(0(x1))))))) 3(2(2(4(3(3(3(0(2(0(x1)))))))))) (22)
0(2(0(3(0(0(2(x1))))))) 3(2(3(1(3(4(4(5(2(3(x1)))))))))) (23)
0(2(2(5(0(4(3(x1))))))) 0(4(1(1(2(2(3(2(5(3(x1)))))))))) (24)
0(2(4(0(1(5(4(x1))))))) 3(2(0(1(3(2(1(5(3(4(x1)))))))))) (25)
0(3(0(0(0(0(0(x1))))))) 2(0(5(2(3(1(0(2(4(4(x1)))))))))) (26)
0(4(0(0(0(4(3(x1))))))) 0(5(5(2(1(3(2(3(3(3(x1)))))))))) (27)
0(4(5(5(5(0(4(x1))))))) 2(3(5(1(2(3(0(2(4(4(x1)))))))))) (28)
0(5(1(1(5(0(0(x1))))))) 3(2(1(0(5(2(0(3(3(4(x1)))))))))) (29)
0(5(2(2(4(1(0(x1))))))) 2(3(3(1(2(3(2(3(0(4(x1)))))))))) (30)
0(5(3(1(4(3(1(x1))))))) 2(3(2(1(3(4(4(1(0(1(x1)))))))))) (31)
1(0(3(1(0(0(0(x1))))))) 2(4(2(2(5(3(2(4(4(4(x1)))))))))) (32)
1(1(2(4(4(0(2(x1))))))) 1(1(2(2(3(2(1(5(2(2(x1)))))))))) (33)
1(2(4(4(0(5(1(x1))))))) 1(3(3(2(2(3(5(1(0(3(x1)))))))))) (34)
1(3(0(0(3(3(5(x1))))))) 3(2(2(1(2(4(5(4(3(5(x1)))))))))) (35)
1(4(1(3(0(4(3(x1))))))) 1(3(5(1(2(3(2(2(5(1(x1)))))))))) (36)
1(4(4(0(0(0(0(x1))))))) 2(1(2(4(3(3(5(3(1(0(x1)))))))))) (37)
1(5(0(0(5(3(3(x1))))))) 1(5(4(3(2(1(1(3(2(1(x1)))))))))) (38)
4(0(0(0(4(0(2(x1))))))) 4(4(2(2(3(2(4(1(2(2(x1)))))))))) (39)
4(0(0(0(4(1(4(x1))))))) 4(4(3(2(1(1(2(1(0(0(x1)))))))))) (40)
4(0(0(4(0(0(2(x1))))))) 3(0(3(2(3(3(5(4(1(5(x1)))))))))) (41)
4(0(0(4(5(2(4(x1))))))) 3(3(5(2(2(2(3(4(4(0(x1)))))))))) (42)
4(0(3(0(2(5(1(x1))))))) 4(3(3(2(3(4(3(1(0(3(x1)))))))))) (43)
4(0(4(0(1(1(2(x1))))))) 2(2(0(3(1(4(3(2(2(2(x1)))))))))) (44)
4(0(4(1(4(0(0(x1))))))) 3(1(2(2(0(0(2(1(1(4(x1)))))))))) (45)
4(1(0(5(4(1(4(x1))))))) 2(5(1(2(1(3(2(4(3(4(x1)))))))))) (46)
4(1(2(5(4(0(0(x1))))))) 2(4(5(1(3(0(3(2(0(4(x1)))))))))) (47)
4(1(4(0(3(1(0(x1))))))) 5(3(2(0(2(2(2(5(1(4(x1)))))))))) (48)
4(3(0(5(5(0(2(x1))))))) 3(0(3(2(3(2(2(4(5(2(x1)))))))))) (49)
4(3(5(5(4(1(0(x1))))))) 3(5(1(3(4(5(2(3(3(4(x1)))))))))) (50)
5(0(0(0(1(4(0(x1))))))) 5(2(5(3(2(2(3(0(5(4(x1)))))))))) (51)
5(0(2(1(5(1(5(x1))))))) 5(3(2(3(3(3(4(3(3(2(x1)))))))))) (52)
5(0(2(5(4(4(0(x1))))))) 5(4(0(3(2(2(1(1(3(4(x1)))))))))) (53)
5(0(5(0(1(5(2(x1))))))) 5(3(2(3(2(4(3(2(0(2(x1)))))))))) (54)
5(0(5(5(5(4(5(x1))))))) 5(2(3(3(2(3(3(0(3(2(x1)))))))))) (55)
5(3(0(1(4(3(1(x1))))))) 3(2(2(1(2(1(0(0(3(1(x1)))))))))) (56)
5(3(5(0(1(0(1(x1))))))) 5(3(2(2(1(5(5(3(5(1(x1)))))))))) (57)
5(4(0(4(1(0(3(x1))))))) 5(3(2(2(4(4(3(2(4(3(x1)))))))))) (58)

and S is the following TRS.

1(5(5(1(3(1(x1)))))) 3(3(2(1(2(1(4(4(3(1(x1)))))))))) (59)
4(0(2(1(3(1(1(x1))))))) 4(0(5(5(5(3(2(3(2(2(x1)))))))))) (60)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 String Reversal

Since only unary symbols occur, one can reverse all terms and obtains the TRS
0(1(0(x1))) 4(2(4(2(3(2(2(3(3(2(x1)))))))))) (61)
0(4(0(0(0(x1))))) 4(3(0(2(2(1(4(4(4(3(x1)))))))))) (62)
1(1(4(4(0(x1))))) 2(2(2(2(2(2(3(2(4(0(x1)))))))))) (63)
2(1(4(5(0(x1))))) 1(2(3(2(4(3(3(1(2(3(x1)))))))))) (64)
0(3(0(0(1(x1))))) 0(3(4(2(3(2(3(2(1(1(x1)))))))))) (65)
5(4(0(0(0(0(x1)))))) 5(3(2(5(1(4(2(3(2(0(x1)))))))))) (66)
4(0(2(0(0(0(x1)))))) 4(0(1(1(4(2(1(2(2(3(x1)))))))))) (67)
0(3(5(4(0(0(x1)))))) 4(1(1(2(2(5(3(2(2(1(x1)))))))))) (68)
1(1(3(5(1(0(x1)))))) 3(5(5(2(1(2(3(1(2(3(x1)))))))))) (69)
1(1(0(0(2(0(x1)))))) 3(3(2(3(2(1(3(2(4(3(x1)))))))))) (70)
2(0(0(0(5(0(x1)))))) 1(2(1(3(4(5(0(2(3(2(x1)))))))))) (71)
4(0(3(0(4(1(x1)))))) 4(4(1(2(3(3(5(2(2(3(x1)))))))))) (72)
5(3(1(0(0(3(x1)))))) 5(1(3(5(0(2(3(3(1(2(x1)))))))))) (73)
2(1(0(4(1(3(x1)))))) 2(1(1(3(0(1(2(2(3(2(x1)))))))))) (74)
1(3(1(0(0(4(x1)))))) 1(4(4(5(0(2(1(2(2(3(x1)))))))))) (75)
1(4(2(0(5(4(x1)))))) 1(4(3(2(2(3(2(4(1(2(x1)))))))))) (76)
5(1(0(3(4(5(x1)))))) 2(3(5(1(2(3(3(3(2(5(x1)))))))))) (77)
5(0(3(2(1(0(0(x1))))))) 5(5(3(4(1(2(3(1(2(3(x1)))))))))) (78)
3(1(5(1(5(0(0(x1))))))) 2(2(3(0(5(3(3(1(3(3(x1)))))))))) (79)
1(2(5(2(5(0(0(x1))))))) 0(2(1(2(2(4(3(5(3(2(x1)))))))))) (80)
2(0(2(4(5(0(0(x1))))))) 3(1(3(0(0(2(2(3(2(3(x1)))))))))) (81)
0(2(5(5(0(1(0(x1))))))) 0(2(0(3(3(3(4(2(2(3(x1)))))))))) (82)
2(0(0(3(0(2(0(x1))))))) 3(2(5(4(4(3(1(3(2(3(x1)))))))))) (83)
3(4(0(5(2(2(0(x1))))))) 3(5(2(3(2(2(1(1(4(0(x1)))))))))) (84)
4(5(1(0(4(2(0(x1))))))) 4(3(5(1(2(3(1(0(2(3(x1)))))))))) (85)
0(0(0(0(0(3(0(x1))))))) 4(4(2(0(1(3(2(5(0(2(x1)))))))))) (86)
3(4(0(0(0(4(0(x1))))))) 3(3(3(2(3(1(2(5(5(0(x1)))))))))) (87)
4(0(5(5(5(4(0(x1))))))) 4(4(2(0(3(2(1(5(3(2(x1)))))))))) (88)
0(0(5(1(1(5(0(x1))))))) 4(3(3(0(2(5(0(1(2(3(x1)))))))))) (89)
0(1(4(2(2(5(0(x1))))))) 4(0(3(2(3(2(1(3(3(2(x1)))))))))) (90)
1(3(4(1(3(5(0(x1))))))) 1(0(1(4(4(3(1(2(3(2(x1)))))))))) (91)
0(0(0(1(3(0(1(x1))))))) 4(4(4(2(3(5(2(2(4(2(x1)))))))))) (92)
2(0(4(4(2(1(1(x1))))))) 2(2(5(1(2(3(2(2(1(1(x1)))))))))) (93)
1(5(0(4(4(2(1(x1))))))) 3(0(1(5(3(2(2(3(3(1(x1)))))))))) (94)
5(3(3(0(0(3(1(x1))))))) 5(3(4(5(4(2(1(2(2(3(x1)))))))))) (95)
3(4(0(3(1(4(1(x1))))))) 1(5(2(2(3(2(1(5(3(1(x1)))))))))) (96)
0(0(0(0(4(4(1(x1))))))) 0(1(3(5(3(3(4(2(1(2(x1)))))))))) (97)
3(3(5(0(0(5(1(x1))))))) 1(2(3(1(1(2(3(4(5(1(x1)))))))))) (98)
2(0(4(0(0(0(4(x1))))))) 2(2(1(4(2(3(2(2(4(4(x1)))))))))) (99)
4(1(4(0(0(0(4(x1))))))) 0(0(1(2(1(1(2(3(4(4(x1)))))))))) (100)
2(0(0(4(0(0(4(x1))))))) 5(1(4(5(3(3(2(3(0(3(x1)))))))))) (101)
4(2(5(4(0(0(4(x1))))))) 0(4(4(3(2(2(2(5(3(3(x1)))))))))) (102)
1(5(2(0(3(0(4(x1))))))) 3(0(1(3(4(3(2(3(3(4(x1)))))))))) (103)
2(1(1(0(4(0(4(x1))))))) 2(2(2(3(4(1(3(0(2(2(x1)))))))))) (104)
0(0(4(1(4(0(4(x1))))))) 4(1(1(2(0(0(2(2(1(3(x1)))))))))) (105)
4(1(4(5(0(1(4(x1))))))) 4(3(4(2(3(1(2(1(5(2(x1)))))))))) (106)
0(0(4(5(2(1(4(x1))))))) 4(0(2(3(0(3(1(5(4(2(x1)))))))))) (107)
0(1(3(0(4(1(4(x1))))))) 4(1(5(2(2(2(0(2(3(5(x1)))))))))) (108)
2(0(5(5(0(3(4(x1))))))) 2(5(4(2(2(3(2(3(0(3(x1)))))))))) (109)
0(1(4(5(5(3(4(x1))))))) 4(3(3(2(5(4(3(1(5(3(x1)))))))))) (110)
0(4(1(0(0(0(5(x1))))))) 4(5(0(3(2(2(3(5(2(5(x1)))))))))) (111)
5(1(5(1(2(0(5(x1))))))) 2(3(3(4(3(3(3(2(3(5(x1)))))))))) (112)
0(4(4(5(2(0(5(x1))))))) 4(3(1(1(2(2(3(0(4(5(x1)))))))))) (113)
2(5(1(0(5(0(5(x1))))))) 2(0(2(3(4(2(3(2(3(5(x1)))))))))) (114)
5(4(5(5(5(0(5(x1))))))) 2(3(0(3(3(2(3(3(2(5(x1)))))))))) (115)
1(3(4(1(0(3(5(x1))))))) 1(3(0(0(1(2(1(2(2(3(x1)))))))))) (116)
1(0(1(0(5(3(5(x1))))))) 1(5(3(5(5(1(2(2(3(5(x1)))))))))) (117)
3(0(1(4(0(4(5(x1))))))) 3(4(2(3(4(4(2(2(3(5(x1)))))))))) (118)
1(3(1(5(5(1(x1)))))) 1(3(4(4(1(2(1(2(3(3(x1)))))))))) (119)
1(1(3(1(2(0(4(x1))))))) 2(2(3(2(3(5(5(5(0(4(x1)))))))))) (120)

1.1 Closure Under Flat Contexts

Using the flat contexts

{0(), 1(), 4(), 2(), 3(), 5()}

We obtain the transformed TRS

There are 225 ruless (increase limit for explicit display).

1.1.1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS

There are 1350 ruless (increase limit for explicit display).

1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[03(x1)] = 1 · x1
[30(x1)] = 1 + 1 · x1
[00(x1)] = 1 + 1 · x1
[01(x1)] = 1 · x1
[10(x1)] = 1 + 1 · x1
[34(x1)] = 1 · x1
[42(x1)] = 1 · x1
[23(x1)] = 1 · x1
[32(x1)] = 1 · x1
[21(x1)] = 1 · x1
[11(x1)] = 1 · x1
[13(x1)] = 1 · x1
[14(x1)] = 1 · x1
[12(x1)] = 1 · x1
[15(x1)] = 1 · x1
[54(x1)] = 1 · x1
[40(x1)] = 1 + 1 · x1
[53(x1)] = 1 · x1
[25(x1)] = 1 · x1
[51(x1)] = 1 + 1 · x1
[20(x1)] = 1 + 1 · x1
[04(x1)] = 1 · x1
[02(x1)] = 1 · x1
[05(x1)] = 1 + 1 · x1
[22(x1)] = 1 · x1
[33(x1)] = 1 · x1
[31(x1)] = 1 · x1
[35(x1)] = 1 · x1
[41(x1)] = 1 + 1 · x1
[44(x1)] = 1 · x1
[52(x1)] = 1 · x1
[50(x1)] = 1 + 1 · x1
[24(x1)] = 1 · x1
[45(x1)] = 1 · x1
[43(x1)] = 1 · x1
[55(x1)] = 1 · x1
all of the following rules can be deleted.

There are 1210 ruless (increase limit for explicit display).

1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[53(x1)] = 1 · x1
[31(x1)] = 1 + 1 · x1
[10(x1)] = 1 + 1 · x1
[00(x1)] = 1 + 1 · x1
[03(x1)] = 1 + 1 · x1
[30(x1)] = 1 · x1
[51(x1)] = 1 · x1
[13(x1)] = 1 · x1
[35(x1)] = 1 · x1
[50(x1)] = 1 · x1
[02(x1)] = 1 · x1
[23(x1)] = 1 · x1
[33(x1)] = 1 · x1
[12(x1)] = 1 · x1
[20(x1)] = 1 + 1 · x1
[21(x1)] = 1 + 1 · x1
[34(x1)] = 1 · x1
[24(x1)] = 1 · x1
[32(x1)] = 1 + 1 · x1
[22(x1)] = 1 · x1
[25(x1)] = 1 + 1 · x1
[04(x1)] = 1 + 1 · x1
[44(x1)] = 1 + 1 · x1
[42(x1)] = 1 + 1 · x1
[11(x1)] = 1 + 1 · x1
[14(x1)] = 1 + 1 · x1
[15(x1)] = 1 + 1 · x1
[40(x1)] = 1 + 1 · x1
[41(x1)] = 1 · x1
[43(x1)] = 1 + 1 · x1
[45(x1)] = 1 + 1 · x1
[01(x1)] = 1 · x1
[54(x1)] = 1 · x1
[52(x1)] = 1 + 1 · x1
[55(x1)] = 1 + 1 · x1
[05(x1)] = 1 · x1
all of the following rules can be deleted.

There are 119 ruless (increase limit for explicit display).

1.1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[13(x1)] = 1 + 1 · x1
[34(x1)] = 1 + 1 · x1
[41(x1)] = 1 · x1
[10(x1)] = 1 · x1
[03(x1)] = 1 · x1
[35(x1)] = 1 · x1
[50(x1)] = 1 · x1
[30(x1)] = 1 · x1
[00(x1)] = 1 · x1
[01(x1)] = 1 + 1 · x1
[12(x1)] = 1 · x1
[21(x1)] = 1 · x1
[22(x1)] = 1 · x1
[23(x1)] = 1 · x1
[53(x1)] = 1 · x1
[33(x1)] = 1 · x1
[54(x1)] = 1 + 1 · x1
[52(x1)] = 1 + 1 · x1
[32(x1)] = 1 + 1 · x1
[42(x1)] = 1 · x1
[14(x1)] = 1 + 1 · x1
[45(x1)] = 1 + 1 · x1
[24(x1)] = 1 · x1
[43(x1)] = 1 · x1
[31(x1)] = 1 + 1 · x1
[02(x1)] = 1 + 1 · x1
[51(x1)] = 1 + 1 · x1
[15(x1)] = 1 · x1
[55(x1)] = 1 · x1
[44(x1)] = 1 · x1
[11(x1)] = 1 + 1 · x1
[20(x1)] = 1 + 1 · x1
[04(x1)] = 1 · x1
[40(x1)] = 1 · x1
all of the following rules can be deleted.
01(11(13(31(12(20(04(40(x1)))))))) 02(22(23(32(23(35(55(55(50(04(40(x1))))))))))) (1633)
01(11(13(31(12(20(04(43(x1)))))))) 02(22(23(32(23(35(55(55(50(04(43(x1))))))))))) (1634)
01(11(13(31(12(20(04(41(x1)))))))) 02(22(23(32(23(35(55(55(50(04(41(x1))))))))))) (1635)
01(11(13(31(12(20(04(44(x1)))))))) 02(22(23(32(23(35(55(55(50(04(44(x1))))))))))) (1636)
01(11(13(31(12(20(04(42(x1)))))))) 02(22(23(32(23(35(55(55(50(04(42(x1))))))))))) (1637)
01(11(13(31(12(20(04(45(x1)))))))) 02(22(23(32(23(35(55(55(50(04(45(x1))))))))))) (1638)
31(11(13(31(12(20(04(40(x1)))))))) 32(22(23(32(23(35(55(55(50(04(40(x1))))))))))) (1657)
31(11(13(31(12(20(04(43(x1)))))))) 32(22(23(32(23(35(55(55(50(04(43(x1))))))))))) (1658)
31(11(13(31(12(20(04(41(x1)))))))) 32(22(23(32(23(35(55(55(50(04(41(x1))))))))))) (1659)
31(11(13(31(12(20(04(44(x1)))))))) 32(22(23(32(23(35(55(55(50(04(44(x1))))))))))) (1660)
31(11(13(31(12(20(04(42(x1)))))))) 32(22(23(32(23(35(55(55(50(04(42(x1))))))))))) (1661)
31(11(13(31(12(20(04(45(x1)))))))) 32(22(23(32(23(35(55(55(50(04(45(x1))))))))))) (1662)

1.1.1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[13(x1)] = 1 · x1
[34(x1)] = 1 · x1
[41(x1)] = 1 · x1
[10(x1)] = 1 · x1
[03(x1)] = 1 + 1 · x1
[35(x1)] = 1 + 1 · x1
[50(x1)] = 1 + 1 · x1
[30(x1)] = 1 · x1
[00(x1)] = 1 + 1 · x1
[01(x1)] = 1 + 1 · x1
[12(x1)] = 1 · x1
[21(x1)] = 1 · x1
[22(x1)] = 1 · x1
[23(x1)] = 1 · x1
[53(x1)] = 1 + 1 · x1
[33(x1)] = 1 + 1 · x1
[54(x1)] = 1 + 1 · x1
[52(x1)] = 1 + 1 · x1
[32(x1)] = 1 · x1
[42(x1)] = 1 · x1
[14(x1)] = 1 + 1 · x1
[45(x1)] = 1 + 1 · x1
[24(x1)] = 1 + 1 · x1
[43(x1)] = 1 · x1
[31(x1)] = 1 + 1 · x1
[02(x1)] = 1 · x1
[51(x1)] = 1 + 1 · x1
[15(x1)] = 1 + 1 · x1
[55(x1)] = 1 + 1 · x1
[44(x1)] = 1 · x1
all of the following rules can be deleted.
13(34(41(10(03(35(50(x1))))))) 13(30(00(01(12(21(12(22(23(30(x1)))))))))) (457)
13(34(41(10(03(35(54(x1))))))) 13(30(00(01(12(21(12(22(23(34(x1)))))))))) (460)
13(34(41(10(03(35(52(x1))))))) 13(30(00(01(12(21(12(22(23(32(x1)))))))))) (461)
13(31(15(55(51(12(x1)))))) 13(34(44(41(12(21(12(23(33(32(x1)))))))))) (1631)

1.1.1.1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[13(x1)] = 1 · x1
[34(x1)] = 1 · x1
[41(x1)] = 1 · x1
[10(x1)] = 1 · x1
[03(x1)] = 1 · x1
[35(x1)] = 1 · x1
[53(x1)] = 1 · x1 + 1
[30(x1)] = 1 · x1
[00(x1)] = 1 · x1
[01(x1)] = 1 · x1
[12(x1)] = 1 · x1
[21(x1)] = 1 · x1
[22(x1)] = 1 · x1
[23(x1)] = 1 · x1
[33(x1)] = 1 · x1
[42(x1)] = 1 · x1
[14(x1)] = 1 · x1
[45(x1)] = 1 · x1
[50(x1)] = 1 · x1 + 1
[32(x1)] = 1 · x1
[24(x1)] = 1 · x1
[43(x1)] = 1 · x1
[31(x1)] = 1 · x1
[02(x1)] = 1 · x1
[52(x1)] = 1 · x1
[51(x1)] = 1 · x1
all of the following rules can be deleted.
13(34(41(10(03(35(53(x1))))))) 13(30(00(01(12(21(12(22(23(33(x1)))))))))) (458)
42(21(14(45(50(01(x1)))))) 41(12(23(32(24(43(33(31(12(23(31(x1))))))))))) (597)
42(21(14(45(50(02(x1)))))) 41(12(23(32(24(43(33(31(12(23(32(x1))))))))))) (599)
52(21(14(45(50(01(x1)))))) 51(12(23(32(24(43(33(31(12(23(31(x1))))))))))) (615)
52(21(14(45(50(02(x1)))))) 51(12(23(32(24(43(33(31(12(23(32(x1))))))))))) (617)

1.1.1.1.1.1.1.1.1 R is empty

There are no rules in the TRS. Hence, it is terminating.