Certification Problem

Input (TPDB SRS_Relative/ICFP_2010_relative/88143)

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

0(0(0(1(1(1(2(3(3(1(3(3(2(x1))))))))))))) 0(2(2(1(0(1(2(3(0(0(3(2(2(3(1(2(2(x1))))))))))))))))) (1)
0(0(0(3(3(1(1(1(3(3(1(3(2(x1))))))))))))) 3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1))))))))))))))))) (2)
0(0(2(0(3(1(3(2(1(0(0(2(3(x1))))))))))))) 0(2(2(2(1(3(3(3(2(2(0(3(1(3(2(1(2(x1))))))))))))))))) (3)
0(1(0(0(3(3(2(1(2(0(1(2(3(x1))))))))))))) 3(2(2(1(2(2(0(3(0(2(2(2(1(2(2(3(1(x1))))))))))))))))) (4)
0(1(2(0(1(1(0(2(2(1(2(0(2(x1))))))))))))) 2(0(3(3(2(2(1(0(3(3(3(3(2(2(2(3(3(x1))))))))))))))))) (5)
0(1(2(1(1(1(2(2(0(1(3(2(0(x1))))))))))))) 2(3(2(0(1(2(3(0(3(3(2(1(3(3(1(3(3(x1))))))))))))))))) (6)
0(2(2(0(0(3(1(0(3(2(1(3(0(x1))))))))))))) 3(1(2(2(1(3(3(2(2(3(0(2(2(1(1(1(0(x1))))))))))))))))) (7)
0(2(3(3(1(0(3(3(0(2(3(1(1(x1))))))))))))) 2(1(3(2(2(2(0(2(2(2(3(3(2(2(2(0(3(x1))))))))))))))))) (8)
0(3(0(3(0(2(3(0(0(3(1(2(1(x1))))))))))))) 3(1(1(2(2(3(0(1(2(2(2(2(3(2(2(2(0(x1))))))))))))))))) (9)
0(3(0(3(1(0(1(2(2(0(3(1(3(x1))))))))))))) 2(3(2(2(3(0(3(0(3(3(2(2(1(2(2(0(3(x1))))))))))))))))) (10)
1(0(0(1(2(2(2(3(2(3(2(0(1(x1))))))))))))) 1(2(1(0(2(2(1(2(1(0(3(3(2(2(2(3(3(x1))))))))))))))))) (11)
1(0(2(3(0(3(2(3(2(2(3(2(3(x1))))))))))))) 1(3(2(2(1(2(2(2(3(3(2(2(3(1(2(1(2(x1))))))))))))))))) (12)
1(3(1(0(1(1(3(2(2(1(1(2(1(x1))))))))))))) 1(2(3(2(3(2(1(2(2(2(2(2(2(0(1(2(2(x1))))))))))))))))) (13)
2(0(0(1(3(0(3(1(3(0(1(2(1(x1))))))))))))) 2(2(3(3(0(1(0(0(3(3(3(1(0(2(2(1(2(x1))))))))))))))))) (14)
2(0(0(2(3(0(3(1(0(0(2(1(3(x1))))))))))))) 2(0(2(1(2(2(2(2(3(2(3(1(3(3(1(3(1(x1))))))))))))))))) (15)
2(1(0(2(2(0(0(1(3(2(0(3(3(x1))))))))))))) 2(0(2(2(1(3(2(1(1(1(2(2(1(3(3(3(3(x1))))))))))))))))) (16)
2(1(0(3(0(3(0(3(3(0(2(1(1(x1))))))))))))) 2(2(0(1(2(1(1(0(2(2(2(3(2(3(0(2(2(x1))))))))))))))))) (17)
2(1(1(2(0(1(1(3(0(2(3(0(1(x1))))))))))))) 2(2(3(3(3(3(3(2(1(0(1(2(2(3(3(2(2(x1))))))))))))))))) (18)
2(1(1(3(3(0(3(2(3(2(1(1(3(x1))))))))))))) 2(3(2(3(2(2(3(3(2(1(2(2(3(3(0(1(3(x1))))))))))))))))) (19)
2(1(1(3(3(3(0(3(0(3(0(0(2(x1))))))))))))) 2(0(2(2(0(2(1(3(3(3(2(3(3(2(3(3(2(x1))))))))))))))))) (20)
2(2(0(0(1(0(2(3(0(3(0(1(0(x1))))))))))))) 2(2(2(1(0(2(0(1(3(1(3(0(3(3(3(3(2(x1))))))))))))))))) (21)
2(2(0(0(3(0(2(2(3(0(1(3(3(x1))))))))))))) 2(2(1(1(0(1(2(1(2(0(2(2(2(0(2(2(2(x1))))))))))))))))) (22)
2(2(0(3(0(1(0(2(3(2(3(1(2(x1))))))))))))) 2(2(0(2(2(2(1(0(0(3(1(3(1(3(3(2(2(x1))))))))))))))))) (23)
2(2(1(0(2(1(2(1(1(0(1(2(0(x1))))))))))))) 2(2(0(2(0(3(1(2(2(0(1(2(2(2(2(2(2(x1))))))))))))))))) (24)
2(3(1(1(0(2(3(1(2(3(3(1(1(x1))))))))))))) 2(2(2(1(2(1(1(2(0(2(0(0(3(0(1(3(3(x1))))))))))))))))) (25)
2(3(2(0(3(0(1(3(2(2(2(0(2(x1))))))))))))) 2(1(2(2(3(0(0(1(3(2(2(3(2(2(3(3(2(x1))))))))))))))))) (26)
2(3(2(1(1(1(3(2(3(2(3(2(1(x1))))))))))))) 2(2(2(0(3(2(2(0(2(3(2(3(0(2(2(0(2(x1))))))))))))))))) (27)
3(0(2(3(0(1(0(3(3(0(0(1(0(x1))))))))))))) 3(0(0(1(2(2(3(3(3(2(0(1(2(0(3(3(2(x1))))))))))))))))) (28)

