Certification Problem

Input (TPDB TRS_Standard/Zantema_05/jw39)

The rewrite relation of the following TRS is considered.

f(f(x,a),a) f(f(f(a,f(a,a)),x),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#(f(x,a),a) f#(f(a,f(a,a)),x) (2)
f#(f(x,a),a) f#(a,f(a,a)) (3)
f#(f(x,a),a) f#(f(f(a,f(a,a)),x),a) (4)
f#(f(x,a),a) f#(a,a) (5)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.