Certificate for #11127 ⟨a, b | aaaaa=b, abbbb=1⟩

Completion settings:

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

[1] b=aaaaa

Axiom: aaaaa=b.

Flip LHS and RHS.

Defines rule #2.

Referenced by [2].

[2] aaaaaaaaaaaaaaaaaaaaa=1

Axiom: abbbb=1.

Reduce LHS:

[1]	a(b)bbb
[1]	⇒ aaaaaa(b)bb
[1]	⇒ aaaaaaaaaaa(b)b
[1]	⇒ aaaaaaaaaaaaaaaa(b)
	⇒ aaaaaaaaaaaaaaaaaaaaa

Defines rule #1.