Certification Problem

Input (TPDB TRS_Standard/SK90/2.60)

The rewrite relation of the following TRS is considered.

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

1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.