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