and S is the following TRS.

1(3(2(0(2(1(2(1(2(2(1(2(0(x1))))))))))))) 3(2(1(2(1(2(2(1(2(2(0(2(2(0(2(2(2(x1))))))))))))))))) (29)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Closure Under Flat Contexts

Using the flat contexts

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

We obtain the transformed TRS
0(0(0(1(1(1(2(3(3(1(3(3(2(x1))))))))))))) 0(2(2(1(0(1(2(3(0(0(3(2(2(3(1(2(2(x1))))))))))))))))) (1)
0(0(2(0(3(1(3(2(1(0(0(2(3(x1))))))))))))) 0(2(2(2(1(3(3(3(2(2(0(3(1(3(2(1(2(x1))))))))))))))))) (3)
1(0(0(1(2(2(2(3(2(3(2(0(1(x1))))))))))))) 1(2(1(0(2(2(1(2(1(0(3(3(2(2(2(3(3(x1))))))))))))))))) (11)
1(0(2(3(0(3(2(3(2(2(3(2(3(x1))))))))))))) 1(3(2(2(1(2(2(2(3(3(2(2(3(1(2(1(2(x1))))))))))))))))) (12)
1(3(1(0(1(1(3(2(2(1(1(2(1(x1))))))))))))) 1(2(3(2(3(2(1(2(2(2(2(2(2(0(1(2(2(x1))))))))))))))))) (13)
2(0(0(1(3(0(3(1(3(0(1(2(1(x1))))))))))))) 2(2(3(3(0(1(0(0(3(3(3(1(0(2(2(1(2(x1))))))))))))))))) (14)
2(0(0(2(3(0(3(1(0(0(2(1(3(x1))))))))))))) 2(0(2(1(2(2(2(2(3(2(3(1(3(3(1(3(1(x1))))))))))))))))) (15)
2(1(0(2(2(0(0(1(3(2(0(3(3(x1))))))))))))) 2(0(2(2(1(3(2(1(1(1(2(2(1(3(3(3(3(x1))))))))))))))))) (16)
2(1(0(3(0(3(0(3(3(0(2(1(1(x1))))))))))))) 2(2(0(1(2(1(1(0(2(2(2(3(2(3(0(2(2(x1))))))))))))))))) (17)
2(1(1(2(0(1(1(3(0(2(3(0(1(x1))))))))))))) 2(2(3(3(3(3(3(2(1(0(1(2(2(3(3(2(2(x1))))))))))))))))) (18)
2(1(1(3(3(0(3(2(3(2(1(1(3(x1))))))))))))) 2(3(2(3(2(2(3(3(2(1(2(2(3(3(0(1(3(x1))))))))))))))))) (19)
2(1(1(3(3(3(0(3(0(3(0(0(2(x1))))))))))))) 2(0(2(2(0(2(1(3(3(3(2(3(3(2(3(3(2(x1))))))))))))))))) (20)
2(2(0(0(1(0(2(3(0(3(0(1(0(x1))))))))))))) 2(2(2(1(0(2(0(1(3(1(3(0(3(3(3(3(2(x1))))))))))))))))) (21)
2(2(0(0(3(0(2(2(3(0(1(3(3(x1))))))))))))) 2(2(1(1(0(1(2(1(2(0(2(2(2(0(2(2(2(x1))))))))))))))))) (22)
2(2(0(3(0(1(0(2(3(2(3(1(2(x1))))))))))))) 2(2(0(2(2(2(1(0(0(3(1(3(1(3(3(2(2(x1))))))))))))))))) (23)
2(2(1(0(2(1(2(1(1(0(1(2(0(x1))))))))))))) 2(2(0(2(0(3(1(2(2(0(1(2(2(2(2(2(2(x1))))))))))))))))) (24)
2(3(1(1(0(2(3(1(2(3(3(1(1(x1))))))))))))) 2(2(2(1(2(1(1(2(0(2(0(0(3(0(1(3(3(x1))))))))))))))))) (25)
2(3(2(0(3(0(1(3(2(2(2(0(2(x1))))))))))))) 2(1(2(2(3(0(0(1(3(2(2(3(2(2(3(3(2(x1))))))))))))))))) (26)
2(3(2(1(1(1(3(2(3(2(3(2(1(x1))))))))))))) 2(2(2(0(3(2(2(0(2(3(2(3(0(2(2(0(2(x1))))))))))))))))) (27)
3(0(2(3(0(1(0(3(3(0(0(1(0(x1))))))))))))) 3(0(0(1(2(2(3(3(3(2(0(1(2(0(3(3(2(x1))))))))))))))))) (28)
0(0(0(0(3(3(1(1(1(3(3(1(3(2(x1)))))))))))))) 0(3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1)))))))))))))))))) (30)
1(0(0(0(3(3(1(1(1(3(3(1(3(2(x1)))))))))))))) 1(3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1)))))))))))))))))) (31)
2(0(0(0(3(3(1(1(1(3(3(1(3(2(x1)))))))))))))) 2(3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1)))))))))))))))))) (32)
3(0(0(0(3(3(1(1(1(3(3(1(3(2(x1)))))))))))))) 3(3(0(2(1(0(3(3(3(1(2(2(2(1(2(1(2(2(x1)))))))))))))))))) (33)
0(0(1(0(0(3(3(2(1(2(0(1(2(3(x1)))))))))))))) 0(3(2(2(1(2(2(0(3(0(2(2(2(1(2(2(3(1(x1)))))))))))))))))) (34)
1(0(1(0(0(3(3(2(1(2(0(1(2(3(x1)))))))))))))) 1(3(2(2(1(2(2(0(3(0(2(2(2(1(2(2(3(1(x1)))))))))))))))))) (35)
2(0(1(0(0(3(3(2(1(2(0(1(2(3(x1)))))))))))))) 2(3(2(2(1(2(2(0(3(0(2(2(2(1(2(2(3(1(x1)))))))))))))))))) (36)
3(0(1(0(0(3(3(2(1(2(0(1(2(3(x1)))))))))))))) 3(3(2(2(1(2(2(0(3(0(2(2(2(1(2(2(3(1(x1)))))))))))))))))) (37)
0(0(1(2(0(1(1(0(2(2(1(2(0(2(x1)))))))))))))) 0(2(0(3(3(2(2(1(0(3(3(3(3(2(2(2(3(3(x1)))))))))))))))))) (38)
1(0(1(2(0(1(1(0(2(2(1(2(0(2(x1)))))))))))))) 1(2(0(3(3(2(2(1(0(3(3(3(3(2(2(2(3(3(x1)))))))))))))))))) (39)
2(0(1(2(0(1(1(0(2(2(1(2(0(2(x1)))))))))))))) 2(2(0(3(3(2(2(1(0(3(3(3(3(2(2(2(3(3(x1)))))))))))))))))) (40)
3(0(1(2(0(1(1(0(2(2(1(2(0(2(x1)))))))))))))) 3(2(0(3(3(2(2(1(0(3(3(3(3(2(2(2(3(3(x1)))))))))))))))))) (41)
0(0(1(2(1(1(1(2(2(0(1(3(2(0(x1)))))))))))))) 0(2(3(2(0(1(2(3(0(3(3(2(1(3(3(1(3(3(x1)))))))))))))))))) (42)
1(0(1(2(1(1(1(2(2(0(1(3(2(0(x1)))))))))))))) 1(2(3(2(0(1(2(3(0(3(3(2(1(3(3(1(3(3(x1)))))))))))))))))) (43)
2(0(1(2(1(1(1(2(2(0(1(3(2(0(x1)))))))))))))) 2(2(3(2(0(1(2(3(0(3(3(2(1(3(3(1(3(3(x1)))))))))))))))))) (44)
3(0(1(2(1(1(1(2(2(0(1(3(2(0(x1)))))))))))))) 3(2(3(2(0(1(2(3(0(3(3(2(1(3(3(1(3(3(x1)))))))))))))))))) (45)
0(0(2(2(0(0(3(1(0(3(2(1(3(0(x1)))))))))))))) 0(3(1(2(2(1(3(3(2(2(3(0(2(2(1(1(1(0(x1)))))))))))))))))) (46)
1(0(2(2(0(0(3(1(0(3(2(1(3(0(x1)))))))))))))) 1(3(1(2(2(1(3(3(2(2(3(0(2(2(1(1(1(0(x1)))))))))))))))))) (47)
2(0(2(2(0(0(3(1(0(3(2(1(3(0(x1)))))))))))))) 2(3(1(2(2(1(3(3(2(2(3(0(2(2(1(1(1(0(x1)))))))))))))))))) (48)
3(0(2(2(0(0(3(1(0(3(2(1(3(0(x1)))))))))))))) 3(3(1(2(2(1(3(3(2(2(3(0(2(2(1(1(1(0(x1)))))))))))))))))) (49)
0(0(2(3(3(1(0(3(3(0(2(3(1(1(x1)))))))))))))) 0(2(1(3(2(2(2(0(2(2(2(3(3(2(2(2(0(3(x1)))))))))))))))))) (50)
1(0(2(3(3(1(0(3(3(0(2(3(1(1(x1)))))))))))))) 1(2(1(3(2(2(2(0(2(2(2(3(3(2(2(2(0(3(x1)))))))))))))))))) (51)
2(0(2(3(3(1(0(3(3(0(2(3(1(1(x1)))))))))))))) 2(2(1(3(2(2(2(0(2(2(2(3(3(2(2(2(0(3(x1)))))))))))))))))) (52)
3(0(2(3(3(1(0(3(3(0(2(3(1(1(x1)))))))))))))) 3(2(1(3(2(2(2(0(2(2(2(3(3(2(2(2(0(3(x1)))))))))))))))))) (53)
0(0(3(0(3(0(2(3(0(0(3(1(2(1(x1)))))))))))))) 0(3(1(1(2(2(3(0(1(2(2(2(2(3(2(2(2(0(x1)))))))))))))))))) (54)
1(0(3(0(3(0(2(3(0(0(3(1(2(1(x1)))))))))))))) 1(3(1(1(2(2(3(0(1(2(2(2(2(3(2(2(2(0(x1)))))))))))))))))) (55)
2(0(3(0(3(0(2(3(0(0(3(1(2(1(x1)))))))))))))) 2(3(1(1(2(2(3(0(1(2(2(2(2(3(2(2(2(0(x1)))))))))))))))))) (56)
3(0(3(0(3(0(2(3(0(0(3(1(2(1(x1)))))))))))))) 3(3(1(1(2(2(3(0(1(2(2(2(2(3(2(2(2(0(x1)))))))))))))))))) (57)
0(0(3(0(3(1(0(1(2(2(0(3(1(3(x1)))))))))))))) 0(2(3(2(2(3(0(3(0(3(3(2(2(1(2(2(0(3(x1)))))))))))))))))) (58)
1(0(3(0(3(1(0(1(2(2(0(3(1(3(x1)))))))))))))) 1(2(3(2(2(3(0(3(0(3(3(2(2(1(2(2(0(3(x1)))))))))))))))))) (59)
2(0(3(0(3(1(0(1(2(2(0(3(1(3(x1)))))))))))))) 2(2(3(2(2(3(0(3(0(3(3(2(2(1(2(2(0(3(x1)))))))))))))))))) (60)
3(0(3(0(3(1(0(1(2(2(0(3(1(3(x1)))))))))))))) 3(2(3(2(2(3(0(3(0(3(3(2(2(1(2(2(0(3(x1)))))))))))))))))) (61)
0(1(3(2(0(2(1(2(1(2(2(1(2(0(x1)))))))))))))) 0(3(2(1(2(1(2(2(1(2(2(0(2(2(0(2(2(2(x1)))))))))))))))))) (62)
1(1(3(2(0(2(1(2(1(2(2(1(2(0(x1)))))))))))))) 1(3(2(1(2(1(2(2(1(2(2(0(2(2(0(2(2(2(x1)))))))))))))))))) (63)
2(1(3(2(0(2(1(2(1(2(2(1(2(0(x1)))))))))))))) 2(3(2(1(2(1(2(2(1(2(2(0(2(2(0(2(2(2(x1)))))))))))))))))) (64)
3(1(3(2(0(2(1(2(1(2(2(1(2(0(x1)))))))))))))) 3(3(2(1(2(1(2(2(1(2(2(0(2(2(0(2(2(2(x1)))))))))))))))))) (65)

