YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

Since only unary symbols occur, one can reverse all terms and obtains the TRS

The following set of initial dependency pairs has been identified.

The dependency pairs are split into 1 component.

The 1^st component contains the pairs

b^#(a(x0))	→	b^#(b(x0))
b^#(a(x0))	→	b^#(x0)

Using the linear polynomial interpretation over (2 x 2)-matrices with strict dimension 1 over the arctic semiring over the integers

[b^#(x₁)]

0	2
-∞	-∞

· x₁ +

-∞	-∞
-∞	-∞

[b(x₁)]

0	1
-∞	0

· x₁ +

-∞	-∞
-∞	-∞

[a(x₁)]

0	0
0	1

· x₁ +

-∞	-∞
-∞	-∞

[c(x₁)]

0	0
0	-∞

· x₁ +

-∞	-∞
-∞	-∞

together with the usable rules

(w.r.t. the implicit argument filter of the reduction pair), all pairs could be removed.

There are no pairs anymore.