Certificate for #27693 ⟨a, b | aa=1, abbbbb=bab⟩

Completion settings:

Reduction order:
- Left-to-right recursive path with deg(b) = 0; deg(a) = 1

[1] aa=1

Axiom: aa=1.

Defines rule #3.

Referenced by [3].

[2] bab=abbbbb

Axiom: abbbbb=bab.

Flip LHS and RHS.

Defines rule #2.

Referenced by [3].

[3] bbbbbbbbbbbbbbbbbbbbb=bbbbbb

Overlap of [2] bab=abbbbb with [2] bab=abbbbb:

ba b bab

Critical pair: baabbbbb=abbbbbab.

Reduce LHS:

[1]	b(aa)bbbbb
	⇒ bbbbbb

Reduce RHS:

[2]	abbbb(bab)
[2]	⇒ abbb(bab)bbbb
[2]	⇒ abb(bab)bbbbbbbb
[2]	⇒ ab(bab)bbbbbbbbbbbb
[2]	⇒ a(bab)bbbbbbbbbbbbbbbb
[1]	⇒ (aa)bbbbbbbbbbbbbbbbbbbbb
	⇒ bbbbbbbbbbbbbbbbbbbbb

Flip LHS and RHS.

Defines rule #1.