Certification Problem

Input (TPDB TRS_Standard/SK90/4.35)

The rewrite relation of the following TRS is considered.

a(b(x)) → a(c(b(x))) (1)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

1 String Reversal

Since only unary symbols occur, one can reverse all terms and obtains the TRS
b(a(x)) → b(c(a(x))) (2)

1.1 Rule Removal

Using the linear polynomial interpretation over (3 x 3)-matrices with strict dimension 1 over the naturals
[a(x1)] =
1 1 0
0 0 1
0 1 1
· x1 +
1 0 0
1 0 0
1 0 0
[b(x1)] =
1 1 1
0 1 0
0 0 0
· x1 +
0 0 0
0 0 0
0 0 0
[c(x1)] =
1 0 1
0 0 0
0 0 0
· x1 +
0 0 0
0 0 0
0 0 0
all of the following rules can be deleted.
b(a(x)) → b(c(a(x))) (2)

1.1.1 R is empty

There are no rules in the TRS. Hence, it is terminating.