Add some 'not tested' marks to avoid CI failure

Author: user202729

src/sage/knots/link.py

@@ -3043,7 +3043,7 @@ def homfly_polynomial(self, var1=None, var2=None, normalization='lm'):
             sage: # needs sage.libs.homfly
             sage: L = Link([[[1, -1], [2, -2]], [1, 1]])
             sage: L2 = Link([[1, 4, 2, 3], [2, 4, 1, 3]])
-            sage: L2.homfly_polynomial()
+            sage: L2.homfly_polynomial()  # not tested (:issue:`39544`)
             -L*M^-1 - L^-1*M^-1
             sage: L.homfly_polynomial()
             -L*M^-1 - L^-1*M^-1

src/sage/rings/polynomial/symmetric_ideal.py

@@ -915,7 +915,7 @@ def groebner_basis(self, tailreduce=False, reduced=True, algorithm=None, report=
             ....:      'y_0*z_0 + 2*z_0^2 - 2*z_0 - 1',
             ....:      'y_0^2 + 2*y_0*z_0 - 2*z_0^2 + 2*z_0 - 2',
             ....:      '-y_0^2 - 2*y_0*z_0 - z_0^2 + y_0 - 1'] * X
-            sage: I.groebner_basis()                                                    # needs sage.combinat
+            sage: I.groebner_basis()   # not tested (:issue:`39537`)                    # needs sage.combinat
             [1]
 
             sage: Y.<x,y> = InfinitePolynomialRing(GF(3), order='degrevlex',

src/sage/rings/semirings/tropical_variety.py

@@ -590,7 +590,7 @@ def weight_vectors(self):
             sage: R.<a,b,c,d> = PolynomialRing(T)
             sage: f = R.random_element()
             sage: vec = f.tropical_variety().weight_vectors()[2].values()
-            sage: all(a == vector([0,0,0,0]) for a in [sum(lst) for lst in vec])
+            sage: all(a == vector([0,0,0,0]) for a in [sum(lst) for lst in vec])  # not tested (:issue:`39663`)
             True
         """
         from itertools import combinations

src/sage/schemes/elliptic_curves/ell_point.py

@@ -272,8 +272,8 @@ def _add_(self, other):
             ....:     if xs:
             ....:         pts.append(E(choice(xs), y, z))
             sage: P, Q = pts
-            sage: R = P + Q
-            sage: for d in N.divisors():
+            sage: R = P + Q  # not tested (:issue:`39191`)
+            sage: for d in N.divisors():  # not tested (:issue:`39191`)
             ....:     if d > 1:
             ....:         assert R.change_ring(Zmod(d)) == P.change_ring(Zmod(d)) + Q.change_ring(Zmod(d))
         """