Certification Problem

Input (TPDB TRS_Standard/Endrullis_06/pair2simple2)

The rewrite relation of the following TRS is considered.

p(a(x0),p(a(a(a(x1))),x2)) p(a(x2),p(a(a(b(x0))),x2)) (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.
p#(a(x0),p(a(a(a(x1))),x2)) p#(a(a(b(x0))),x2) (2)
p#(a(x0),p(a(a(a(x1))),x2)) p#(a(x2),p(a(a(b(x0))),x2)) (3)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.