Certification Problem

Input (TPDB SRS_Relative/ICFP_2010_relative/4036)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by matchbox @ termCOMP 2023)

1 Closure Under Flat Contexts

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

There are 360 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 2160 ruless (increase limit for explicit display).

1.1.1 Rule Removal

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

1.1.1.1 String Reversal

1.1.1.1.1 Dependency Pair Transformation

1.1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules

1.1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.