YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

f(g(x)) f(h(x,x))
g(a) g(g(a))
h(a,a) g(g(a))

Proof

1 Critical Pair Closing System

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

h(a,a) g(g(a))

1.1 Rule Removal

Using the linear polynomial interpretation over the naturals
[a] = 2
[g(x1)] = 1 · x1 + 1
[h(x1, x2)] = 1 · x1 + 1 · x2 + 1
all rules could be removed.

1.1.1 R is empty

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

Tool configuration

csi