Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/63142)

The rewrite relation of the following TRS is considered.

0(0(0(1(0(2(0(2(1(2(0(2(2(x1))))))))))))) 0(0(1(0(1(1(0(2(1(0(0(0(1(0(1(1(0(x1))))))))))))))))) (1)
0(0(0(1(1(2(1(2(1(1(0(0(0(x1))))))))))))) 1(0(0(2(2(2(2(1(1(2(0(2(0(0(2(1(0(x1))))))))))))))))) (2)
0(1(0(1(0(0(1(0(0(2(1(2(0(x1))))))))))))) 0(1(0(2(0(0(2(1(0(0(0(0(0(1(0(0(0(x1))))))))))))))))) (3)
0(1(2(0(2(0(1(1(1(1(0(0(2(x1))))))))))))) 0(0(0(0(0(2(0(2(2(0(2(2(2(0(0(0(0(x1))))))))))))))))) (4)
0(1(2(1(1(0(0(2(2(1(0(2(2(x1))))))))))))) 1(0(0(2(1(0(0(2(0(0(0(2(0(2(2(2(2(x1))))))))))))))))) (5)
0(1(2(2(0(0(2(0(0(0(2(0(2(x1))))))))))))) 2(1(0(0(0(2(1(1(0(2(0(1(0(2(1(0(2(x1))))))))))))))))) (6)
0(2(0(1(0(1(1(0(1(2(0(0(1(x1))))))))))))) 0(1(1(0(0(0(2(1(1(1(0(2(0(0(2(0(1(x1))))))))))))))))) (7)
1(0(0(1(0(2(2(0(0(1(2(0(0(x1))))))))))))) 0(0(0(0(0(1(0(1(0(1(1(0(1(0(0(2(0(x1))))))))))))))))) (8)
1(0(1(1(1(2(2(2(2(1(0(0(0(x1))))))))))))) 2(1(0(0(1(0(1(0(2(2(1(1(0(0(2(2(2(x1))))))))))))))))) (9)
1(1(0(0(1(0(0(0(0(1(1(1(2(x1))))))))))))) 1(1(0(2(1(0(0(2(1(0(1(0(0(2(0(1(2(x1))))))))))))))))) (10)
1(1(2(0(1(0(2(1(2(0(1(0(2(x1))))))))))))) 1(1(2(1(0(1(0(2(1(1(1(0(1(0(2(0(2(x1))))))))))))))))) (11)
1(1(2(2(1(1(2(1(0(0(1(0(2(x1))))))))))))) 0(0(2(0(2(0(0(0(2(0(0(2(0(0(2(2(2(x1))))))))))))))))) (12)
2(0(0(0(1(1(2(1(0(2(2(0(0(x1))))))))))))) 1(1(0(2(0(1(0(2(2(1(1(1(0(2(2(0(0(x1))))))))))))))))) (13)
2(0(0(1(1(2(2(1(0(2(2(2(2(x1))))))))))))) 1(0(2(2(1(0(1(2(1(0(1(0(0(2(0(2(0(x1))))))))))))))))) (14)
2(0(0(2(1(2(1(1(0(1(0(0(2(x1))))))))))))) 2(1(1(1(1(0(2(0(1(0(1(0(2(1(0(0(2(x1))))))))))))))))) (15)
2(1(1(2(2(0(2(1(0(0(0(1(0(x1))))))))))))) 1(1(2(0(0(2(0(0(1(0(0(2(0(0(0(1(0(x1))))))))))))))))) (16)
2(1(2(1(1(2(1(0(0(1(0(1(0(x1))))))))))))) 2(2(1(1(1(0(0(0(0(1(0(0(2(2(0(1(0(x1))))))))))))))))) (17)
2(1(2(2(0(2(1(0(2(0(2(1(0(x1))))))))))))) 1(0(1(2(0(0(2(0(0(2(1(0(2(1(0(0(0(x1))))))))))))))))) (18)
2(2(0(1(1(1(1(0(1(0(1(2(0(x1))))))))))))) 0(1(1(0(1(1(0(0(2(2(0(1(1(0(1(0(0(x1))))))))))))))))) (19)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

1 Closure Under Flat Contexts

Using the flat contexts

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

