Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/213560)

The rewrite relation of the following TRS is considered.

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

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
2(1(0(0(x1)))) → 0(3(3(1(2(0(x1)))))) (49)
4(0(1(0(x1)))) → 4(0(3(1(0(x1))))) (50)
5(0(1(0(x1)))) → 0(5(3(1(0(x1))))) (51)
0(5(1(0(x1)))) → 0(5(3(1(0(x1))))) (52)
0(1(3(0(x1)))) → 0(5(3(1(0(x1))))) (53)
2(0(1(3(x1)))) → 2(0(5(3(1(x1))))) (54)
2(0(1(3(x1)))) → 0(3(1(2(3(x1))))) (55)
5(0(1(3(x1)))) → 0(3(5(3(1(x1))))) (56)
0(2(1(3(x1)))) → 0(3(3(1(2(x1))))) (57)
0(2(1(3(x1)))) → 4(1(2(0(3(x1))))) (58)
0(2(1(3(x1)))) → 1(2(3(0(3(x1))))) (59)
0(2(1(3(x1)))) → 0(1(2(3(3(x1))))) (60)
0(2(1(3(x1)))) → 0(1(2(5(3(x1))))) (61)
2(2(1(3(x1)))) → 1(2(2(5(3(x1))))) (62)
0(2(4(3(x1)))) → 0(4(2(3(3(x1))))) (63)
0(1(0(4(x1)))) → 0(4(0(3(1(x1))))) (64)
5(0(1(5(x1)))) → 0(5(5(3(3(1(x1)))))) (65)
0(5(2(5(x1)))) → 0(5(3(2(5(x1))))) (66)
0(1(3(5(x1)))) → 5(5(3(1(0(x1))))) (67)
0(1(4(0(0(x1))))) → 0(0(3(1(4(0(x1)))))) (68)
5(0(2(1(0(x1))))) → 2(1(5(0(3(0(x1)))))) (69)
2(1(3(1(0(x1))))) → 1(1(2(2(0(3(x1)))))) (70)
4(0(5(1(0(x1))))) → 0(5(3(1(4(0(x1)))))) (71)
5(3(5(1(0(x1))))) → 5(3(5(3(1(0(x1)))))) (72)
4(3(0(2(0(x1))))) → 0(3(2(5(4(0(x1)))))) (73)
5(1(3(2(0(x1))))) → 2(5(5(3(1(0(x1)))))) (74)
2(1(4(2(0(x1))))) → 2(4(1(1(2(0(x1)))))) (75)
2(0(5(2(0(x1))))) → 2(2(5(3(0(0(x1)))))) (76)
0(5(5(2(0(x1))))) → 5(1(5(2(0(0(x1)))))) (77)
0(5(1(3(0(x1))))) → 0(3(5(0(3(1(x1)))))) (78)
0(2(3(5(0(x1))))) → 5(3(1(2(0(0(x1)))))) (79)
2(5(0(1(3(x1))))) → 0(5(3(1(4(2(x1)))))) (80)
2(0(3(1(3(x1))))) → 0(3(3(3(1(2(x1)))))) (81)
0(2(3(1(3(x1))))) → 2(5(0(3(1(3(x1)))))) (82)
2(1(4(1(3(x1))))) → 1(2(2(3(4(1(x1)))))) (83)
0(2(4(1(3(x1))))) → 4(0(3(3(1(2(x1)))))) (84)
2(0(5(1(3(x1))))) → 5(0(3(1(5(2(x1)))))) (85)
0(0(1(3(3(x1))))) → 0(0(3(3(1(5(x1)))))) (86)
0(2(0(4(3(x1))))) → 4(1(2(0(0(3(x1)))))) (87)
2(3(2(4(3(x1))))) → 2(4(5(2(3(3(x1)))))) (88)
2(0(1(3(4(x1))))) → 1(0(3(1(2(4(x1)))))) (89)
0(2(1(3(4(x1))))) → 2(4(1(0(3(1(x1)))))) (90)
2(1(5(5(4(x1))))) → 1(1(2(5(4(5(x1)))))) (91)
0(5(5(5(4(x1))))) → 4(0(5(1(5(5(x1)))))) (92)
2(1(0(1(5(x1))))) → 0(5(3(1(1(2(x1)))))) (93)
4(0(1(1(5(x1))))) → 0(3(4(1(1(5(x1)))))) (94)
0(2(5(1(5(x1))))) → 5(0(5(3(1(2(x1)))))) (95)
5(0(1(4(5(x1))))) → 0(5(5(3(1(4(x1)))))) (96)

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

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

1.1.1 Dependency Graph Processor

The dependency pairs are split into 3 components.