Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-244)

The rewrite relation of the following TRS is considered.

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

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
a#(a(b(a(x1)))) b#(x1) (4)
a#(a(b(a(x1)))) a#(b(x1)) (5)
a#(a(b(a(x1)))) b#(a(b(x1))) (6)
a#(a(b(a(x1)))) a#(b(a(b(x1)))) (7)
b#(b(a(b(x1)))) a#(x1) (8)
b#(b(a(b(x1)))) b#(a(x1)) (9)
b#(b(a(b(x1)))) b#(b(a(x1))) (10)
b#(b(a(b(x1)))) a#(b(b(a(x1)))) (11)
b#(b(a(b(x1)))) a#(a(x1)) (12)
b#(b(a(b(x1)))) a#(a(a(x1))) (13)
b#(b(a(b(x1)))) a#(a(a(a(x1)))) (14)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.