The algorithm used applies the criteria for a-priori detection of zero-reductions immediately before computation of the S-polynomial and keeps the pair set ordered s.t. ``lower pairs'' (w.r.t. the ordering chosen in gb.po.setup) are considered for S-polynomial computation first.