Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/91218)

The rewrite relation of the following TRS is considered.

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

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 120 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 360 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 3240 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 +
110
[23(x1)] = x1 +
10
[26(x1)] = x1 +
111
[21(x1)] = x1 +
0
[24(x1)] = x1 +
0
[27(x1)] = x1 +
61
[22(x1)] = x1 +
110
[25(x1)] = x1 +
110
[28(x1)] = x1 +
110
[10(x1)] = x1 +
91
[13(x1)] = x1 +
1
[16(x1)] = x1 +
100
[11(x1)] = x1 +
0
[14(x1)] = x1 +
0
[17(x1)] = x1 +
0
[12(x1)] = x1 +
1
[15(x1)] = x1 +
0
[18(x1)] = x1 +
80
[00(x1)] = x1 +
110
[03(x1)] = x1 +
0
[06(x1)] = x1 +
111
[01(x1)] = x1 +
70
[04(x1)] = x1 +
0
[07(x1)] = x1 +
110
[02(x1)] = x1 +
20
[05(x1)] = x1 +
80
[08(x1)] = x1 +
90
all of the following rules can be deleted.

There are 3240 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.