Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z061)

The rewrite relation of the following TRS is considered.

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

1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.