Certification Problem

Input (TPDB TRS_Standard/Secret_05_TRS/matchbox2)

The rewrite relation of the following TRS is considered.

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

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.