YES
Confluence Proof
Confluence Proof
by Hakusan
Input
The rewrite relation of the following TRS is considered.
|
a(a(b(a(b(a(b(a(b(x))))))))) |
→ |
a(b(a(b(a(b(a(b(a(a(a(a(a(b(x)))))))))))))) |
Proof
1 Compositional Rule Labeling with Parallel Critical Pairs
Confluence is proven by compositional rule labeling with parallel critical pairs.
The following labeling functions phi and psi are used (if only one is displayed, then phi = psi).
-
a(a(b(a(b(a(b(a(b(x)))))))))→a(b(a(b(a(b(a(b(a(a(a(a(a(b(x)))))))))))))) ↦ 1
The non-0-0 parallel critical pairs are joined as follows.
-
The parallel-phi-root-psi critical pairs can be joined as follows. Here,
↔ is always chosen as an appropriate rewrite relation which
is automatically inferred by the certifier.
The remaining rules are handled recursively.
There are no rules.
1.1 (Weakly) Orthogonal
Confluence is proven since the TRS is (weakly) orthogonal.
Tool configuration
Hakusan