Certificate for #5862 ⟨
a
,
b
,
c
|
ab
=
a
,
bba
=
ca
⟩
Back:
⟨
a
,
b
,
c
|
ab
=
a
,
bba
=
ca
⟩
Completion settings:
Reduction order:
Left-to-right recursive path with deg(
a
) = deg(
b
) = 0,
a
<
b
; deg(
c
) = 1
[1]
ab
=
a
Axiom:
ab
=
a
.
Defines rule
#1
.
[2]
ca
=
bba
Axiom:
bba
=
ca
.
Flip LHS and RHS.
Defines rule
#2
.