Certification Problem

Input (TPDB TRS_Standard/Transformed_CSR_04/Ex18_Luc06_L)

The rewrite relation of the following TRS is considered.

f(f(a)) → f(g) (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.
f#(f(a)) → f#(g) (2)

1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.