YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
p(x) |
→ |
q(x) |
|
p(x) |
→ |
r(x) |
|
q(x) |
→ |
s(p(x)) |
|
r(x) |
→ |
s(p(x)) |
|
s(x) |
→ |
f(p(x)) |
Proof
1 Strongly closed
Confluence is proven since the TRS is strongly closed.
The joins can be performed within 2 step(s).
Tool configuration
ACP