1.1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS

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

1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[00(x1)] = 1 + 1 · x1
[01(x1)] = 1 + 1 · x1
[11(x1)] = 1 + 1 · x1
[12(x1)] = 1 · x1
[23(x1)] = 1 · x1
[33(x1)] = 1 · x1
[31(x1)] = 1 + 1 · x1
[13(x1)] = 1 · x1
[32(x1)] = 1 · x1
[20(x1)] = 1 · x1
[02(x1)] = 1 · x1
[22(x1)] = 1 · x1
[21(x1)] = 1 · x1
[10(x1)] = 1 + 1 · x1
[30(x1)] = 1 + 1 · x1
[03(x1)] = 1 + 1 · x1
all of the following rules can be deleted.

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

1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[00(x1)] = 1 · x1
[01(x1)] = 1 + 1 · x1
[11(x1)] = 1 + 1 · x1
[12(x1)] = 1 · x1
[23(x1)] = 1 + 1 · x1
[33(x1)] = 1 · x1
[31(x1)] = 1 · x1
[13(x1)] = 1 + 1 · x1
[32(x1)] = 1 · x1
[20(x1)] = 1 + 1 · x1
[02(x1)] = 1 + 1 · x1
[22(x1)] = 1 · x1
[21(x1)] = 1 + 1 · x1
[10(x1)] = 1 · x1
[30(x1)] = 1 · x1
[03(x1)] = 1 · x1
all of the following rules can be deleted.
20(00(01(13(30(03(31(13(30(01(12(21(12(x1))))))))))))) 22(23(33(30(01(10(00(03(33(33(31(10(02(22(21(12(22(x1))))))))))))))))) (88)
20(00(01(13(30(03(31(13(30(01(12(21(13(x1))))))))))))) 22(23(33(30(01(10(00(03(33(33(31(10(02(22(21(12(23(x1))))))))))))))))) (89)
20(01(12(20(01(11(10(02(22(21(12(20(02(20(x1)))))))))))))) 22(20(03(33(32(22(21(10(03(33(33(33(32(22(22(23(33(30(x1)))))))))))))))))) (186)
20(01(12(20(01(11(10(02(22(21(12(20(02(21(x1)))))))))))))) 22(20(03(33(32(22(21(10(03(33(33(33(32(22(22(23(33(31(x1)))))))))))))))))) (187)
20(01(12(21(11(11(12(22(20(01(13(32(20(00(x1)))))))))))))) 22(23(32(20(01(12(23(30(03(33(32(21(13(33(31(13(33(30(x1)))))))))))))))))) (202)
20(01(12(21(11(11(12(22(20(01(13(32(20(01(x1)))))))))))))) 22(23(32(20(01(12(23(30(03(33(32(21(13(33(31(13(33(31(x1)))))))))))))))))) (203)
20(01(12(21(11(11(12(22(20(01(13(32(20(02(x1)))))))))))))) 22(23(32(20(01(12(23(30(03(33(32(21(13(33(31(13(33(32(x1)))))))))))))))))) (204)
01(13(32(20(02(21(12(21(12(22(21(12(20(02(x1)))))))))))))) 03(32(21(12(21(12(22(21(12(22(20(02(22(20(02(22(22(22(x1)))))))))))))))))) (276)
21(13(32(20(02(21(12(21(12(22(21(12(20(02(x1)))))))))))))) 23(32(21(12(21(12(22(21(12(22(20(02(22(20(02(22(22(22(x1)))))))))))))))))) (284)

