Certification Problem

Input (TPDB SRS_Relative/ICFP_2010_relative/128430)

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

0(0(0(0(3(0(0(2(1(0(3(1(3(2(0(3(3(2(x1)))))))))))))))))) → 0(0(3(2(0(1(0(3(3(1(0(3(2(0(0(3(0(2(x1)))))))))))))))))) (1)
0(0(0(2(0(2(0(2(1(0(0(0(2(1(1(3(1(1(x1)))))))))))))))))) → 2(0(2(0(2(2(3(0(0(1(1(0(0(0(1(0(1(1(x1)))))))))))))))))) (2)
0(0(1(3(1(0(0(1(2(0(1(1(2(0(1(3(1(3(x1)))))))))))))))))) → 0(3(0(2(1(0(1(1(0(1(0(1(3(0(2(1(1(3(x1)))))))))))))))))) (3)
0(0(2(0(2(2(2(2(0(3(1(2(1(3(3(0(0(0(x1)))))))))))))))))) → 2(2(3(2(2(0(3(0(2(0(1(2(3(0(1(0(0(0(x1)))))))))))))))))) (4)
0(0(2(1(2(0(3(1(2(3(2(0(0(0(3(3(3(1(x1)))))))))))))))))) → 0(2(1(3(3(2(2(1(3(0(2(0(0(1(0(3(0(3(x1)))))))))))))))))) (5)
0(0(3(2(2(0(3(2(3(2(1(3(3(1(2(2(2(2(x1)))))))))))))))))) → 2(3(2(3(2(2(2(3(0(1(0(2(3(0(1(3(2(2(x1)))))))))))))))))) (6)
0(1(0(0(2(2(3(3(1(0(0(2(2(1(1(3(3(1(x1)))))))))))))))))) → 0(1(2(3(2(3(0(1(0(1(0(2(1(2(1(3(0(3(x1)))))))))))))))))) (7)
0(1(2(0(3(0(2(0(0(3(3(1(0(0(0(0(1(0(x1)))))))))))))))))) → 0(3(0(0(1(0(1(0(0(3(0(1(2(0(2(3(0(0(x1)))))))))))))))))) (8)
0(1(2(2(3(3(1(0(0(0(0(0(0(3(1(0(1(0(x1)))))))))))))))))) → 0(1(0(1(2(3(0(0(3(3(1(0(0(2(0(1(0(0(x1)))))))))))))))))) (9)
0(2(0(3(3(3(0(0(2(0(2(3(3(1(0(3(3(2(x1)))))))))))))))))) → 0(2(3(1(3(0(0(0(2(3(3(2(3(0(3(0(3(2(x1)))))))))))))))))) (10)
0(2(1(1(2(1(1(2(0(0(0(3(3(1(2(1(0(0(x1)))))))))))))))))) → 0(0(3(0(1(1(1(0(2(3(2(0(2(1(0(1(2(1(x1)))))))))))))))))) (11)
0(2(1(3(3(1(0(0(1(0(3(1(2(1(3(3(1(1(x1)))))))))))))))))) → 0(0(2(3(3(1(3(3(2(1(0(1(1(1(1(1(0(3(x1)))))))))))))))))) (12)
0(2(2(0(3(2(0(3(3(0(2(3(1(3(3(3(1(2(x1)))))))))))))))))) → 0(3(2(2(2(3(1(3(3(3(0(2(0(1(3(2(3(0(x1)))))))))))))))))) (13)
0(2(2(3(0(0(3(1(2(0(0(3(3(1(2(1(0(0(x1)))))))))))))))))) → 0(0(1(0(1(0(3(3(0(0(1(0(2(3(2(2(3(2(x1)))))))))))))))))) (14)
0(2(3(1(0(0(3(2(0(0(2(1(1(3(0(1(3(3(x1)))))))))))))))))) → 0(2(3(1(3(0(1(3(0(2(1(0(3(2(1(0(0(3(x1)))))))))))))))))) (15)
0(3(1(0(1(3(3(3(2(3(3(0(2(2(0(3(2(0(x1)))))))))))))))))) → 0(1(0(2(2(3(3(1(3(0(3(2(2(3(0(3(3(0(x1)))))))))))))))))) (16)
0(3(1(2(1(3(3(2(0(3(1(2(2(1(3(0(3(1(x1)))))))))))))))))) → 0(1(2(2(3(1(3(0(1(3(0(2(1(3(3(2(3(1(x1)))))))))))))))))) (17)
0(3(3(2(0(1(1(1(2(1(2(0(0(2(3(1(1(2(x1)))))))))))))))))) → 0(2(1(3(2(1(2(3(0(2(0(3(0(1(1(1(1(2(x1)))))))))))))))))) (18)
1(1(0(0(1(0(1(1(2(3(1(3(1(2(1(3(3(1(x1)))))))))))))))))) → 1(1(1(1(0(1(1(2(3(1(1(3(2(0(3(0(3(1(x1)))))))))))))))))) (19)
1(1(1(0(2(1(2(1(1(2(1(2(1(0(3(3(0(0(x1)))))))))))))))))) → 1(1(2(2(3(0(1(1(3(1(1(0(2(1(0(2(1(0(x1)))))))))))))))))) (20)
1(1(2(2(2(0(3(3(3(2(1(3(2(3(0(0(3(2(x1)))))))))))))))))) → 1(1(3(2(2(1(0(3(3(3(0(2(3(0(2(2(3(2(x1)))))))))))))))))) (21)
1(2(0(0(2(3(2(3(2(2(0(2(0(2(1(2(0(2(x1)))))))))))))))))) → 2(2(2(3(0(1(0(0(1(2(2(2(2(2(3(0(0(2(x1)))))))))))))))))) (22)
1(2(0(0(3(2(0(1(3(2(1(3(1(0(3(0(2(3(x1)))))))))))))))))) → 1(2(2(1(3(0(0(1(0(1(3(3(2(3(0(0(2(3(x1)))))))))))))))))) (23)
1(2(1(0(2(2(1(1(3(1(0(0(3(3(1(0(0(3(x1)))))))))))))))))) → 1(0(0(1(1(3(2(1(1(0(3(2(3(0(1(2(0(3(x1)))))))))))))))))) (24)
1(2(1(1(1(3(3(1(1(1(3(1(1(3(0(2(0(1(x1)))))))))))))))))) → 1(3(1(1(1(1(0(2(2(1(1(1(3(1(3(3(0(1(x1)))))))))))))))))) (25)
1(3(0(2(1(1(2(0(0(3(3(1(1(0(3(1(2(1(x1)))))))))))))))))) → 1(3(0(3(1(2(3(1(1(2(1(0(1(0(0(2(1(3(x1)))))))))))))))))) (26)
1(3(1(0(3(1(3(2(0(3(1(3(0(3(2(1(1(2(x1)))))))))))))))))) → 1(0(3(3(1(3(2(3(1(3(2(3(1(0(1(0(1(2(x1)))))))))))))))))) (27)
1(3(1(1(3(2(2(3(1(3(2(0(3(2(3(0(3(2(x1)))))))))))))))))) → 1(3(2(3(3(3(0(2(1(2(3(2(1(0(1(3(3(2(x1)))))))))))))))))) (28)
1(3(2(2(0(0(3(3(1(1(0(1(1(3(3(0(3(1(x1)))))))))))))))))) → 1(0(1(1(3(3(0(1(0(1(3(0(3(2(3(2(3(1(x1)))))))))))))))))) (29)
1(3(3(3(1(2(0(2(0(2(1(2(1(3(3(3(1(0(x1)))))))))))))))))) → 1(2(1(1(2(1(3(0(2(1(3(2(3(3(0(3(3(0(x1)))))))))))))))))) (30)
2(0(0(0(1(1(2(2(1(1(2(1(3(0(3(3(3(0(x1)))))))))))))))))) → 2(2(2(1(2(3(3(0(3(0(1(1(0(1(3(0(1(0(x1)))))))))))))))))) (31)
2(0(1(3(1(3(0(3(3(1(2(1(3(0(0(1(0(1(x1)))))))))))))))))) → 2(1(0(1(3(3(0(1(0(3(3(0(1(1(0(3(2(1(x1)))))))))))))))))) (32)
2(0(2(0(1(3(1(3(1(3(3(1(0(0(0(2(2(0(x1)))))))))))))))))) → 3(0(2(0(3(2(1(1(0(2(1(2(1(0(3(0(3(0(x1)))))))))))))))))) (33)
2(0(3(2(2(2(2(1(3(3(1(1(2(1(0(0(3(1(x1)))))))))))))))))) → 2(2(2(0(3(2(2(3(2(1(0(1(1(1(1(3(3(0(x1)))))))))))))))))) (34)
2(1(0(0(1(0(1(0(2(0(1(0(0(1(1(3(3(1(x1)))))))))))))))))) → 2(1(0(3(0(1(0(2(1(0(0(0(1(0(1(3(1(1(x1)))))))))))))))))) (35)
2(1(1(0(0(3(1(3(3(2(3(0(3(2(0(3(1(3(x1)))))))))))))))))) → 3(3(0(1(2(1(0(2(2(3(0(3(0(1(1(3(3(3(x1)))))))))))))))))) (36)
2(1(1(1(3(1(1(3(2(2(3(1(0(0(0(2(1(3(x1)))))))))))))))))) → 0(1(2(1(0(2(3(1(1(1(1(2(3(2(0(1(3(3(x1)))))))))))))))))) (37)
2(1(2(0(2(2(2(2(2(0(3(3(1(0(0(2(0(2(x1)))))))))))))))))) → 2(0(1(0(2(1(2(2(2(0(3(0(3(0(2(2(2(2(x1)))))))))))))))))) (38)
2(1(2(1(2(2(2(3(1(2(2(3(3(3(3(2(1(1(x1)))))))))))))))))) → 2(1(3(2(2(2(1(3(2(3(3(2(2(3(2(1(1(1(x1)))))))))))))))))) (39)
2(2(1(2(1(1(3(1(0(3(3(3(3(3(2(1(2(2(x1)))))))))))))))))) → 2(2(1(3(2(3(1(1(3(2(1(3(1(0(3(3(2(2(x1)))))))))))))))))) (40)
2(2(1(3(3(3(1(0(0(3(1(2(3(2(2(0(2(0(x1)))))))))))))))))) → 2(3(0(1(2(2(2(3(0(1(0(1(2(2(3(0(3(3(x1)))))))))))))))))) (41)
2(3(0(0(0(2(1(2(0(2(3(2(1(1(0(3(3(0(x1)))))))))))))))))) → 2(3(1(1(3(0(2(2(2(3(0(3(0(1(2(0(0(0(x1)))))))))))))))))) (42)
2(3(0(0(1(2(3(3(0(3(0(3(1(0(0(0(3(0(x1)))))))))))))))))) → 2(3(0(0(3(0(2(1(0(3(3(0(1(3(0(3(0(0(x1)))))))))))))))))) (43)
2(3(1(2(3(2(3(0(2(0(0(0(0(1(1(0(3(2(x1)))))))))))))))))) → 0(0(2(1(2(3(0(3(0(1(0(1(2(2(3(0(3(2(x1)))))))))))))))))) (44)
2(3(1(3(1(3(0(1(2(1(2(1(1(3(1(3(1(2(x1)))))))))))))))))) → 2(1(2(3(3(1(1(1(3(3(3(2(0(1(1(1(1(2(x1)))))))))))))))))) (45)
2(3(2(0(0(3(1(2(1(0(3(0(2(2(3(1(1(0(x1)))))))))))))))))) → 2(3(1(1(0(3(2(0(1(3(0(2(2(3(0(2(1(0(x1)))))))))))))))))) (46)
2(3(3(0(0(1(2(0(2(1(3(1(2(1(3(1(2(3(x1)))))))))))))))))) → 2(3(3(0(1(2(2(3(1(1(0(0(2(3(1(3(2(1(x1)))))))))))))))))) (47)
2(3(3(3(0(2(1(3(3(1(3(0(2(0(3(1(2(2(x1)))))))))))))))))) → 2(3(3(0(2(2(3(3(1(1(0(0(3(3(2(1(3(2(x1)))))))))))))))))) (48)
3(0(0(3(1(3(1(1(1(3(3(0(3(2(1(2(2(0(x1)))))))))))))))))) → 3(1(2(3(1(1(2(3(1(3(0(2(3(0(1(0(3(0(x1)))))))))))))))))) (49)
3(0(0(3(3(1(2(0(2(1(1(2(0(0(0(0(0(1(x1)))))))))))))))))) → 3(0(0(1(3(2(2(0(0(3(0(1(0(0(2(1(0(1(x1)))))))))))))))))) (50)
3(0(1(0(0(2(2(3(2(2(0(1(1(1(2(1(0(3(x1)))))))))))))))))) → 3(0(1(0(2(1(2(2(1(0(2(1(0(3(0(1(2(3(x1)))))))))))))))))) (51)
3(0(2(0(0(0(3(2(3(2(2(2(3(3(1(2(0(2(x1)))))))))))))))))) → 3(0(2(0(2(1(3(3(2(3(0(0(2(2(3(0(2(2(x1)))))))))))))))))) (52)
3(0(2(1(1(1(2(1(2(3(1(0(2(1(1(2(1(0(x1)))))))))))))))))) → 3(1(1(3(2(1(0(1(2(1(2(0(1(1(2(2(1(0(x1)))))))))))))))))) (53)
3(1(0(0(0(2(0(3(3(3(3(0(3(1(1(2(0(2(x1)))))))))))))))))) → 3(0(3(0(2(3(3(2(3(0(1(2(1(0(1(3(0(0(x1)))))))))))))))))) (54)
3(1(0(0(1(1(3(3(1(0(3(3(1(2(2(1(2(1(x1)))))))))))))))))) → 3(0(2(1(1(2(1(3(0(3(1(1(0(1(1(3(2(3(x1)))))))))))))))))) (55)
3(1(0(1(3(1(2(0(0(0(1(2(0(0(0(0(0(0(x1)))))))))))))))))) → 2(3(0(0(0(1(0(0(1(3(2(1(0(0(1(0(0(0(x1)))))))))))))))))) (56)
3(1(1(3(2(0(3(0(0(0(1(0(0(0(3(0(3(1(x1)))))))))))))))))) → 3(3(0(1(0(0(2(3(0(3(0(3(0(0(1(1(0(1(x1)))))))))))))))))) (57)
3(1(2(0(2(3(1(2(2(2(2(2(2(0(3(1(2(3(x1)))))))))))))))))) → 2(3(0(0(1(1(2(2(2(2(3(2(2(2(3(3(2(1(x1)))))))))))))))))) (58)
3(1(2(2(2(0(2(1(0(0(3(1(3(3(3(3(2(0(x1)))))))))))))))))) → 3(0(3(2(0(0(3(1(1(2(2(1(3(3(2(3(2(0(x1)))))))))))))))))) (59)
3(1(2(3(1(0(3(1(0(2(1(2(0(1(2(3(0(3(x1)))))))))))))))))) → 3(3(2(3(3(0(2(1(0(1(1(2(1(2(1(0(0(3(x1)))))))))))))))))) (60)
3(1(2(3(3(1(3(3(1(0(3(1(2(3(0(0(0(3(x1)))))))))))))))))) → 3(1(1(3(0(1(2(3(0(3(2(3(0(3(0(1(3(3(x1)))))))))))))))))) (61)
3(1(3(1(3(1(2(1(2(3(3(1(3(3(3(2(3(2(x1)))))))))))))))))) → 3(1(3(2(1(3(3(3(1(1(3(3(3(2(3(2(1(2(x1)))))))))))))))))) (62)
3(1(3(2(0(0(0(3(2(0(3(0(0(0(1(1(2(2(x1)))))))))))))))))) → 3(0(3(0(2(2(1(1(0(0(2(3(0(0(3(0(1(2(x1)))))))))))))))))) (63)
3(2(0(0(3(3(3(3(1(3(1(1(1(2(3(2(0(3(x1)))))))))))))))))) → 3(2(3(1(3(0(3(1(3(2(3(0(0(1(3(3(2(1(x1)))))))))))))))))) (64)
3(2(0(1(0(2(0(0(3(1(0(3(3(3(3(1(0(1(x1)))))))))))))))))) → 3(2(3(1(0(3(2(3(3(0(0(0(1(0(1(3(0(1(x1)))))))))))))))))) (65)
3(2(0(1(2(0(2(2(1(1(3(3(0(0(3(1(3(3(x1)))))))))))))))))) → 3(3(2(3(0(1(2(0(3(2(1(3(0(1(2(3(0(1(x1)))))))))))))))))) (66)
3(2(0(1(3(2(0(0(2(2(0(3(3(0(0(3(0(3(x1)))))))))))))))))) → 3(0(0(2(0(2(3(0(2(3(3(0(1(3(0(0(2(3(x1)))))))))))))))))) (67)
3(2(0(3(1(2(1(2(2(0(2(2(0(2(1(3(3(3(x1)))))))))))))))))) → 3(2(2(3(3(2(3(0(1(2(2(1(0(2(2(1(3(0(x1)))))))))))))))))) (68)
3(2(2(0(2(0(0(3(3(0(0(3(3(3(1(2(3(1(x1)))))))))))))))))) → 3(3(3(2(2(3(0(2(3(0(0(1(3(0(0(2(3(1(x1)))))))))))))))))) (69)
3(2(2(0(3(3(2(1(0(3(2(1(2(0(2(1(1(3(x1)))))))))))))))))) → 3(2(3(2(2(1(3(2(0(3(0(1(1(0(1(2(2(3(x1)))))))))))))))))) (70)
3(3(0(0(3(2(2(1(2(2(3(1(0(3(2(0(1(0(x1)))))))))))))))))) → 3(0(2(2(3(0(2(3(0(3(1(1(3(0(1(2(2(0(x1)))))))))))))))))) (71)
3(3(1(0(3(1(3(3(1(0(2(0(0(0(1(1(2(1(x1)))))))))))))))))) → 0(1(1(3(2(3(0(1(3(3(0(1(1(2(1(0(0(3(x1)))))))))))))))))) (72)
3(3(1(0(3(3(1(0(3(1(2(3(0(0(2(3(3(0(x1)))))))))))))))))) → 3(1(3(0(1(3(2(3(3(3(0(3(1(0(0(2(3(0(x1)))))))))))))))))) (73)
3(3(1(1(1(0(1(2(0(2(3(3(1(2(3(1(3(1(x1)))))))))))))))))) → 3(3(1(2(1(1(3(0(1(3(0(1(3(2(2(3(1(1(x1)))))))))))))))))) (74)
3(3(1(2(0(0(0(2(3(2(3(0(0(3(1(3(0(0(x1)))))))))))))))))) → 3(0(3(0(0(2(2(1(1(3(0(3(2(0(3(0(3(0(x1)))))))))))))))))) (75)
3(3(2(0(1(1(1(3(3(2(2(0(0(2(0(0(0(3(x1)))))))))))))))))) → 3(0(3(1(0(0(3(0(1(0(1(0(2(2(2(3(2(3(x1)))))))))))))))))) (76)
3(3(2(3(3(3(1(0(2(2(0(2(3(3(2(0(2(3(x1)))))))))))))))))) → 3(3(2(0(1(2(3(0(2(3(2(3(2(2(3(3(0(3(x1)))))))))))))))))) (77)
3(3(3(1(3(1(2(3(1(3(1(0(3(0(2(1(3(3(x1)))))))))))))))))) → 3(3(2(1(0(3(3(3(2(0(3(3(3(1(1(1(1(3(x1)))))))))))))))))) (78)
3(3(3(2(3(3(2(1(0(0(3(3(0(0(3(1(3(1(x1)))))))))))))))))) → 3(3(3(2(3(2(1(3(0(1(0(0(3(3(0(3(3(1(x1)))))))))))))))))) (79)
3(3(3(3(2(3(2(2(0(3(1(1(3(2(1(2(1(3(x1)))))))))))))))))) → 3(3(3(0(3(1(1(2(1(2(2(2(3(1(3(2(3(3(x1)))))))))))))))))) (80)

