Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-395)

The rewrite relation of the following TRS is considered.

Property / Task

Answer / Result

Proof (by matchbox @ termCOMP 2023)

1 Closure Under Flat Contexts

{b(☐), a(☐)}

1.1 Closure Under Flat Contexts

{b(☐), a(☐)}

1.1.1 Closure Under Flat Contexts

{b(☐), a(☐)}

1.1.1.1 Semantic Labeling

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

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

1.1.1.1.1 String Reversal

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

1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1 Rule Removal

1.1.1.1.1.1.1.1 String Reversal

There are no rules.

1.1.1.1.1.1.1.1.1 R is empty

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