YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

f(g(g(x))) a
f(g(h(x))) b
f(h(g(x))) b
f(h(h(x))) c
g(x) h(x)
a b
b c

Proof

1 Critical Pair Closing System

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

f(h(g(x))) b
a b
f(g(h(x))) b
f(h(h(x))) c
b c

1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[b] = 4
[f(x1)] = 1 · x1 + 1
[h(x1)] = 2 · x1 + 4
[c] = 0
[g(x1)] = 2 · x1 + 6
[a] = 4
the rule
a b
remains.

1.1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[b] = 0
[a] = 1
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