Certification Problem

Input (TPDB TRS_Standard/Various_04/27)

The rewrite relation of the following TRS is considered.

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

1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.