Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/27009)

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by matchbox @ termCOMP 2023)

1 Rule Removal

Using the matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
[5(x1)] = x1 +
5
[4(x1)] = x1 +
5
[3(x1)] = x1 +
5
[2(x1)] = x1 +
5
[1(x1)] = x1 +
5
[0(x1)] = x1 +
6
all of the following rules can be deleted.
1(3(1(2(0(0(5(0(4(2(x1)))))))))) 5(1(1(4(2(4(1(3(4(2(x1)))))))))) (4)
2(0(0(4(5(4(1(4(3(4(x1)))))))))) 2(5(1(5(3(3(2(4(2(4(x1)))))))))) (5)
0(0(2(5(0(2(3(4(1(5(3(x1))))))))))) 3(4(5(1(5(4(0(0(0(1(x1)))))))))) (7)
0(2(0(3(5(3(0(2(0(5(0(x1))))))))))) 5(3(0(0(2(4(1(5(1(1(x1)))))))))) (8)
0(2(1(1(2(1(3(3(3(0(5(x1))))))))))) 2(2(1(0(5(3(2(2(2(3(x1)))))))))) (9)
0(3(5(2(0(5(3(4(5(0(2(x1))))))))))) 0(5(3(4(4(1(0(1(1(5(x1)))))))))) (10)
0(4(0(1(5(0(3(0(1(0(4(x1))))))))))) 5(1(3(0(0(5(1(3(5(2(x1)))))))))) (11)
0(5(2(3(2(5(1(4(1(5(1(x1))))))))))) 1(3(2(4(3(2(3(4(5(0(x1)))))))))) (12)
1(0(3(3(1(5(2(3(3(0(4(x1))))))))))) 1(0(5(2(3(2(2(3(3(4(x1)))))))))) (13)
1(1(1(0(1(2(3(2(3(2(1(x1))))))))))) 1(1(5(1(3(4(0(0(0(2(x1)))))))))) (14)
1(1(5(0(2(1(0(0(5(2(4(x1))))))))))) 0(5(3(4(1(0(2(3(5(2(x1)))))))))) (15)
1(4(3(0(5(0(5(5(0(1(5(x1))))))))))) 0(5(0(4(4(5(4(5(1(3(x1)))))))))) (16)
2(2(1(3(2(3(3(1(0(3(0(x1))))))))))) 5(0(1(1(0(0(0(5(1(4(x1)))))))))) (17)
2(2(4(5(4(4(4(2(1(0(0(x1))))))))))) 2(1(5(5(0(1(2(0(2(2(x1)))))))))) (18)
2(3(5(0(2(2(1(5(3(2(0(x1))))))))))) 4(5(5(4(5(3(1(0(0(2(x1)))))))))) (19)
2(4(1(0(1(0(2(3(4(0(5(x1))))))))))) 0(5(5(2(0(0(3(0(5(0(x1)))))))))) (20)
2(5(0(1(3(4(4(5(4(3(1(x1))))))))))) 5(4(5(0(3(2(2(5(4(2(x1)))))))))) (21)
3(0(1(3(2(3(0(4(3(4(2(x1))))))))))) 2(5(0(5(5(3(1(4(5(0(x1)))))))))) (22)
3(0(4(5(4(4(2(5(0(1(3(x1))))))))))) 5(1(1(3(5(4(5(3(2(1(x1)))))))))) (23)
3(4(1(4(2(5(2(4(1(1(4(x1))))))))))) 3(1(1(2(2(4(1(4(4(4(x1)))))))))) (24)
3(4(4(0(0(4(3(2(2(1(3(x1))))))))))) 2(1(5(0(2(0(3(5(0(2(x1)))))))))) (25)
4(0(1(3(1(1(4(2(3(4(2(x1))))))))))) 0(2(0(1(3(5(5(5(4(4(x1)))))))))) (26)
4(0(4(2(1(4(1(0(1(2(5(x1))))))))))) 2(0(3(5(1(0(1(1(5(2(x1)))))))))) (27)
4(2(3(1(4(5(3(0(0(5(1(x1))))))))))) 3(4(1(4(0(0(1(4(4(5(x1)))))))))) (28)
4(3(2(4(3(1(5(2(1(0(1(x1))))))))))) 0(3(3(1(5(1(4(3(4(3(x1)))))))))) (29)
4(5(3(2(1(4(5(2(0(5(3(x1))))))))))) 4(5(0(3(0(2(5(2(5(3(x1)))))))))) (30)
5(0(1(4(5(5(2(4(1(0(3(x1))))))))))) 5(4(0(0(1(0(4(4(5(1(x1)))))))))) (31)
5(0(3(5(4(5(5(4(1(4(3(x1))))))))))) 5(3(2(5(4(0(1(5(1(1(x1)))))))))) (32)
5(3(5(5(4(5(0(0(2(0(3(x1))))))))))) 5(5(4(3(3(5(0(0(2(1(x1)))))))))) (33)
0(3(5(5(4(1(2(2(0(5(3(2(x1)))))))))))) 2(3(2(1(2(0(2(5(0(1(x1)))))))))) (36)
0(5(0(1(5(4(2(3(1(5(1(3(x1)))))))))))) 5(5(2(1(1(4(0(3(0(0(x1)))))))))) (37)
0(5(0(5(2(2(0(4(4(4(0(1(x1)))))))))))) 4(5(5(2(4(2(5(0(4(2(x1)))))))))) (38)
0(5(1(1(5(3(5(2(0(4(5(5(x1)))))))))))) 4(0(3(3(3(4(0(5(0(5(x1)))))))))) (39)
0(5(3(4(5(4(4(0(4(2(1(3(x1)))))))))))) 1(1(2(4(5(2(4(4(2(4(x1)))))))))) (40)
0(5(4(2(4(5(2(5(2(0(1(4(x1)))))))))))) 4(2(0(1(4(5(4(3(0(1(x1)))))))))) (41)
1(1(5(5(2(1(0(4(2(5(4(2(x1)))))))))))) 3(3(4(5(2(3(3(5(2(3(x1)))))))))) (43)
1(5(4(0(4(3(4(2(2(4(3(0(x1)))))))))))) 2(2(3(5(3(0(0(2(2(1(x1)))))))))) (44)
2(2(0(5(0(5(2(3(5(2(3(1(x1)))))))))))) 0(3(2(4(5(1(0(1(0(0(x1)))))))))) (45)
2(2(3(2(4(2(2(3(1(0(4(4(x1)))))))))))) 5(2(3(5(3(3(0(2(2(3(x1)))))))))) (46)
2(2(5(2(2(3(0(4(5(5(1(2(x1)))))))))))) 4(2(0(1(0(4(4(2(0(2(x1)))))))))) (47)
2(4(2(0(5(3(5(1(3(5(1(4(x1)))))))))))) 3(5(0(1(2(5(1(5(5(1(x1)))))))))) (48)
3(0(5(0(1(5(0(5(0(5(5(3(x1)))))))))))) 1(2(0(4(1(0(4(0(3(0(x1)))))))))) (49)
4(2(3(3(2(3(0(4(5(5(1(5(x1)))))))))))) 0(0(5(0(0(2(5(3(3(0(x1)))))))))) (50)
4(3(2(1(0(2(4(5(4(3(1(4(x1)))))))))))) 0(5(5(1(3(1(2(5(5(3(x1)))))))))) (51)
4(4(2(1(4(5(5(1(3(1(3(3(x1)))))))))))) 5(0(3(1(0(4(0(0(3(2(x1)))))))))) (52)
0(5(2(4(2(4(3(3(1(4(1(0(4(x1))))))))))))) 3(5(1(2(0(3(3(0(3(0(x1)))))))))) (54)
1(5(0(5(5(1(4(3(5(0(5(2(1(x1))))))))))))) 2(2(5(4(2(5(3(2(4(0(x1)))))))))) (56)
2(5(5(4(2(4(4(0(3(1(4(2(2(x1))))))))))))) 2(4(4(5(5(0(5(5(0(1(x1)))))))))) (57)
4(1(5(3(1(2(2(1(1(5(5(1(5(x1))))))))))))) 3(0(3(1(1(2(3(3(5(3(x1)))))))))) (58)
4(3(5(5(2(1(3(0(3(1(3(3(2(x1))))))))))))) 3(3(5(1(3(2(2(0(1(1(x1)))))))))) (59)

