Certificate for #26601 ⟨a, b | aa=1, ababbbbb=b⟩

Completion settings:

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

Axiom: aa=1.

Defines rule #3.

Referenced by [3], [8], [9].

Axiom: ababbbbb=b.

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

Overlap of [1] aa=1 with [2] ababbbbb=b:

Critical pair: ab=babbbbb.

Flip LHS and RHS.

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

Overlap of [3] babbbbb=ab with [3] babbbbb=ab:

Critical pair: babbbbab=ababbbbb.

Reduce RHS:

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

Overlap of [4] babbbbab=b with [3] babbbbb=ab:

Critical pair: babbbab=bbbbb.

Referenced by [7].

Overlap of [4] babbbbab=b with [4] babbbbab=b:

Critical pair: babbbb=bbbbab.

Flip LHS and RHS.

Referenced by [7], [8], [11].

Overlap of [2] ababbbbb=b with [6] bbbbab=babbbb:

Critical pair: ababbbabbbb=bbab.

Reduce LHS:

Flip LHS and RHS.

Referenced by [8], [9], [11].

Overlap of [3] babbbbb=ab with [6] bbbbab=babbbb:

Critical pair: babbabbbb=abab.

Reduce LHS:

Flip LHS and RHS.

Referenced by [11].

Overlap of [2] ababbbbb=b with [7] bbab=abbbbbbbb:

Critical pair: ababbbabbbbbbbb=bab.

Reduce LHS:

Flip LHS and RHS.

Defines rule #2.

Referenced by [10], [11].

Overlap of [3] babbbbb=ab with [9] bab=abbbbbbbbbbbb:

Critical pair: abbbbbbbbbbbbbbbb=ab.

Referenced by [11].

Overlap of [4] babbbbab=b with [9] bab=abbbbbbbbbbbb:

Critical pair: abbbbbbbbbbbbbbbab=b.

Reduce LHS:

Defines rule #1.