This system was solved in May 2020, using solveSystem in Macaulay2 v1.15 with an Intel(R) Core(TM) i5-4258U CPU at 2.40GHz.
There were 8 solutions found in 10.1037 seconds (with a Bezout bound of 1024).
Reference: P. Van Hentenryck, D. McAllester and D. Kapur: "Solving Polynomial Systems Using a Branch and Prune Approach" SIAM J. Numerical Analysis, Vol. 34, No. 2, pp 797-827, 1997.
See also: post to sci.math.num-analysis by Sjirk Boon
See also: http://homepages.math.uic.edu/~jan/Demo/boon.html
i1 : boon(QQ) 2 2 2 2 3 3 6 3 3 6 2 o1 = {s + g - 1, s + g - 1, g C + g C - -, s C + s C - -, s g C + 1 1 2 2 1 1 2 2 5 1 1 2 2 5 1 1 1 ------------------------------------------------------------------------ 2 7 2 2 7 s g C - --, s g C + s g C - --} 2 2 2 10 1 1 1 2 2 2 10 o1 : List |
The object boon is a method function.