Certification Problem

Input (TPDB SRS_Standard/Waldmann_19/random-472)

The rewrite relation of the following TRS is considered.

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

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(a(a(x1)))) b#(b(a(x1))) (5)
b#(b(b(a(x1)))) a#(b(x1)) (6)
b#(a(b(a(x1)))) b#(x1) (7)
b#(a(a(a(x1)))) b#(a(a(x1))) (8)
b#(a(b(a(x1)))) a#(b(b(x1))) (9)
b#(a(b(a(x1)))) b#(b(x1)) (10)
b#(b(b(a(x1)))) b#(x1) (11)
b#(a(b(a(x1)))) b#(a(b(b(x1)))) (12)
b#(b(b(a(x1)))) b#(a(b(x1))) (13)
a#(b(a(a(x1)))) b#(a(x1)) (14)
a#(b(a(a(x1)))) a#(b(b(a(x1)))) (15)
b#(a(a(a(x1)))) a#(b(a(a(x1)))) (16)
b#(b(b(a(x1)))) b#(b(a(b(x1)))) (17)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.