Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z047)

The rewrite relation of the following TRS is considered.

c(a(b(a(x1)))) a(b(a(a(c(a(b(c(a(b(x1)))))))))) (1)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by matchbox @ termCOMP 2023)

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
c#(a(b(a(x1)))) c#(a(b(x1))) (2)
c#(a(b(a(x1)))) c#(a(b(c(a(b(x1)))))) (3)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.