Certification Problem

Input (TPDB SRS_Relative/ICFP_2010_relative/4893)

The relative rewrite relation R/S is considered where R is the following TRS

and S is the following TRS.

Property / Task

Answer / Result

Proof (by matchbox @ termCOMP 2023)

1 Split

We split R in the relative problem D/R-D and R-D, where the rules D

1.1 Closure Under Flat Contexts

{5(☐), 4(☐), 3(☐), 2(☐), 1(☐), 0(☐)}

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

1.1.1 Semantic Labeling

As carrier we take the set {0,...,5}. Symbols are labeled by the interpretation of their arguments using the interpretations (modulo 6):

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

1.1.1.1 Rule Removal

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

1.2 Rule Removal

1.2.1 R is empty

There are no rules in the TRS. Hence, it is terminating.