Certificate for #19634 ⟨a, b | aba=a, aaaaa=bb⟩

Completion settings:

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

Axiom: aba=a.

Defines rule #4.

Referenced by [3], [4].

Axiom: aaaaa=bb.

Defines rule #5.

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

Overlap of [1] aba=a with [2] aaaaa=bb:

Critical pair: abbb=aaaaa.

Reduce RHS:

Referenced by [6], [11], [12].

Overlap of [2] aaaaa=bb with [1] aba=a:

Critical pair: aaaaa=bbba.

Reduce LHS:

Flip LHS and RHS.

Referenced by [7].

Overlap of [2] aaaaa=bb with [2] aaaaa=bb:

Critical pair: abb=bba.

Flip LHS and RHS.

Referenced by [7], [8], [9], [10], [11], [13].

Overlap of [2] aaaaa=bb with [3] abbb=bb:

Critical pair: aaaabb=bbbbb.

Referenced by [10].

Simplify [4] bbba=bb.

Reduce LHS:

Referenced by [8].

Overlap of [7] babb=bb with [5] bba=abb:

Critical pair: baabb=bba.

Reduce RHS:

Referenced by [9].

Overlap of [8] baabb=abb with [5] bba=abb:

Critical pair: baaabb=abba.

Reduce RHS:

Referenced by [10].

Overlap of [9] baaabb=aabb with [5] bba=abb:

Critical pair: baaaabb=aabba.

Reduce LHS:

Reduce RHS:

Flip LHS and RHS.

Referenced by [11].

Overlap of [5] bba=abb with [10] aaabb=bbbbbb:

Critical pair: bbbbbbbb=abbaabb.

Reduce RHS:

Flip LHS and RHS.

Defines rule #2.

Referenced by [12], [13].

Overlap of [3] abbb=bb with [11] abb=bbbbbbbb:

Critical pair: bbbbbbbbb=bb.

Defines rule #1.

Simplify [5] bba=abb.

Reduce RHS:

Defines rule #3.