Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/58194)

The rewrite relation of the following TRS is considered.

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

Property / Task

Answer / Result

Proof (by matchbox @ termCOMP 2023)

1 Closure Under Flat Contexts

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

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

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

1.1.1 Rule Removal

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

1.1.1.1 Dependency Pair Transformation

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

1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules

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

1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.