YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a(s(x)) s(a(x))
b(a(b(s(x)))) a(b(s(a(x))))
b(a(b(b(x)))) a(b(a(b(x))))
a(b(a(a(x)))) b(a(b(a(x))))

Proof

1 Critical Pair Closing System

Confluence is proven using the following terminating critical-pair-closing-system R:

a(s(x)) s(a(x))
b(a(b(s(x)))) a(b(s(a(x))))
a(b(a(a(x)))) b(a(b(a(x))))
b(a(b(b(x)))) a(b(a(b(x))))

1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[a(x1)] = 2 · x1 + 0
[s(x1)] = 2 · x1 + 1
[b(x1)] = 2 · x1 + 0
the rules
a(b(a(a(x)))) b(a(b(a(x))))
b(a(b(b(x)))) a(b(a(b(x))))
remain.

1.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
1 0 0
1 0 0
· x1 +
0 0 0
1 0 0
0 0 0
[b(x1)] =
1 0 1
1 0 0
1 0 0
· x1 +
0 0 0
0 0 0
1 0 0
all rules could be removed.

1.1.1.1 R is empty

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

Tool configuration

csi