YES
Confluence Proof
Confluence Proof
by ACP
Input
The rewrite relation of the following TRS is considered.
|
max(x,0) |
→ |
x |
|
max(0,y) |
→ |
y |
|
max(s(x),s(y)) |
→ |
s(max(y,x)) |
|
max(x,y) |
→ |
max(y,x) |
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