Certification Problem

Input (TPDB TRS_Standard/AG01/#3.54)

The rewrite relation of the following TRS is considered.

f(g(x)) → g(f(f(x))) (1)
f(h(x)) → h(g(x)) (2)
f'(s(x),y,y) → f'(y,x,s(x)) (3)

Property / Task

Prove or disprove termination.

Answer / Result

Yes.

Proof (by ttt2 @ termCOMP 2023)

1 Rule Removal

Using the linear polynomial interpretation over (3 x 3)-matrices with strict dimension 1 over the naturals
[f'(x1, x2, x3)] =
1 1 1
0 0 1
0 0 0
· x1 +
1 1 0
0 1 1
0 0 0
· x2 +
1 0 1
1 0 0
0 0 0
· x3 +
0 0 0
0 0 0
0 0 0
[f(x1)] =
1 0 0
0 0 1
0 0 1
· x1 +
0 0 0
0 0 0
0 0 0
[s(x1)] =
1 0 0
1 1 0
1 1 1
· x1 +
0 0 0
1 0 0
0 0 0
[g(x1)] =
1 0 0
0 0 0
0 0 1
· x1 +
0 0 0
1 0 0
1 0 0
[h(x1)] =
1 0 0
0 0 0
1 0 0
· x1 +
1 0 0
0 0 0
0 0 0
all of the following rules can be deleted.
f'(s(x),y,y) → f'(y,x,s(x)) (3)

1.1 Rule Removal

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

1.1.1 Rule Removal

Using the Knuth Bendix order with w0 = 1 and the following precedence and weight functions
prec(f) = 1 weight(f) = 0
prec(g) = 0 weight(g) = 2
all of the following rules can be deleted.
f(g(x)) → g(f(f(x))) (1)

1.1.1.1 R is empty

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