We obtain the transformed TRS
0(0(0(1(0(2(0(2(1(2(0(2(2(x1))))))))))))) 0(0(1(0(1(1(0(2(1(0(0(0(1(0(1(1(0(x1))))))))))))))))) (1)
0(0(0(0(1(1(2(1(2(1(1(0(0(0(x1)))))))))))))) 0(1(0(0(2(2(2(2(1(1(2(0(2(0(0(2(1(0(x1)))))))))))))))))) (20)
1(0(0(0(1(1(2(1(2(1(1(0(0(0(x1)))))))))))))) 1(1(0(0(2(2(2(2(1(1(2(0(2(0(0(2(1(0(x1)))))))))))))))))) (21)
2(0(0(0(1(1(2(1(2(1(1(0(0(0(x1)))))))))))))) 2(1(0(0(2(2(2(2(1(1(2(0(2(0(0(2(1(0(x1)))))))))))))))))) (22)
0(1(0(1(0(0(1(0(0(2(1(2(0(x1))))))))))))) 0(1(0(2(0(0(2(1(0(0(0(0(0(1(0(0(0(x1))))))))))))))))) (3)
0(1(2(0(2(0(1(1(1(1(0(0(2(x1))))))))))))) 0(0(0(0(0(2(0(2(2(0(2(2(2(0(0(0(0(x1))))))))))))))))) (4)
0(0(1(2(1(1(0(0(2(2(1(0(2(2(x1)))))))))))))) 0(1(0(0(2(1(0(0(2(0(0(0(2(0(2(2(2(2(x1)))))))))))))))))) (23)
1(0(1(2(1(1(0(0(2(2(1(0(2(2(x1)))))))))))))) 1(1(0(0(2(1(0(0(2(0(0(0(2(0(2(2(2(2(x1)))))))))))))))))) (24)
2(0(1(2(1(1(0(0(2(2(1(0(2(2(x1)))))))))))))) 2(1(0(0(2(1(0(0(2(0(0(0(2(0(2(2(2(2(x1)))))))))))))))))) (25)
0(0(1(2(2(0(0(2(0(0(0(2(0(2(x1)))))))))))))) 0(2(1(0(0(0(2(1(1(0(2(0(1(0(2(1(0(2(x1)))))))))))))))))) (26)
1(0(1(2(2(0(0(2(0(0(0(2(0(2(x1)))))))))))))) 1(2(1(0(0(0(2(1(1(0(2(0(1(0(2(1(0(2(x1)))))))))))))))))) (27)
2(0(1(2(2(0(0(2(0(0(0(2(0(2(x1)))))))))))))) 2(2(1(0(0(0(2(1(1(0(2(0(1(0(2(1(0(2(x1)))))))))))))))))) (28)
0(2(0(1(0(1(1(0(1(2(0(0(1(x1))))))))))))) 0(1(1(0(0(0(2(1(1(1(0(2(0(0(2(0(1(x1))))))))))))))))) (7)
0(1(0(0(1(0(2(2(0(0(1(2(0(0(x1)))))))))))))) 0(0(0(0(0(0(1(0(1(0(1(1(0(1(0(0(2(0(x1)))))))))))))))))) (29)
1(1(0(0(1(0(2(2(0(0(1(2(0(0(x1)))))))))))))) 1(0(0(0(0(0(1(0(1(0(1(1(0(1(0(0(2(0(x1)))))))))))))))))) (30)
2(1(0(0(1(0(2(2(0(0(1(2(0(0(x1)))))))))))))) 2(0(0(0(0(0(1(0(1(0(1(1(0(1(0(0(2(0(x1)))))))))))))))))) (31)
0(1(0(1(1(1(2(2(2(2(1(0(0(0(x1)))))))))))))) 0(2(1(0(0(1(0(1(0(2(2(1(1(0(0(2(2(2(x1)))))))))))))))))) (32)
1(1(0(1(1(1(2(2(2(2(1(0(0(0(x1)))))))))))))) 1(2(1(0(0(1(0(1(0(2(2(1(1(0(0(2(2(2(x1)))))))))))))))))) (33)
2(1(0(1(1(1(2(2(2(2(1(0(0(0(x1)))))))))))))) 2(2(1(0(0(1(0(1(0(2(2(1(1(0(0(2(2(2(x1)))))))))))))))))) (34)
1(1(0(0(1(0(0(0(0(1(1(1(2(x1))))))))))))) 1(1(0(2(1(0(0(2(1(0(1(0(0(2(0(1(2(x1))))))))))))))))) (10)
1(1(2(0(1(0(2(1(2(0(1(0(2(x1))))))))))))) 1(1(2(1(0(1(0(2(1(1(1(0(1(0(2(0(2(x1))))))))))))))))) (11)
0(1(1(2(2(1(1(2(1(0(0(1(0(2(x1)))))))))))))) 0(0(0(2(0(2(0(0(0(2(0(0(2(0(0(2(2(2(x1)))))))))))))))))) (35)
1(1(1(2(2(1(1(2(1(0(0(1(0(2(x1)))))))))))))) 1(0(0(2(0(2(0(0(0(2(0(0(2(0(0(2(2(2(x1)))))))))))))))))) (36)
2(1(1(2(2(1(1(2(1(0(0(1(0(2(x1)))))))))))))) 2(0(0(2(0(2(0(0(0(2(0(0(2(0(0(2(2(2(x1)))))))))))))))))) (37)
0(2(0(0(0(1(1(2(1(0(2(2(0(0(x1)))))))))))))) 0(1(1(0(2(0(1(0(2(2(1(1(1(0(2(2(0(0(x1)))))))))))))))))) (38)
1(2(0(0(0(1(1(2(1(0(2(2(0(0(x1)))))))))))))) 1(1(1(0(2(0(1(0(2(2(1(1(1(0(2(2(0(0(x1)))))))))))))))))) (39)
2(2(0(0(0(1(1(2(1(0(2(2(0(0(x1)))))))))))))) 2(1(1(0(2(0(1(0(2(2(1(1(1(0(2(2(0(0(x1)))))))))))))))))) (40)
0(2(0(0(1(1(2(2(1(0(2(2(2(2(x1)))))))))))))) 0(1(0(2(2(1(0(1(2(1(0(1(0(0(2(0(2(0(x1)))))))))))))))))) (41)
1(2(0(0(1(1(2(2(1(0(2(2(2(2(x1)))))))))))))) 1(1(0(2(2(1(0(1(2(1(0(1(0(0(2(0(2(0(x1)))))))))))))))))) (42)
2(2(0(0(1(1(2(2(1(0(2(2(2(2(x1)))))))))))))) 2(1(0(2(2(1(0(1(2(1(0(1(0(0(2(0(2(0(x1)))))))))))))))))) (43)
2(0(0(2(1(2(1(1(0(1(0(0(2(x1))))))))))))) 2(1(1(1(1(0(2(0(1(0(1(0(2(1(0(0(2(x1))))))))))))))))) (15)
0(2(1(1(2(2(0(2(1(0(0(0(1(0(x1)))))))))))))) 0(1(1(2(0(0(2(0(0(1(0(0(2(0(0(0(1(0(x1)))))))))))))))))) (44)
1(2(1(1(2(2(0(2(1(0(0(0(1(0(x1)))))))))))))) 1(1(1(2(0(0(2(0(0(1(0(0(2(0(0(0(1(0(x1)))))))))))))))))) (45)
2(2(1(1(2(2(0(2(1(0(0(0(1(0(x1)))))))))))))) 2(1(1(2(0(0(2(0(0(1(0(0(2(0(0(0(1(0(x1)))))))))))))))))) (46)
2(1(2(1(1(2(1(0(0(1(0(1(0(x1))))))))))))) 2(2(1(1(1(0(0(0(0(1(0(0(2(2(0(1(0(x1))))))))))))))))) (17)
0(2(1(2(2(0(2(1(0(2(0(2(1(0(x1)))))))))))))) 0(1(0(1(2(0(0(2(0(0(2(1(0(2(1(0(0(0(x1)))))))))))))))))) (47)
1(2(1(2(2(0(2(1(0(2(0(2(1(0(x1)))))))))))))) 1(1(0(1(2(0(0(2(0(0(2(1(0(2(1(0(0(0(x1)))))))))))))))))) (48)
2(2(1(2(2(0(2(1(0(2(0(2(1(0(x1)))))))))))))) 2(1(0(1(2(0(0(2(0(0(2(1(0(2(1(0(0(0(x1)))))))))))))))))) (49)
0(2(2(0(1(1(1(1(0(1(0(1(2(0(x1)))))))))))))) 0(0(1(1(0(1(1(0(0(2(2(0(1(1(0(1(0(0(x1)))))))))))))))))) (50)
1(2(2(0(1(1(1(1(0(1(0(1(2(0(x1)))))))))))))) 1(0(1(1(0(1(1(0(0(2(2(0(1(1(0(1(0(0(x1)))))))))))))))))) (51)
2(2(2(0(1(1(1(1(0(1(0(1(2(0(x1)))))))))))))) 2(0(1(1(0(1(1(0(0(2(2(0(1(1(0(1(0(0(x1)))))))))))))))))) (52)

1.1 Semantic Labeling

Root-labeling is applied.

We obtain the labeled TRS

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

1.1.1 Bounds

The given TRS is match-(raise)-bounded by 1. This is shown by the following automaton. The automaton is closed under rewriting as it is compatible.