YES Confluence Proof

Confluence Proof

by csi

Input

The rewrite relation of the following TRS is considered.

a(x) b(x)
a(b(x)) b(a(c(a(x))))
b(x) c(x)
c(c(x)) x

Proof

1 Locally confluent and terminating

Confluence is proven by showing local confluence and termination.

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
a#(x) b#(x)
a#(b(x)) a#(x)
a#(b(x)) c#(a(x))
a#(b(x)) a#(c(a(x)))
a#(b(x)) b#(a(c(a(x))))
b#(x) c#(x)

1.1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

1.2 Local Confluence Proof

All critical pairs are joinable which can be seen by computing normal forms of all critical pairs.

Tool configuration

csi