Certificate for #5737 ⟨
a
,
b
|
aabbaa
=
abbba
⟩
Back:
⟨
a
,
b
|
aabbaa
=
abbba
⟩
Completion settings:
Reduction order:
Left-to-right recursive path with deg(
a
) = 0; deg(
b
) = 1
[1]
abbba
=
aabbaa
Axiom:
aabbaa
=
abbba
.
Flip LHS and RHS.
Defines rule
#1
.