Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z015)

The rewrite relation of the following TRS is considered.

a(b(x1)) b(a(a(a(x1)))) (1)
b(a(x1)) a(a(x1)) (2)
a(a(x1)) a(c(b(x1))) (3)

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.
a#(a(x1)) a#(c(b(x1))) (4)
a#(b(x1)) a#(a(x1)) (5)
a#(b(x1)) a#(x1) (6)
a#(b(x1)) a#(a(a(x1))) (7)
a#(a(x1)) b#(x1) (8)
b#(a(x1)) a#(a(x1)) (9)
a#(b(x1)) b#(a(a(a(x1)))) (10)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.