YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

f(g(x)) h(g(x),g(x))
f(s(x)) h(s(x),s(x))
g(x) s(x)

Proof

1 Critical Pair Closing System

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

f(s(x)) h(s(x),s(x))
g(x) s(x)

1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[f(x1)] = 5 · x1 + 4
[s(x1)] = 2 · x1 + 2
[g(x1)] = 4 · x1 + 4
[h(x1, x2)] = 4 · x1 + 1 · x2 + 4
the rule
f(s(x)) h(s(x),s(x))
remains.

1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[f(x1)] = 2 · x1 + 5
[s(x1)] = 1 · x1 + 0
[h(x1, x2)] = 1 · x1 + 1 · x2 + 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