Certification Problem

Input (TPDB SRS_Standard/Waldmann_07_size11/size-11-alpha-2-num-3)

The rewrite relation of the following TRS is considered.

a(x1) → b(x1) (1)
b(a(a(b(x1)))) → a(a(b(b(a(x1))))) (2)

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#(x1) → b#(x1) (3)
b#(a(a(b(x1)))) → a#(x1) (4)
b#(a(a(b(x1)))) → b#(a(x1)) (5)
b#(a(a(b(x1)))) → b#(b(a(x1))) (6)
b#(a(a(b(x1)))) → a#(b(b(a(x1)))) (7)
b#(a(a(b(x1)))) → a#(a(b(b(a(x1))))) (8)

1.1 Reduction Pair Processor with Usable Rules

Using the linear polynomial interpretation over (3 x 3)-matrices with strict dimension 1 over the arctic semiring over the integers
[b(x1)] =
-∞ 0 0
-∞ -∞ 0
-∞ -∞ 0
· x1 +
0 -∞ -∞
-∞ -∞ -∞
-∞ -∞ -∞
[b#(x1)] =
-∞ -∞ 0
-∞ -∞ -∞
-∞ -∞ -∞
· x1 +
0 -∞ -∞
-∞ -∞ -∞
-∞ -∞ -∞
[a(x1)] =
0 0 0
1 0 0
-∞ 0 0
· x1 +
0 -∞ -∞
1 -∞ -∞
-∞ -∞ -∞
[a#(x1)] =
-∞ 0 0
-∞ -∞ -∞
-∞ -∞ -∞
· x1 +
0 -∞ -∞
-∞ -∞ -∞
-∞ -∞ -∞
together with the usable rules
a(x1) → b(x1) (1)
b(a(a(b(x1)))) → a(a(b(b(a(x1))))) (2)
(w.r.t. the implicit argument filter of the reduction pair), the pairs
b#(a(a(b(x1)))) → a#(x1) (4)
b#(a(a(b(x1)))) → b#(a(x1)) (5)
b#(a(a(b(x1)))) → b#(b(a(x1))) (6)
b#(a(a(b(x1)))) → a#(b(b(a(x1)))) (7)
could be deleted.

1.1.1 Reduction Pair Processor with Usable Rules

Using the linear polynomial interpretation over (3 x 3)-matrices with strict dimension 1 over the arctic semiring over the integers
[b(x1)] =
-∞ 0 0
-∞ -∞ 0
-∞ -∞ 0
· x1 +
0 -∞ -∞
0 -∞ -∞
0 -∞ -∞
[b#(x1)] =
-∞ -∞ 0
-∞ -∞ -∞
-∞ -∞ -∞
· x1 +
0 -∞ -∞
-∞ -∞ -∞
-∞ -∞ -∞
[a(x1)] =
-∞ 0 0
1 -∞ 0
-∞ 0 0
· x1 +
0 -∞ -∞
0 -∞ -∞
0 -∞ -∞
[a#(x1)] =
0 -∞ 0
-∞ -∞ -∞
-∞ -∞ -∞
· x1 +
0 -∞ -∞
-∞ -∞ -∞
-∞ -∞ -∞
together with the usable rules
a(x1) → b(x1) (1)
b(a(a(b(x1)))) → a(a(b(b(a(x1))))) (2)
(w.r.t. the implicit argument filter of the reduction pair), the pair
b#(a(a(b(x1)))) → a#(a(b(b(a(x1))))) (8)
could be deleted.

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.