
102 Algebraic Operads: An Algorithmic Companion
<
<
−
<
<
−
>
<
,
<
>
+
>
>
−
>
>
.
Let us consider the ordering of the generators given by
<
≺
>
,
and the induced pathdeglex ordering of tree monomials. For this ordering,
the leading terms of the relations are
<
<
,
>
<
,
>
>
,
respectively. There are four small common multiples,
<
<
<
,
>
<
<
,
>
>
<
,
>
>
>
,
and the corresponding S-polynomials are
M
1
=
<
<
<
+
>
<
<
−
< <
<
−
< >
<
,
M
2
=
<
>
<
−
> <
<
−
> >
<
,