1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[00(x1)] = 1 · x1
[01(x1)] = 1 · x1
[11(x1)] = 1 · x1
[12(x1)] = 1 · x1
[23(x1)] = 1 · x1
[33(x1)] = 1 · x1
[31(x1)] = 1 · x1
[13(x1)] = 1 · x1
[32(x1)] = 1 · x1 + 2
[20(x1)] = 1 · x1 + 1
[02(x1)] = 1 · x1
[22(x1)] = 1 · x1
[21(x1)] = 1 · x1
[10(x1)] = 1 · x1
[30(x1)] = 1 · x1
[03(x1)] = 1 · x1
all of the following rules can be deleted.
23(32(21(11(11(13(32(23(32(23(32(21(12(x1))))))))))))) 22(22(20(03(32(22(20(02(23(32(23(30(02(22(20(02(22(x1))))))))))))))))) (140)
23(32(21(11(11(13(32(23(32(23(32(21(13(x1))))))))))))) 22(22(20(03(32(22(20(02(23(32(23(30(02(22(20(02(23(x1))))))))))))))))) (141)

1.1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[00(x1)] = 1 · x1
[01(x1)] = 1 · x1 + 2
[11(x1)] = 1 · x1
[12(x1)] = 1 · x1
[23(x1)] = 1 · x1
[33(x1)] = 1 · x1
[31(x1)] = 1 · x1
[13(x1)] = 1 · x1 + 1
[32(x1)] = 1 · x1
[20(x1)] = 1 · x1
[02(x1)] = 1 · x1
[22(x1)] = 1 · x1
[21(x1)] = 1 · x1
[10(x1)] = 1 · x1
[30(x1)] = 1 · x1
[03(x1)] = 1 · x1
all of the following rules can be deleted.
00(00(01(11(11(12(23(33(31(13(33(32(20(x1))))))))))))) 02(22(21(10(01(12(23(30(00(03(32(22(23(31(12(22(20(x1))))))))))))))))) (66)
00(00(01(11(11(12(23(33(31(13(33(32(21(x1))))))))))))) 02(22(21(10(01(12(23(30(00(03(32(22(23(31(12(22(21(x1))))))))))))))))) (67)
00(00(01(11(11(12(23(33(31(13(33(32(22(x1))))))))))))) 02(22(21(10(01(12(23(30(00(03(32(22(23(31(12(22(22(x1))))))))))))))))) (68)
00(00(01(11(11(12(23(33(31(13(33(32(23(x1))))))))))))) 02(22(21(10(01(12(23(30(00(03(32(22(23(31(12(22(23(x1))))))))))))))))) (69)

