Certification Problem

Input (TPDB SRS_Standard/Wenzel_16/abaaaaa-aaaaaabaaaab.srs)

The rewrite relation of the following TRS is considered.

a(b(a(a(a(a(a(x1)))))))

→

a(a(a(a(a(a(b(a(a(a(a(b(x1))))))))))))

(1)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by matchbox @ termCOMP 2023)

1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.

a^#(b(a(a(a(a(a(x1)))))))	→	a^#(b(x1))	(2)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(b(a(a(a(a(b(x1)))))))	(3)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(b(x1)))	(4)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(b(a(a(a(a(b(x1))))))))	(5)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(b(x1))))	(6)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(b(a(a(a(a(b(x1)))))))))	(7)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(b(x1)))))	(8)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(b(a(a(a(a(b(x1))))))))))	(9)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(a(b(a(a(a(a(b(x1)))))))))))	(10)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(a(a(b(a(a(a(a(b(x1))))))))))))	(11)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pair

a^#(b(a(a(a(a(a(x1)))))))	→	a^#(b(x1))	(2)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(b(a(a(a(a(b(x1)))))))	(3)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(b(x1)))	(4)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(b(a(a(a(a(b(x1))))))))	(5)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(b(x1))))	(6)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(b(a(a(a(a(b(x1)))))))))	(7)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(b(x1)))))	(8)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(b(a(a(a(a(b(x1))))))))))	(9)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(a(b(a(a(a(a(b(x1)))))))))))	(10)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(a(a(b(a(a(a(a(b(x1))))))))))))	(11)

1.1.1 Reduction Pair Processor with Usable Rules

Using the matrix interpretations of dimension 2 with strict dimension 1 over the arctic semiring over the naturals

[b(x₁)]

0	0
0	0

· x₁ +

-∞

[a(x₁)]

0	0
-2	-2

· x₁ +

-∞

[a^#(x₁)]

1	2
1	2

· x₁ +

-∞

together with the usable rule

a(b(a(a(a(a(a(x1)))))))

→

a(a(a(a(a(a(b(a(a(a(a(b(x1))))))))))))

(1)

(w.r.t. the implicit argument filter of the reduction pair), the pairs

a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(b(x1)))	(4)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(b(a(a(a(a(b(x1))))))))	(5)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(b(x1))))	(6)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(b(a(a(a(a(b(x1)))))))))	(7)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(b(x1)))))	(8)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(b(a(a(a(a(b(x1))))))))))	(9)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(a(b(a(a(a(a(b(x1)))))))))))	(10)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(a(a(a(a(a(b(a(a(a(a(b(x1))))))))))))	(11)

could be deleted.

1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pair

a^#(b(a(a(a(a(a(x1)))))))	→	a^#(b(x1))	(2)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(b(a(a(a(a(b(x1)))))))	(3)

1.1.1.1.1 Reduction Pair Processor with Usable Rules

Using the matrix interpretations of dimension 5 with strict dimension 1 over the arctic semiring over the naturals

[b(x₁)]

0	0	0	0	0
-5	-5	-5	-5	-5
-5	-5	-5	-5	-5
-5	-5	-5	-5	-5
-5	-5	-5	-5	-5

· x₁ +

-∞

[a(x₁)]

0	0	0	5
0	0	0	0
-5	0	0	0
-5	-5	0	0
-5	-5	-5	0

· x₁ +

-∞

[a^#(x₁)]

6	6	6	8	10
6	6	6	8	10
6	6	6	8	10
6	6	6	8	10
6	6	6	8	10

· x₁ +

-∞

together with the usable rule

a(b(a(a(a(a(a(x1)))))))

→

a(a(a(a(a(a(b(a(a(a(a(b(x1))))))))))))

(1)

(w.r.t. the implicit argument filter of the reduction pair), the pairs

a^#(b(a(a(a(a(a(x1)))))))	→	a^#(b(x1))	(2)
a^#(b(a(a(a(a(a(x1)))))))	→	a^#(b(a(a(a(a(b(x1)))))))	(3)

could be deleted.

1.1.1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.