Certification Problem

Input (TPDB SRS_Relative/ICFP_2010_relative/139163)

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 Closure Under Flat Contexts

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

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

1.1 Semantic Labeling

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

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

1.1.1 Rule Removal

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

1.1.1.1 Dependency Pair Transformation

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

1.1.1.1.1 Monotonic Reduction Pair Processor with Usable Rules

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

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

1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.