1.1.1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[22(x1)] = 1 · x1
[20(x1)] = 1 · x1
[03(x1)] = 1 · x1
[30(x1)] = 1 · x1
[01(x1)] = 1 · x1 + 1
[10(x1)] = 1 · x1
[02(x1)] = 1 · x1
[23(x1)] = 1 · x1
[32(x1)] = 1 · x1
[31(x1)] = 1 · x1
[12(x1)] = 1 · x1
[21(x1)] = 1 · x1
[00(x1)] = 1 · x1
[13(x1)] = 1 · x1
[33(x1)] = 1 · x1
all of the following rules can be deleted.
22(20(03(30(01(10(02(23(32(23(31(12(20(x1))))))))))))) 22(20(02(22(22(21(10(00(03(31(13(31(13(33(32(22(20(x1))))))))))))))))) (122)
22(20(03(30(01(10(02(23(32(23(31(12(21(x1))))))))))))) 22(20(02(22(22(21(10(00(03(31(13(31(13(33(32(22(21(x1))))))))))))))))) (123)
22(20(03(30(01(10(02(23(32(23(31(12(22(x1))))))))))))) 22(20(02(22(22(21(10(00(03(31(13(31(13(33(32(22(22(x1))))))))))))))))) (124)
22(20(03(30(01(10(02(23(32(23(31(12(23(x1))))))))))))) 22(20(02(22(22(21(10(00(03(31(13(31(13(33(32(22(23(x1))))))))))))))))) (125)

