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