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