1.1.1.1.1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[23(x1)] = 1 · x1
[32(x1)] = 1 · x1
[20(x1)] = 1 · x1
[03(x1)] = 1 · x1 + 1
[30(x1)] = 1 · x1
[01(x1)] = 1 · x1
[13(x1)] = 1 · x1
[22(x1)] = 1 · x1
[02(x1)] = 1 · x1
[21(x1)] = 1 · x1
[12(x1)] = 1 · x1
[00(x1)] = 1 · x1
[33(x1)] = 1 · x1
all of the following rules can be deleted.
23(32(20(03(30(01(13(32(22(22(20(02(20(x1))))))))))))) 21(12(22(23(30(00(01(13(32(22(23(32(22(23(33(32(20(x1))))))))))))))))) (134)
23(32(20(03(30(01(13(32(22(22(20(02(21(x1))))))))))))) 21(12(22(23(30(00(01(13(32(22(23(32(22(23(33(32(21(x1))))))))))))))))) (135)
23(32(20(03(30(01(13(32(22(22(20(02(22(x1))))))))))))) 21(12(22(23(30(00(01(13(32(22(23(32(22(23(33(32(22(x1))))))))))))))))) (136)
23(32(20(03(30(01(13(32(22(22(20(02(23(x1))))))))))))) 21(12(22(23(30(00(01(13(32(22(23(32(22(23(33(32(23(x1))))))))))))))))) (137)

1.1.1.1.1.1.1.1.1 R is empty

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