and S is the following TRS.

0(1(2(3(x1)))) → 0(1(2(3(x1)))) (81)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Closure Under Flat Contexts

Using the flat contexts

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

We obtain the transformed TRS

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

1.1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS

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

1.1.1 Rule Removal

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

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

1.1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[12(x1)] = 1 · x1
[21(x1)] = 1 · x1
[11(x1)] = 1 · x1 + 1
[13(x1)] = 1 · x1 + 1
[33(x1)] = 1 · x1 + 3
[31(x1)] = 1 · x1 + 1
[30(x1)] = 1 · x1
[02(x1)] = 1 · x1 + 1
[20(x1)] = 1 · x1
[01(x1)] = 1 · x1 + 1
[10(x1)] = 1 · x1
[22(x1)] = 1 · x1
[00(x1)] = 1 · x1
[03(x1)] = 1 · x1 + 4
[23(x1)] = 1 · x1
[32(x1)] = 1 · x1
all of the following rules can be deleted.
13(30(02(21(11(12(20(00(03(33(31(11(10(03(31(12(21(11(x1)))))))))))))))))) → 13(30(03(31(12(23(31(11(12(21(10(01(10(00(02(21(13(31(x1)))))))))))))))))) (213)
13(31(11(13(32(22(23(31(13(32(20(03(32(23(30(03(32(20(x1)))))))))))))))))) → 13(32(23(33(33(30(02(21(12(23(32(21(10(01(13(33(32(20(x1)))))))))))))))))) (218)
13(31(11(13(32(22(23(31(13(32(20(03(32(23(30(03(32(23(x1)))))))))))))))))) → 13(32(23(33(33(30(02(21(12(23(32(21(10(01(13(33(32(23(x1)))))))))))))))))) (219)
13(31(11(13(32(22(23(31(13(32(20(03(32(23(30(03(32(22(x1)))))))))))))))))) → 13(32(23(33(33(30(02(21(12(23(32(21(10(01(13(33(32(22(x1)))))))))))))))))) (220)
13(31(11(13(32(22(23(31(13(32(20(03(32(23(30(03(32(21(x1)))))))))))))))))) → 13(32(23(33(33(30(02(21(12(23(32(21(10(01(13(33(32(21(x1)))))))))))))))))) (221)
23(33(33(30(02(21(13(33(31(13(30(02(20(03(31(12(22(20(x1)))))))))))))))))) → 23(33(30(02(22(23(33(31(11(10(00(03(33(32(21(13(32(20(x1)))))))))))))))))) (282)
23(33(33(30(02(21(13(33(31(13(30(02(20(03(31(12(22(23(x1)))))))))))))))))) → 23(33(30(02(22(23(33(31(11(10(00(03(33(32(21(13(32(23(x1)))))))))))))))))) (283)
23(33(33(30(02(21(13(33(31(13(30(02(20(03(31(12(22(22(x1)))))))))))))))))) → 23(33(30(02(22(23(33(31(11(10(00(03(33(32(21(13(32(22(x1)))))))))))))))))) (284)
23(33(33(30(02(21(13(33(31(13(30(02(20(03(31(12(22(21(x1)))))))))))))))))) → 23(33(30(02(22(23(33(31(11(10(00(03(33(32(21(13(32(21(x1)))))))))))))))))) (285)
01(12(20(00(02(23(32(23(32(22(20(02(20(02(21(12(20(02(20(x1))))))))))))))))))) → 02(22(22(23(30(01(10(00(01(12(22(22(22(22(23(30(00(02(20(x1))))))))))))))))))) (450)
01(12(20(00(02(23(32(23(32(22(20(02(20(02(21(12(20(02(23(x1))))))))))))))))))) → 02(22(22(23(30(01(10(00(01(12(22(22(22(22(23(30(00(02(23(x1))))))))))))))))))) (451)
01(12(20(00(02(23(32(23(32(22(20(02(20(02(21(12(20(02(22(x1))))))))))))))))))) → 02(22(22(23(30(01(10(00(01(12(22(22(22(22(23(30(00(02(22(x1))))))))))))))))))) (452)
01(12(20(00(02(23(32(23(32(22(20(02(20(02(21(12(20(02(21(x1))))))))))))))))))) → 02(22(22(23(30(01(10(00(01(12(22(22(22(22(23(30(00(02(21(x1))))))))))))))))))) (453)
11(12(20(00(02(23(32(23(32(22(20(02(20(02(21(12(20(02(20(x1))))))))))))))))))) → 12(22(22(23(30(01(10(00(01(12(22(22(22(22(23(30(00(02(20(x1))))))))))))))))))) (462)
11(12(20(00(02(23(32(23(32(22(20(02(20(02(21(12(20(02(23(x1))))))))))))))))))) → 12(22(22(23(30(01(10(00(01(12(22(22(22(22(23(30(00(02(23(x1))))))))))))))))))) (463)
11(12(20(00(02(23(32(23(32(22(20(02(20(02(21(12(20(02(22(x1))))))))))))))))))) → 12(22(22(23(30(01(10(00(01(12(22(22(22(22(23(30(00(02(22(x1))))))))))))))))))) (464)
11(12(20(00(02(23(32(23(32(22(20(02(20(02(21(12(20(02(21(x1))))))))))))))))))) → 12(22(22(23(30(01(10(00(01(12(22(22(22(22(23(30(00(02(21(x1))))))))))))))))))) (465)

1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1.1.1.1 R is empty

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