YES Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

a(b(a(b(a(a(a(x0)))))))

→

a(a(a(a(b(a(b(a(b(x0)))))))))

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

Using the linear polynomial interpretation over (4 x 4)-matrices with strict dimension 1 over the naturals

[b(x₁)]

· x₁ +

[a(x₁)]

· x₁ +

[a^#(x₁)]

· x₁ +

all pairs could be removed.

There are no pairs anymore.