Certification Problem

Input (TPDB SRS_Relative/ICFP_2010_relative/142142)

The rewrite relation of the following TRS is considered.

0(0(0(1(1(0(0(0(0(1(2(0(1(x1))))))))))))) 1(1(1(1(0(0(0(1(0(0(1(1(0(1(1(0(0(x1))))))))))))))))) (1)
0(0(0(1(1(2(2(1(1(0(0(1(1(x1))))))))))))) 0(1(1(0(2(0(0(0(1(0(1(1(0(0(0(1(0(x1))))))))))))))))) (2)
0(1(0(0(2(1(0(0(1(0(0(1(0(x1))))))))))))) 0(1(1(0(0(0(1(1(0(1(0(0(1(1(1(0(0(x1))))))))))))))))) (3)
0(1(0(1(1(0(0(0(0(2(0(1(2(x1))))))))))))) 1(1(1(0(0(0(1(0(1(1(0(1(1(1(0(0(2(x1))))))))))))))))) (4)
0(1(0(1(1(0(2(1(0(1(0(0(0(x1))))))))))))) 0(1(1(0(1(1(0(0(1(0(0(1(0(1(1(1(0(x1))))))))))))))))) (5)
0(1(1(0(0(1(0(2(0(0(0(2(1(x1))))))))))))) 0(0(1(1(0(1(0(1(1(0(0(1(1(2(1(1(1(x1))))))))))))))))) (6)
0(1(2(1(0(0(0(0(0(2(1(1(1(x1))))))))))))) 0(1(0(1(1(2(0(1(0(0(0(1(1(0(0(0(1(x1))))))))))))))))) (7)
0(2(0(0(2(1(0(0(0(0(0(0(1(x1))))))))))))) 1(0(0(1(0(1(1(1(0(0(0(1(0(0(0(0(1(x1))))))))))))))))) (8)
0(2(1(0(1(2(1(2(2(0(1(1(1(x1))))))))))))) 0(2(1(1(0(0(2(1(1(0(0(1(2(1(1(1(1(x1))))))))))))))))) (9)
0(2(1(0(2(1(0(1(2(0(0(0(1(x1))))))))))))) 0(0(2(1(1(1(1(0(0(1(0(2(0(0(0(1(0(x1))))))))))))))))) (10)
0(2(1(1(0(0(0(0(2(1(0(1(1(x1))))))))))))) 0(0(1(0(1(0(1(0(2(1(1(1(0(0(0(0(0(x1))))))))))))))))) (11)
0(2(2(0(0(1(1(0(1(0(1(0(1(x1))))))))))))) 0(0(2(1(0(0(0(1(1(0(1(1(0(1(1(0(0(x1))))))))))))))))) (12)
1(0(0(0(0(1(1(1(0(0(2(1(1(x1))))))))))))) 1(1(1(1(1(1(1(1(1(1(0(1(1(0(1(0(0(x1))))))))))))))))) (13)
1(0(0(0(1(1(1(2(0(0(1(0(2(x1))))))))))))) 0(1(1(0(1(0(0(1(0(0(0(0(0(2(0(1(2(x1))))))))))))))))) (14)
1(0(0(0(1(2(0(1(0(0(0(1(0(x1))))))))))))) 1(1(1(0(0(0(1(1(0(1(1(0(1(1(1(0(1(x1))))))))))))))))) (15)
1(0(0(0(2(1(0(0(2(0(1(0(1(x1))))))))))))) 2(1(0(0(1(1(0(1(0(0(0(0(0(1(0(0(0(x1))))))))))))))))) (16)
1(0(0(1(0(1(2(1(0(2(1(1(0(x1))))))))))))) 0(1(1(1(0(0(0(0(0(2(1(1(1(1(1(1(0(x1))))))))))))))))) (17)
1(0(0(1(0(2(1(1(0(1(1(0(1(x1))))))))))))) 1(1(1(1(0(0(1(0(1(0(1(1(1(0(0(1(1(x1))))))))))))))))) (18)
1(0(0(1(2(0(0(0(2(2(1(1(2(x1))))))))))))) 1(0(0(0(1(0(2(2(0(1(1(1(0(1(2(1(2(x1))))))))))))))))) (19)
1(0(0(1(2(1(1(1(0(2(0(2(1(x1))))))))))))) 1(0(0(1(0(0(1(2(0(1(0(1(2(2(1(0(0(x1))))))))))))))))) (20)
1(0(0(2(0(1(0(1(0(2(1(0(2(x1))))))))))))) 0(1(0(0(0(2(0(1(1(0(1(0(1(1(0(0(2(x1))))))))))))))))) (21)
1(0(1(0(1(2(1(1(2(1(0(0(1(x1))))))))))))) 1(1(0(0(1(0(0(2(2(0(0(0(0(1(1(0(0(x1))))))))))))))))) (22)
1(0(1(2(0(1(2(1(0(0(1(0(0(x1))))))))))))) 0(0(0(0(0(1(1(0(1(1(1(1(0(2(1(0(1(x1))))))))))))))))) (23)
1(0(2(2(1(0(1(0(1(0(1(0(2(x1))))))))))))) 1(1(1(0(0(0(0(0(0(1(1(0(0(0(2(1(2(x1))))))))))))))))) (24)
1(1(0(1(0(2(2(2(1(0(0(0(0(x1))))))))))))) 1(1(0(1(1(0(1(0(1(0(1(0(0(2(0(0(1(x1))))))))))))))))) (25)
1(1(0(2(2(0(0(1(2(1(2(1(2(x1))))))))))))) 1(1(2(0(0(0(1(1(0(2(2(1(1(0(1(0(2(x1))))))))))))))))) (26)
1(1(1(1(0(1(0(2(1(1(0(0(2(x1))))))))))))) 1(1(1(0(0(1(0(1(1(0(1(0(0(2(1(0(2(x1))))))))))))))))) (27)
1(1(1(2(1(1(0(2(0(2(0(1(0(x1))))))))))))) 1(1(1(0(0(1(0(2(2(0(0(1(2(1(0(1(0(x1))))))))))))))))) (28)
1(1(2(1(1(0(1(1(0(1(1(0(2(x1))))))))))))) 1(1(2(0(1(0(1(0(0(0(0(0(1(0(0(1(2(x1))))))))))))))))) (29)
1(1(2(2(1(1(1(1(0(1(1(0(0(x1))))))))))))) 1(0(1(1(1(2(1(1(0(1(0(1(1(1(0(0(0(x1))))))))))))))))) (30)
1(1(2(2(2(1(0(0(1(1(0(0(0(x1))))))))))))) 0(1(0(1(1(1(1(1(0(2(1(0(1(1(0(0(0(x1))))))))))))))))) (31)
1(2(0(1(0(1(1(1(0(1(1(1(1(x1))))))))))))) 1(0(0(1(1(1(0(1(0(0(1(1(0(1(1(0(1(x1))))))))))))))))) (32)
1(2(1(0(0(0(0(1(0(1(1(2(1(x1))))))))))))) 0(1(0(0(1(0(0(0(1(1(0(0(2(1(0(0(0(x1))))))))))))))))) (33)
1(2(1(0(1(0(0(1(0(2(0(1(1(x1))))))))))))) 1(0(0(1(0(0(0(2(2(0(0(1(0(0(1(1(0(x1))))))))))))))))) (34)
1(2(2(0(1(1(1(1(1(1(0(1(0(x1))))))))))))) 1(0(0(2(2(0(0(1(0(0(1(0(0(0(1(1(0(x1))))))))))))))))) (35)
2(1(0(0(1(1(0(1(2(1(0(1(1(x1))))))))))))) 1(0(0(0(1(0(0(0(0(2(1(0(0(1(1(0(1(x1))))))))))))))))) (36)
2(1(0(1(2(0(0(2(0(1(0(1(2(x1))))))))))))) 2(1(0(0(1(0(0(0(0(1(0(2(2(2(0(1(2(x1))))))))))))))))) (37)
2(1(0(2(2(2(2(1(0(0(0(0(1(x1))))))))))))) 1(1(1(0(0(0(1(1(2(1(0(0(1(2(0(1(0(x1))))))))))))))))) (38)
2(1(1(0(1(0(1(1(1(2(1(1(0(x1))))))))))))) 1(1(2(1(1(0(0(1(1(0(0(1(1(0(1(0(0(x1))))))))))))))))) (39)
2(1(1(0(2(1(0(2(1(0(0(0(1(x1))))))))))))) 0(1(0(1(1(1(1(2(0(1(0(0(1(0(0(1(0(x1))))))))))))))))) (40)
2(1(1(1(1(1(1(1(0(0(2(0(1(x1))))))))))))) 1(1(1(0(1(1(1(0(1(0(0(1(0(2(0(1(0(x1))))))))))))))))) (41)
2(2(1(0(0(2(1(1(1(1(1(0(1(x1))))))))))))) 2(2(2(0(0(0(1(0(1(0(1(1(0(1(1(1(0(x1))))))))))))))))) (42)
2(2(1(0(0(2(1(2(0(0(1(0(2(x1))))))))))))) 2(1(0(0(0(2(1(0(0(1(2(0(0(1(1(1(2(x1))))))))))))))))) (43)
2(2(2(0(0(0(1(0(0(0(0(1(0(x1))))))))))))) 0(2(0(0(1(1(1(0(1(1(0(0(0(1(0(1(0(x1))))))))))))))))) (44)
0(0(0(0(1(0(1(0(2(1(1(0(1(x1))))))))))))) 0(0(0(1(0(0(0(0(0(2(1(1(0(1(0(0(0(x1))))))))))))))))) (45)
0(0(1(1(0(0(0(2(2(2(0(1(0(x1))))))))))))) 0(0(1(1(0(0(0(2(2(0(1(0(0(1(1(1(0(x1))))))))))))))))) (46)
0(1(0(0(1(0(0(2(0(2(2(1(1(x1))))))))))))) 0(0(1(0(0(0(2(1(0(1(1(1(2(1(0(1(0(x1))))))))))))))))) (47)
0(1(0(0(2(0(0(2(2(1(1(0(1(x1))))))))))))) 0(1(0(2(0(1(2(2(1(0(0(1(0(0(0(0(1(x1))))))))))))))))) (48)
0(1(0(1(1(0(0(0(1(1(1(0(1(x1))))))))))))) 0(1(1(1(0(1(0(1(0(0(0(0(0(0(0(0(0(x1))))))))))))))))) (49)
0(1(2(0(2(0(2(2(0(1(1(1(2(x1))))))))))))) 0(1(0(2(0(1(1(0(0(2(1(2(0(0(0(1(2(x1))))))))))))))))) (50)
0(2(2(1(1(1(2(0(1(0(0(0(0(x1))))))))))))) 0(2(1(0(0(1(0(1(0(0(1(2(1(0(1(1(1(x1))))))))))))))))) (51)
0(2(2(1(2(1(1(0(1(2(0(1(1(x1))))))))))))) 0(2(1(1(1(0(2(1(1(0(0(1(1(2(1(1(1(x1))))))))))))))))) (52)
1(0(0(2(1(2(2(1(2(0(0(2(1(x1))))))))))))) 1(0(0(2(2(2(0(0(1(0(2(0(0(2(1(0(0(x1))))))))))))))))) (53)
1(0(1(1(1(1(1(0(2(0(0(2(1(x1))))))))))))) 1(0(0(1(1(0(1(0(0(1(1(0(0(2(2(2(1(x1))))))))))))))))) (54)
1(0(2(0(0(0(0(2(1(0(1(0(0(x1))))))))))))) 1(2(1(2(1(0(0(1(0(1(0(1(0(0(0(0(1(x1))))))))))))))))) (55)
1(0(2(0(1(2(1(0(1(0(1(1(1(x1))))))))))))) 1(2(1(0(1(0(2(1(1(0(0(0(1(0(1(1(0(x1))))))))))))))))) (56)
1(1(2(0(2(1(0(2(0(2(0(1(0(x1))))))))))))) 1(1(2(1(1(0(1(0(1(0(2(0(1(2(1(1(0(x1))))))))))))))))) (57)
1(2(0(1(1(2(0(2(2(1(0(1(0(x1))))))))))))) 1(2(2(0(2(1(2(2(1(1(0(0(0(0(0(0(0(x1))))))))))))))))) (58)
1(2(0(2(1(1(1(0(2(1(1(2(1(x1))))))))))))) 1(2(1(1(2(0(2(1(0(1(0(0(1(2(1(0(0(x1))))))))))))))))) (59)
1(2(1(0(2(2(1(0(2(1(2(1(2(x1))))))))))))) 1(2(1(2(0(0(1(0(0(1(0(0(2(1(2(1(2(x1))))))))))))))))) (60)
1(2(2(0(2(2(1(1(0(2(0(1(2(x1))))))))))))) 1(0(0(0(2(2(0(2(2(0(0(2(1(0(1(1(2(x1))))))))))))))))) (61)
1(2(2(0(2(2(1(2(1(2(0(1(1(x1))))))))))))) 1(2(0(1(1(0(0(1(2(2(0(2(1(2(0(1(1(x1))))))))))))))))) (62)
2(0(1(0(2(1(0(2(1(2(1(1(1(x1))))))))))))) 2(0(1(0(2(0(2(2(1(0(1(0(1(0(0(1(1(x1))))))))))))))))) (63)
2(0(2(2(1(1(0(0(1(1(0(1(1(x1))))))))))))) 2(0(2(2(1(1(0(1(0(0(0(1(1(0(0(1(0(x1))))))))))))))))) (64)
2(1(0(1(0(1(0(0(1(1(1(2(2(x1))))))))))))) 2(1(0(1(1(0(0(1(0(1(1(0(0(0(0(2(2(x1))))))))))))))))) (65)
2(1(1(0(0(2(2(0(0(0(1(1(0(x1))))))))))))) 2(0(0(1(1(0(0(0(2(1(1(1(1(0(0(0(1(x1))))))))))))))))) (66)
2(1(1(0(1(1(0(2(2(1(2(1(2(x1))))))))))))) 2(1(0(1(1(0(0(1(0(1(1(1(2(2(2(1(2(x1))))))))))))))))) (67)
2(1(1(2(0(2(0(0(0(2(2(1(0(x1))))))))))))) 2(1(0(1(0(0(2(0(1(2(1(1(1(1(2(1(0(x1))))))))))))))))) (68)
2(1(1(2(2(2(1(1(0(1(2(0(1(x1))))))))))))) 2(2(1(0(0(1(0(0(0(2(2(1(1(1(2(0(1(x1))))))))))))))))) (69)
2(1(2(0(0(1(0(1(0(0(0(2(0(x1))))))))))))) 2(1(0(0(2(1(1(0(0(0(1(0(0(0(1(2(0(x1))))))))))))))))) (70)
2(1(2(1(0(0(0(2(1(0(1(0(0(x1))))))))))))) 2(0(1(1(1(0(0(1(1(0(1(0(2(1(1(0(0(x1))))))))))))))))) (71)
2(2(1(0(2(1(0(2(2(1(0(0(1(x1))))))))))))) 2(0(1(1(0(0(0(1(2(1(1(0(1(1(2(1(1(x1))))))))))))))))) (72)
2(2(1(2(2(0(2(1(1(2(2(2(0(x1))))))))))))) 2(2(1(0(1(1(2(0(1(0(2(1(2(0(0(2(0(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 +
2282
[23(x1)] = x1 +
2280
[26(x1)] = x1 +
8398/5
[21(x1)] = x1 +
2281
[24(x1)] = x1 +
2281
[27(x1)] = x1 +
14459/10
[22(x1)] = x1 +
2298
[25(x1)] = x1 +
7809/5
[28(x1)] = x1 +
18221/10
[10(x1)] = x1 +
2280
[13(x1)] = x1 +
7828/5
[16(x1)] = x1 +
2286
[11(x1)] = x1 +
20729/10
[14(x1)] = x1 +
1359/10
[17(x1)] = x1 +
1
[12(x1)] = x1 +
1900
[15(x1)] = x1 +
39
[18(x1)] = x1 +
0
[00(x1)] = x1 +
2280
[03(x1)] = x1 +
1159
[06(x1)] = x1 +
2282
[01(x1)] = x1 +
7676/5
[04(x1)] = x1 +
5
[07(x1)] = x1 +
0
[02(x1)] = x1 +
5757/5
[05(x1)] = x1 +
0
[08(x1)] = x1 +
0
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.