Certification Problem

Input (TPDB SRS_Standard/Zantema_04/z006)

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by AProVE @ termCOMP 2023)

1 Dependency Pair Transformation

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

1.1 Dependency Graph Processor

The dependency pairs are split into 2 components.