Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/96464)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by matchbox @ termCOMP 2023)

1 Rule Removal

1.1 Closure Under Flat Contexts

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

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 540 ruless (increase limit for explicit display).

1.1.1.1 Rule Removal

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