1.1 Closure Under Flat Contexts

Using the flat contexts

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

We obtain the transformed TRS

There are 276 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,...,5}. Symbols are labeled by the interpretation of their arguments using the interpretations (modulo 6):

[5(x1)] = 6x1 + 0
[4(x1)] = 6x1 + 1
[3(x1)] = 6x1 + 2
[2(x1)] = 6x1 + 3
[1(x1)] = 6x1 + 4
[0(x1)] = 6x1 + 5

We obtain the labeled TRS

There are 1656 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
[50(x1)] = x1 +
65
[51(x1)] = x1 +
65
[52(x1)] = x1 +
17
[53(x1)] = x1 +
65
[54(x1)] = x1 +
0
[55(x1)] = x1 +
0
[40(x1)] = x1 +
65
[41(x1)] = x1 +
4
[42(x1)] = x1 +
65
[43(x1)] = x1 +
0
[44(x1)] = x1 +
17
[45(x1)] = x1 +
69
[30(x1)] = x1 +
65
[31(x1)] = x1 +
0
[32(x1)] = x1 +
66
[33(x1)] = x1 +
65
[34(x1)] = x1 +
82
[35(x1)] = x1 +
69
[20(x1)] = x1 +
65
[21(x1)] = x1 +
1
[22(x1)] = x1 +
65
[23(x1)] = x1 +
17
[24(x1)] = x1 +
1
[25(x1)] = x1 +
82
[10(x1)] = x1 +
1
[11(x1)] = x1 +
82
[12(x1)] = x1 +
4
[13(x1)] = x1 +
0
[14(x1)] = x1 +
65
[15(x1)] = x1 +
65
[00(x1)] = x1 +
0
[01(x1)] = x1 +
0
[02(x1)] = x1 +
17
[03(x1)] = x1 +
1
[04(x1)] = x1 +
65
[05(x1)] = x1 +
82
all of the following rules can be deleted.

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

