Certificate for #16052 ⟨a, b | aaa=bb, aaba=aa⟩

Completion settings:

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

Axiom: aaa=bb.

Defines rule #4.

Referenced by [3], [4], [5], [7].

Axiom: aaba=aa.

Defines rule #5.

Referenced by [4], [5].

Overlap of [1] aaa=bb with [1] aaa=bb:

Critical pair: abb=bba.

Flip LHS and RHS.

Referenced by [4], [5], [6], [8], [9].

Overlap of [1] aaa=bb with [2] aaba=aa:

Critical pair: aaa=bbba.

Reduce LHS:

Reduce RHS:

Flip LHS and RHS.

Referenced by [6], [8].

Overlap of [2] aaba=aa with [1] aaa=bb:

Critical pair: aabbb=aaaa.

Reduce RHS:

Referenced by [7], [8].

Overlap of [3] bba=abb with [4] babb=bb:

Critical pair: bbb=abbbb.

Flip LHS and RHS.

Referenced by [7], [8].

Overlap of [1] aaa=bb with [6] abbbb=bbb:

Critical pair: aabbb=bbbbbb.

Reduce LHS:

Defines rule #2.

Referenced by [8], [9].

Overlap of [6] abbbb=bbb with [3] bba=abb:

Critical pair: abbabb=bbba.

Reduce LHS:

Reduce RHS:

Defines rule #1.

Simplify [3] bba=abb.

Reduce RHS:

Defines rule #3.