Certification Problem

Input (TPDB SRS_Relative/ICFP_2010_relative/3856)

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

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

and S is the following TRS.

3(1(4(0(4(1(x1)))))) 3(3(4(2(1(4(5(3(5(1(x1)))))))))) (55)
0(1(3(4(5(x1))))) 2(5(2(4(3(4(2(3(4(5(x1)))))))))) (56)
0(4(5(2(3(5(x1)))))) 2(2(3(2(4(3(4(2(3(5(x1)))))))))) (57)
3(1(1(0(4(3(x1)))))) 4(3(4(2(4(3(0(3(1(4(x1)))))))))) (58)
4(5(4(2(3(x1))))) 2(2(4(2(2(1(4(5(2(1(x1)))))))))) (59)
1(0(1(1(2(1(4(x1))))))) 2(2(4(3(4(5(5(0(3(4(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
1(1(0(0(x1)))) 4(4(2(5(5(4(2(4(3(2(x1)))))))))) (61)
3(1(3(5(x1)))) 1(5(4(2(4(4(2(4(2(2(x1)))))))))) (62)
5(1(0(0(0(x1))))) 5(5(4(3(3(1(2(4(3(1(x1)))))))))) (63)
5(2(0(0(0(x1))))) 5(3(1(5(5(4(2(3(1(0(x1)))))))))) (64)
3(2(0(4(1(x1))))) 4(1(2(4(4(3(2(3(3(1(x1)))))))))) (65)
3(4(5(5(2(x1))))) 3(4(2(3(2(4(4(3(1(0(x1)))))))))) (66)
0(5(2(5(4(x1))))) 0(2(5(4(3(2(2(4(4(2(x1)))))))))) (67)
0(3(1(3(0(0(x1)))))) 0(2(2(2(3(3(1(2(1(2(x1)))))))))) (68)
5(1(1(1(1(1(x1)))))) 5(1(1(3(3(4(2(3(2(2(x1)))))))))) (69)
5(1(4(3(0(2(x1)))))) 5(4(1(2(1(3(2(4(3(2(x1)))))))))) (70)
2(0(1(5(0(4(x1)))))) 2(2(5(4(2(2(3(2(0(1(x1)))))))))) (71)
2(1(0(0(1(4(x1)))))) 2(5(3(4(2(2(4(1(0(4(x1)))))))))) (72)
3(4(0(1(1(5(x1)))))) 2(4(1(2(4(4(4(1(2(5(x1)))))))))) (73)
4(1(3(0(0(0(0(x1))))))) 2(2(5(5(5(1(1(2(1(0(x1)))))))))) (74)
3(1(0(0(1(0(0(x1))))))) 1(5(3(0(4(4(3(3(0(2(x1)))))))))) (75)
4(1(1(0(2(0(0(x1))))))) 1(4(4(4(4(4(0(2(2(5(x1)))))))))) (76)
3(4(0(3(5(0(0(x1))))))) 3(1(3(2(2(2(5(3(0(2(x1)))))))))) (77)
0(3(1(3(5(0(0(x1))))))) 0(2(2(2(4(5(3(2(5(5(x1)))))))))) (78)
4(0(0(0(0(1(0(x1))))))) 2(4(5(5(1(4(1(5(4(2(x1)))))))))) (79)
0(0(4(1(5(1(0(x1))))))) 0(5(3(4(2(0(4(2(2(2(x1)))))))))) (80)
0(0(4(4(5(2(0(x1))))))) 0(0(4(5(4(1(2(4(3(2(x1)))))))))) (81)
3(1(0(1(0(3(0(x1))))))) 3(3(0(3(5(4(2(1(4(0(x1)))))))))) (82)
4(1(5(2(0(5(0(x1))))))) 4(1(2(4(0(4(4(2(2(0(x1)))))))))) (83)
3(4(0(4(0(5(0(x1))))))) 3(4(1(2(1(2(5(3(5(0(x1)))))))))) (84)
5(2(0(0(1(5(0(x1))))))) 5(4(0(1(2(1(2(4(1(2(x1)))))))))) (85)
4(4(1(0(3(5(0(x1))))))) 4(2(1(5(5(2(4(2(1(2(x1)))))))))) (86)
4(4(5(0(3(5(0(x1))))))) 1(1(3(4(2(2(2(1(1(1(x1)))))))))) (87)
2(3(4(3(5(5(0(x1))))))) 2(3(3(4(2(0(3(3(3(2(x1)))))))))) (88)
4(5(5(3(4(0(1(x1))))))) 4(5(5(3(5(4(1(2(2(2(x1)))))))))) (89)
0(3(5(0(0(2(1(x1))))))) 0(3(3(0(2(1(3(0(2(2(x1)))))))))) (90)
4(0(0(0(3(2(1(x1))))))) 4(5(2(3(4(1(3(2(1(2(x1)))))))))) (91)
5(0(0(0(5(2(1(x1))))))) 5(2(5(0(3(0(5(5(0(1(x1)))))))))) (92)
0(3(5(5(0(4(1(x1))))))) 0(2(4(0(1(0(3(4(2(1(x1)))))))))) (93)
4(0(0(1(3(0(2(x1))))))) 2(3(3(3(5(1(1(4(0(2(x1)))))))))) (94)
5(4(5(2(5(0(2(x1))))))) 5(4(2(2(4(0(2(2(1(5(x1)))))))))) (95)
4(0(0(0(0(1(2(x1))))))) 2(2(1(2(2(5(5(4(1(2(x1)))))))))) (96)
2(1(0(0(0(3(2(x1))))))) 2(5(4(3(4(4(0(4(0(2(x1)))))))))) (97)
4(5(4(0(0(0(3(x1))))))) 2(3(0(0(3(1(2(4(4(3(x1)))))))))) (98)
3(3(4(5(0(0(3(x1))))))) 1(2(5(3(4(2(2(5(2(4(x1)))))))))) (99)
4(1(0(4(3(0(3(x1))))))) 2(5(1(0(3(4(2(4(2(4(x1)))))))))) (100)
0(0(0(5(5(2(3(x1))))))) 0(5(3(5(4(2(1(1(3(4(x1)))))))))) (101)
5(1(4(3(4(3(3(x1))))))) 5(4(1(1(2(4(4(3(4(4(x1)))))))))) (102)
3(4(5(0(4(3(4(x1))))))) 4(1(2(4(3(4(1(4(3(4(x1)))))))))) (103)
1(5(5(0(0(0(5(x1))))))) 0(2(3(3(5(2(2(3(2(5(x1)))))))))) (104)
4(4(1(1(0(0(5(x1))))))) 4(2(3(3(3(0(3(0(5(5(x1)))))))))) (105)
2(1(5(5(0(0(5(x1))))))) 2(2(5(1(4(1(5(5(5(5(x1)))))))))) (106)
4(1(5(2(1(0(5(x1))))))) 4(4(2(3(1(5(5(5(0(5(x1)))))))))) (107)
4(1(5(2(0(1(5(x1))))))) 1(5(5(4(2(4(2(1(0(5(x1)))))))))) (108)
5(4(1(0(1(1(5(x1))))))) 0(3(4(2(1(4(0(1(2(5(x1)))))))))) (109)
1(4(1(5(2(1(5(x1))))))) 3(4(2(2(0(5(4(2(5(5(x1)))))))))) (110)
4(4(1(3(5(2(5(x1))))))) 4(1(2(1(2(1(3(4(2(5(x1)))))))))) (111)
1(0(0(5(2(3(5(x1))))))) 3(5(5(4(3(4(1(2(4(3(x1)))))))))) (112)
4(1(0(5(4(3(5(x1))))))) 2(4(2(0(5(4(1(2(3(2(x1)))))))))) (113)
4(5(0(0(5(4(5(x1))))))) 2(0(4(0(1(5(3(1(5(5(x1)))))))))) (114)
1(4(0(4(1(3(x1)))))) 1(5(3(5(4(1(2(4(3(3(x1)))))))))) (115)
5(4(3(1(0(x1))))) 5(4(3(2(4(3(4(2(5(2(x1)))))))))) (116)
5(3(2(5(4(0(x1)))))) 5(3(2(4(3(4(2(3(2(2(x1)))))))))) (117)
3(4(0(1(1(3(x1)))))) 4(1(3(0(3(4(2(4(3(4(x1)))))))))) (118)
3(2(4(5(4(x1))))) 1(2(5(4(1(2(2(4(2(2(x1)))))))))) (119)
4(1(2(1(1(0(1(x1))))))) 4(3(0(5(5(4(3(4(2(2(x1)))))))))) (120)

1.1 Closure Under Flat Contexts

Using the flat contexts

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

We obtain the transformed TRS

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

1.1.1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS

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

1.1.1.1 Rule Removal

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

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

1.1.1.1.1 Rule Removal

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

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

1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[51(x1)] = 1 · x1
[14(x1)] = 1 + 1 · x1
[43(x1)] = 1 + 1 · x1
[34(x1)] = 1 · x1
[33(x1)] = 1 + 1 · x1
[35(x1)] = 1 + 1 · x1
[54(x1)] = 1 · x1
[41(x1)] = 1 · x1
[11(x1)] = 1 · x1
[12(x1)] = 1 · x1
[24(x1)] = 1 · x1
[44(x1)] = 1 · x1
[45(x1)] = 1 + 1 · x1
[31(x1)] = 1 · x1
[30(x1)] = 1 + 1 · x1
[40(x1)] = 1 · x1
[32(x1)] = 1 · x1
[42(x1)] = 1 · x1
[03(x1)] = 1 · x1
[13(x1)] = 1 · x1
[01(x1)] = 1 · x1
[15(x1)] = 1 · x1
[22(x1)] = 1 · x1
[10(x1)] = 1 · x1
[04(x1)] = 1 + 1 · x1
[52(x1)] = 1 · x1
[25(x1)] = 1 · x1
[21(x1)] = 1 · x1
[20(x1)] = 1 · x1
[23(x1)] = 1 + 1 · x1
all of the following rules can be deleted.
51(14(43(34(43(33(35(x1))))))) 54(41(11(12(24(44(43(34(44(45(x1)))))))))) (427)
51(14(43(34(43(33(31(x1))))))) 54(41(11(12(24(44(43(34(44(41(x1)))))))))) (428)
51(14(43(34(43(33(30(x1))))))) 54(41(11(12(24(44(43(34(44(40(x1)))))))))) (429)
51(14(43(34(43(33(34(x1))))))) 54(41(11(12(24(44(43(34(44(44(x1)))))))))) (430)
51(14(43(34(43(33(33(x1))))))) 54(41(11(12(24(44(43(34(44(43(x1)))))))))) (431)
51(14(43(34(43(33(32(x1))))))) 54(41(11(12(24(44(43(34(44(42(x1)))))))))) (432)
03(31(13(35(54(x1))))) 01(15(54(42(24(44(42(24(42(22(24(x1))))))))))) (502)
54(41(10(04(43(30(03(35(x1)))))))) 52(25(51(10(03(34(42(24(42(24(45(x1))))))))))) (949)
54(41(10(04(43(30(03(31(x1)))))))) 52(25(51(10(03(34(42(24(42(24(41(x1))))))))))) (950)
54(41(10(04(43(30(03(30(x1)))))))) 52(25(51(10(03(34(42(24(42(24(40(x1))))))))))) (951)
54(41(10(04(43(30(03(34(x1)))))))) 52(25(51(10(03(34(42(24(42(24(44(x1))))))))))) (952)
54(41(10(04(43(30(03(33(x1)))))))) 52(25(51(10(03(34(42(24(42(24(43(x1))))))))))) (953)
54(41(10(04(43(30(03(32(x1)))))))) 52(25(51(10(03(34(42(24(42(24(42(x1))))))))))) (954)
03(32(24(45(54(41(x1)))))) 01(12(25(54(41(12(22(24(42(22(21(x1))))))))))) (1316)
03(32(24(45(54(40(x1)))))) 01(12(25(54(41(12(22(24(42(22(20(x1))))))))))) (1317)
03(32(24(45(54(44(x1)))))) 01(12(25(54(41(12(22(24(42(22(24(x1))))))))))) (1318)
03(32(24(45(54(43(x1)))))) 01(12(25(54(41(12(22(24(42(22(23(x1))))))))))) (1319)
03(32(24(45(54(42(x1)))))) 01(12(25(54(41(12(22(24(42(22(22(x1))))))))))) (1320)

1.1.1.1.1.1.1.1.1 R is empty

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