Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/107193)

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by matchbox @ termCOMP 2023)

1 Closure Under Flat Contexts

Using the flat contexts

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

We obtain the transformed TRS

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

1.1 Closure Under Flat Contexts

Using the flat contexts

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

We obtain the transformed TRS

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

1.1.1 Semantic Labeling

The following interpretations form a model of the rules.

As carrier we take the set {0,...,8}. Symbols are labeled by the interpretation of their arguments using the interpretations (modulo 9):

[2(x1)] = 3x1 + 0
[1(x1)] = 3x1 + 1
[0(x1)] = 3x1 + 2

We obtain the labeled TRS

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

1.1.1.1 Rule Removal

Using the matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
[20(x1)] = x1 +
0
[23(x1)] = x1 +
0
[26(x1)] = x1 +
0
[21(x1)] = x1 +
49
[24(x1)] = x1 +
0
[27(x1)] = x1 +
970298/1635
[22(x1)] = x1 +
49588/327
[25(x1)] = x1 +
1
[28(x1)] = x1 +
970298/1635
[10(x1)] = x1 +
1
[13(x1)] = x1 +
976838/1635
[16(x1)] = x1 +
976838/1635
[11(x1)] = x1 +
501613/1635
[14(x1)] = x1 +
158303/327
[17(x1)] = x1 +
58223/109
[12(x1)] = x1 +
1
[15(x1)] = x1 +
970298/1635
[18(x1)] = x1 +
970298/1635
[00(x1)] = x1 +
0
[03(x1)] = x1 +
189728/327
[06(x1)] = x1 +
89180/327
[01(x1)] = x1 +
357602/1635
[04(x1)] = x1 +
971933/1635
[07(x1)] = x1 +
149793/545
[02(x1)] = x1 +
87416/545
[05(x1)] = x1 +
970298/1635
[08(x1)] = x1 +
991553/1635
all of the following rules can be deleted.

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

1.1.1.1.1 R is empty

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