YES
Confluence Proof
Confluence Proof
by ACP
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 Strongly closed
Confluence is proven since the TRS is strongly closed.
The joins can be performed within 3 step(s).
Tool configuration
ACP