1.1.1.1.1 String Reversal

Since only unary symbols occur, one can reverse all terms and obtains the TRS

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

1.1.1.1.1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

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

1.1.1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules

Using the matrix interpretations of dimension 1 with strict dimension 1 over the rationals with delta = 1
[50(x1)] = x1 +
1
[51(x1)] = x1 +
0
[52(x1)] = x1 +
0
[53(x1)] = x1 +
0
[54(x1)] = x1 +
1
[55(x1)] = x1 +
1
[40(x1)] = x1 +
0
[41(x1)] = x1 +
0
[42(x1)] = x1 +
1
[43(x1)] = x1 +
0
[44(x1)] = x1 +
1
[45(x1)] = x1 +
1
[30(x1)] = x1 +
0
[31(x1)] = x1 +
0
[32(x1)] = x1 +
0
[33(x1)] = x1 +
0
[34(x1)] = x1 +
1
[20(x1)] = x1 +
0
[21(x1)] = x1 +
0
[22(x1)] = x1 +
1
[23(x1)] = x1 +
1
[25(x1)] = x1 +
1
[10(x1)] = x1 +
1
[11(x1)] = x1 +
1
[12(x1)] = x1 +
0
[13(x1)] = x1 +
0
[14(x1)] = x1 +
1
[15(x1)] = x1 +
0
[00(x1)] = x1 +
1
[01(x1)] = x1 +
1
[02(x1)] = x1 +
1
[03(x1)] = x1 +
1
[04(x1)] = x1 +
0
[05(x1)] = x1 +
1
[10#(x1)] = x1 +
0
[11#(x1)] = x1 +
0
[12#(x1)] = x1 +
1
[13#(x1)] = x1 +
1
[14#(x1)] = x1 +
0
[15#(x1)] = x1 +
1
[00#(x1)] = x1 +
0
[01#(x1)] = x1 +
0
[02#(x1)] = x1 +
0
[03#(x1)] = x1 +
0
[04#(x1)] = x1 +
1
[05#(x1)] = x1 +
0
together with the usable rules

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

(w.r.t. the implicit argument filter of the reduction pair), the pairs

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

and no rules could be deleted.

1.1.1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.