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