The algortihms that Groebner[Basis] uses at each step computes some "tentative" or "pseudo-basis". The "tentative" basis is not a Groebner basis but it is in the ideal generated by the original system of polynomial eq.
1) Is this correct ? Provided this is correct, then
2) How can one retrive the last "tentative" basis?
If I just use timelimit I can abort the computations but how can one retrive the last computation?