Certification Problem

Input (TPDB TRS_Standard/SK90/4.36)

The rewrite relation of the following TRS is considered.

a(a(x)) → a(b(a(x))) (1)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by NaTT @ termCOMP 2023)

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
a#(a(x)) → a#(b(a(x))) (2)

1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.