Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z050)

The rewrite relation of the following TRS is considered.

a(b(b(a(a(b(x1)))))) a(a(b(b(a(b(a(x1))))))) (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.
a#(b(b(a(a(b(x1)))))) a#(b(b(a(b(a(x1)))))) (2)
a#(b(b(a(a(b(x1)))))) a#(b(a(x1))) (3)
a#(b(b(a(a(b(x1)))))) a#(a(b(b(a(b(a(x1))))))) (4)
a#(b(b(a(a(b(x1)))))) a#(x1) (5)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.