Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/4046)

The rewrite relation of the following TRS is considered.

4(2(4(x1))) 2(0(0(5(3(3(5(2(0(4(x1)))))))))) (1)
4(4(2(4(2(x1))))) 2(0(5(2(1(4(0(2(0(1(x1)))))))))) (2)
0(5(4(2(4(3(x1)))))) 5(1(5(5(3(5(3(0(0(0(x1)))))))))) (3)
1(1(4(5(3(3(x1)))))) 1(3(1(1(3(0(1(2(2(1(x1)))))))))) (4)
3(1(4(3(1(2(x1)))))) 0(0(1(1(4(2(3(0(0(3(x1)))))))))) (5)
3(2(4(2(4(1(x1)))))) 0(2(1(1(1(5(3(1(3(3(x1)))))))))) (6)
3(3(0(4(1(2(x1)))))) 3(5(1(2(0(2(0(5(3(1(x1)))))))))) (7)
4(1(4(5(0(5(4(x1))))))) 4(1(5(3(1(0(5(3(1(0(x1)))))))))) (8)
4(4(0(5(4(2(2(x1))))))) 4(0(4(3(4(4(4(5(4(1(x1)))))))))) (9)
5(4(5(3(2(4(3(x1))))))) 2(5(5(5(0(4(5(0(1(4(x1)))))))))) (10)

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
4(2(4(x1))) 4(0(2(5(3(3(5(0(0(2(x1)))))))))) (11)
2(4(2(4(4(x1))))) 1(0(2(0(4(1(2(5(0(2(x1)))))))))) (12)
3(4(2(4(5(0(x1)))))) 0(0(0(3(5(3(5(5(1(5(x1)))))))))) (13)
3(3(5(4(1(1(x1)))))) 1(2(2(1(0(3(1(1(3(1(x1)))))))))) (14)
2(1(3(4(1(3(x1)))))) 3(0(0(3(2(4(1(1(0(0(x1)))))))))) (15)
1(4(2(4(2(3(x1)))))) 3(3(1(3(5(1(1(1(2(0(x1)))))))))) (16)
2(1(4(0(3(3(x1)))))) 1(3(5(0(2(0(2(1(5(3(x1)))))))))) (17)
4(5(0(5(4(1(4(x1))))))) 0(1(3(5(0(1(3(5(1(4(x1)))))))))) (18)
2(2(4(5(0(4(4(x1))))))) 1(4(5(4(4(4(3(4(0(4(x1)))))))))) (19)
3(4(2(3(5(4(5(x1))))))) 4(1(0(5(4(0(5(5(5(2(x1)))))))))) (20)

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
4#(2(4(x1))) 4#(0(2(5(3(3(5(0(0(2(x1)))))))))) (21)
4#(2(4(x1))) 2#(5(3(3(5(0(0(2(x1)))))))) (22)
4#(2(4(x1))) 3#(3(5(0(0(2(x1)))))) (23)
4#(2(4(x1))) 3#(5(0(0(2(x1))))) (24)
4#(2(4(x1))) 2#(x1) (25)
2#(4(2(4(4(x1))))) 1#(0(2(0(4(1(2(5(0(2(x1)))))))))) (26)
2#(4(2(4(4(x1))))) 2#(0(4(1(2(5(0(2(x1)))))))) (27)
2#(4(2(4(4(x1))))) 4#(1(2(5(0(2(x1)))))) (28)
2#(4(2(4(4(x1))))) 1#(2(5(0(2(x1))))) (29)
2#(4(2(4(4(x1))))) 2#(5(0(2(x1)))) (30)
2#(4(2(4(4(x1))))) 2#(x1) (31)
3#(4(2(4(5(0(x1)))))) 3#(5(3(5(5(1(5(x1))))))) (32)
3#(4(2(4(5(0(x1)))))) 3#(5(5(1(5(x1))))) (33)
3#(4(2(4(5(0(x1)))))) 1#(5(x1)) (34)
3#(3(5(4(1(1(x1)))))) 1#(2(2(1(0(3(1(1(3(1(x1)))))))))) (35)
3#(3(5(4(1(1(x1)))))) 2#(2(1(0(3(1(1(3(1(x1))))))))) (36)
3#(3(5(4(1(1(x1)))))) 2#(1(0(3(1(1(3(1(x1)))))))) (37)
3#(3(5(4(1(1(x1)))))) 1#(0(3(1(1(3(1(x1))))))) (38)
3#(3(5(4(1(1(x1)))))) 3#(1(1(3(1(x1))))) (39)
3#(3(5(4(1(1(x1)))))) 1#(1(3(1(x1)))) (40)
3#(3(5(4(1(1(x1)))))) 1#(3(1(x1))) (41)
3#(3(5(4(1(1(x1)))))) 3#(1(x1)) (42)
2#(1(3(4(1(3(x1)))))) 3#(0(0(3(2(4(1(1(0(0(x1)))))))))) (43)
2#(1(3(4(1(3(x1)))))) 3#(2(4(1(1(0(0(x1))))))) (44)
2#(1(3(4(1(3(x1)))))) 2#(4(1(1(0(0(x1)))))) (45)
2#(1(3(4(1(3(x1)))))) 4#(1(1(0(0(x1))))) (46)
2#(1(3(4(1(3(x1)))))) 1#(1(0(0(x1)))) (47)
2#(1(3(4(1(3(x1)))))) 1#(0(0(x1))) (48)
1#(4(2(4(2(3(x1)))))) 3#(3(1(3(5(1(1(1(2(0(x1)))))))))) (49)
1#(4(2(4(2(3(x1)))))) 3#(1(3(5(1(1(1(2(0(x1))))))))) (50)
1#(4(2(4(2(3(x1)))))) 1#(3(5(1(1(1(2(0(x1)))))))) (51)
1#(4(2(4(2(3(x1)))))) 3#(5(1(1(1(2(0(x1))))))) (52)
1#(4(2(4(2(3(x1)))))) 1#(1(1(2(0(x1))))) (53)
1#(4(2(4(2(3(x1)))))) 1#(1(2(0(x1)))) (54)
1#(4(2(4(2(3(x1)))))) 1#(2(0(x1))) (55)
1#(4(2(4(2(3(x1)))))) 2#(0(x1)) (56)
2#(1(4(0(3(3(x1)))))) 1#(3(5(0(2(0(2(1(5(3(x1)))))))))) (57)
2#(1(4(0(3(3(x1)))))) 3#(5(0(2(0(2(1(5(3(x1))))))))) (58)
2#(1(4(0(3(3(x1)))))) 2#(0(2(1(5(3(x1)))))) (59)
2#(1(4(0(3(3(x1)))))) 2#(1(5(3(x1)))) (60)
2#(1(4(0(3(3(x1)))))) 1#(5(3(x1))) (61)
4#(5(0(5(4(1(4(x1))))))) 1#(3(5(0(1(3(5(1(4(x1))))))))) (62)
4#(5(0(5(4(1(4(x1))))))) 3#(5(0(1(3(5(1(4(x1)))))))) (63)
4#(5(0(5(4(1(4(x1))))))) 1#(3(5(1(4(x1))))) (64)
4#(5(0(5(4(1(4(x1))))))) 3#(5(1(4(x1)))) (65)
2#(2(4(5(0(4(4(x1))))))) 1#(4(5(4(4(4(3(4(0(4(x1)))))))))) (66)
2#(2(4(5(0(4(4(x1))))))) 4#(5(4(4(4(3(4(0(4(x1))))))))) (67)
2#(2(4(5(0(4(4(x1))))))) 4#(4(4(3(4(0(4(x1))))))) (68)
2#(2(4(5(0(4(4(x1))))))) 4#(4(3(4(0(4(x1)))))) (69)
2#(2(4(5(0(4(4(x1))))))) 4#(3(4(0(4(x1))))) (70)
2#(2(4(5(0(4(4(x1))))))) 3#(4(0(4(x1)))) (71)
2#(2(4(5(0(4(4(x1))))))) 4#(0(4(x1))) (72)
3#(4(2(3(5(4(5(x1))))))) 4#(1(0(5(4(0(5(5(5(2(x1)))))))))) (73)
3#(4(2(3(5(4(5(x1))))))) 1#(0(5(4(0(5(5(5(2(x1))))))))) (74)
3#(4(2(3(5(4(5(x1))))))) 4#(0(5(5(5(2(x1)))))) (75)
3#(4(2(3(5(4(5(x1))))))) 2#(x1) (76)

1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.