Certification Problem

Input (TPDB SRS_Standard/ICFP_2010/157150)

The rewrite relation of the following TRS is considered.

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

Property / Task

Answer / Result

Proof (by AProVE @ termCOMP 2023)

1 String Reversal

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

1.1 Closure Under Flat Contexts

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

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

1.1.1 Semantic Labeling

Root-labeling is applied.

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

1.1.1.1 Rule Removal

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

1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1 Rule Removal

1.1.1.1.1.1.1.1 Rule Removal

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

1.1.1.1.1.1.1.1.1 Rule Removal

1.1.1.1.1.1.1.1.1.1 Rule Removal

1.1.1.1.1.1.1.1.1.1.1 Rule Removal

1.1.1.1.1.1.1.1.1.1.1.1 Rule Removal

1.1.1.1.1.1.1.1.1.1.1.1.1 Switch to Innermost Termination

The TRS is overlay and locally confluent:

Hence, it suffices to show innermost termination in the following.

1.1.1.1.1.1.1.1.1.1.1.1.1.1 Dependency Pair Transformation

1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Usable Rules Processor

We restrict the rewrite rules to the following usable rules of the DP problem.

There are no rules.

1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Innermost Lhss Removal Processor

We restrict the innermost strategy to the following left hand sides.

There are no lhss.

1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Reduction Pair Processor

1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 P is empty

There are no pairs anymore.