YES
Confluence Proof
Confluence Proof
by Hakusan
Input
The rewrite relation of the following TRS is considered.
|
a(x) |
→ |
x |
|
a(a(x)) |
→ |
b(c(x)) |
|
b(x) |
→ |
x |
|
c(x) |
→ |
x |
|
c(b(x)) |
→ |
b(a(c(x))) |
Proof
1 Compositional Parallel Critical Pair Systems
All parallel critical pairs of the TRS R are joinable by R.
This can be seen as follows:
The parallel critical pairs can be joined as follows. Here,
↔ is always chosen as an appropriate rewrite relation which
is automatically inferred by the certifier.
-
The critical peak s = b(c(x0_1)) {ε}←a(a(x0_1))→ε a(x0_1) = t can be joined as follows.
s
↔ c(x0_1) ↔ x0_1 ↔
t
-
The critical peak s = a(y1) {ε}←a(a(y1))→ε b(c(y1)) = t can be joined as follows.
s
↔ y1 ↔ c(y1) ↔
t
-
The critical peak s = a(y1) {1}←a(a(y1))→ε b(c(y1)) = t can be joined as follows.
s
↔ y1 ↔ c(y1) ↔
t
-
The critical peak s = a(b(c(x1_1))) {1}←a(a(a(x1_1)))→ε b(c(a(x1_1))) = t can be joined as follows.
s
↔ b(c(x1_1)) ↔
t
-
The critical peak s = b(a(c(x0_1))) {ε}←c(b(x0_1))→ε b(x0_1) = t can be joined as follows.
s
↔ b(c(x0_1)) ↔
t
-
The critical peak s = b(y1) {ε}←c(b(y1))→ε b(a(c(y1))) = t can be joined as follows.
s
↔ b(c(y1)) ↔
t
-
The critical peak s = c(y1) {1}←c(b(y1))→ε b(a(c(y1))) = t can be joined as follows.
s
↔ a(c(y1)) ↔
t
The TRS C is chosen as:
|
a(x) |
→ |
x |
|
b(x) |
→ |
x |
|
c(x) |
→ |
x |
Consequently, PCPS(R,C) is included in the following TRS P where
steps are used to show that certain pairs are C-convertible.
There are no rules.
Relative termination of P / R is proven as follows.
1.1 R is empty
There are no rules in the TRS R. Hence, R/S is relative terminating.
Confluence of C is proven as follows.
1.2 Compositional Parallel Critical Pair Systems
All parallel critical pairs of the TRS R are joinable by R.
This can be seen as follows:
The parallel critical pairs can be joined as follows. Here,
↔ is always chosen as an appropriate rewrite relation which
is automatically inferred by the certifier.
The TRS C is chosen as:
There are no rules.
Consequently, PCPS(R,C) is included in the following TRS P where
steps are used to show that certain pairs are C-convertible.
There are no rules.
Relative termination of P / R is proven as follows.
1.2.1 R is empty
There are no rules in the TRS R. Hence, R/S is relative terminating.
Confluence of C is proven as follows.
1.2.2 (Weakly) Orthogonal
Confluence is proven since the TRS is (weakly) orthogonal.
Tool configuration
Hakusan