Reformat experiments - #31

Process completed with exit code 1.

Failed example:: Got: False

Failed example:: Got: (['@richcmp_method\n', 'class MPolynomialIdeal(MPolynomialIdeal_singular_repr, MPolynomialIdeal_macaulay2_repr, MPolynomialIdeal_magma_repr, Ideal_generic):\n', ' def __init__(self, ring, gens, coerce=True):\n', ' r"""\n', ' Create an ideal in a multivariate polynomial ring.\n', '\n', ' INPUT:\n', '\n', ' - ``ring`` -- the ring the ideal is defined in\n', '\n', ' - ``gens`` -- list of generators for the ideal\n', '\n', ' - ``coerce`` -- whether to coerce elements to the ring ``ring``\n', '\n', ' EXAMPLES::\n', '\n', " sage: R.<x,y> = PolynomialRing(IntegerRing(), 2, order='lex')\n", ' sage: R.ideal([x, y])\n', ' Ideal (x, y) of Multivariate Polynomial Ring in x, y over Integer Ring\n', ' sage: R.<x0,x1> = GF(3)[]\n', ' sage: R.ideal([x0^2, x1^3])\n', ' Ideal (x0^2, x1^3) of Multivariate Polynomial Ring in x0, x1 over Finite Field of size 3\n', ' """\n', ' Ideal_generic.__init__(self, ring, gens, coerce=coerce)\n', ' self._gb_by_ordering = dict()\n', '\n', ' def __hash__(self):\n', ' r"""\n', ' Stupid constant hash function.\n', '\n', ' TESTS::\n', '\n', " sage: R.<x,y> = PolynomialRing(IntegerRing(), 2, order='lex')\n", ' sage: hash(R.ideal([x, y]))\n', ' 0\n', ' """\n', ' return 0\n', '\n', ' @cached_method\n', ' def gens(self) -> Sequence_generic:\n', ' """\n', ' Return a set of generators / a basis of this ideal.\n', '\n', ' This is usually the set of generators provided during object\n', ' creation.\n', '\n', ' EXAMPLES::\n', '\n', ' sage: P.<x,y> = PolynomialRing(QQ,2)\n', ' sage: I = Ideal([x, y + 1]); I\n', ' Ideal (x, y + 1) of Multivariate Polynomial Ring in x, y over Rational Field\n', ' sage: I.gens()\n', ' [x, y + 1]\n', ' """\n', ' from sage.rings.polynomial.multi_polynomial_sequence import PolynomialSequence\n', '\n', ' return PolynomialSequence(self.ring(), Ideal_generic.gens(self), immutable=True)\n', '\n', ' @Property\n', ' def basis(self):\n', ' """\n', ' Shortcut to ``gens()``.\n', '\n', ' EXAMPLES::\n', '\n', ' sage: P.<x,y> = PolynomialRing(QQ,2)\n', ' sage: I = Ideal([x, y + 1])\n', ' sage: I.basis\n', ' [x, y + 1]\n', ' """\n', ' return self.gens()\n', '\n', ' def __richcmp__(self, other, op):\n', ' """\n', ' Compare ``self`` and ``other``.\n', '\n', ' INPUT:\n', '\n', ' - ``other`` -- a polynomial ideal\n', '\n', ' OUTPUT: boolean\n', '\n', ' ALGORITHM:\n', '\n', ' Comparison for ``==`` and ``!=`` compares two Groebner bases.\n', '\n', ' Comparison for ``<=`` and ``>=`` tests the inclusion of ideals\n', ' using the usual ideal membership test, namely all generators\n', " of one ideal must reduce to zero in the other ideal's Groebner\n", ' basis.\n', '\n', ' Comparison for ``<`` and ``>`` tests for inclusion and different\n', ' Groebner bases.\n', '\n', ' EXAMPLES::\n', '\n', ' sage: R.<x,y> = ZZ[]; I = R*[x^2 + y, 2*y]; J = R*[x^2 + y]\n', ' sage: I > J\n', ' True\n', ' sage: J < I\n', ' True\n', ' sage: I == I\n', ' True\n', '\n', ' ::\n', '\n', ' sage: R.<x,y> = GF(32003)[]\n', ' sage: I = R*[x^2 + x, y]\n', ' sage: J = R*[x + 1, y]\n', ' sage: J < I\n', ' False\n', ' sage: I < J\n', ' True\n', '\n', ' ::\n', '\n', ' sage: R.<x,y> = GF(32003)[]\n', ' sage: I = R*[x^2 + x, y]\n', ' sage: J = R*[x + 1, y]\n', ' sage: J > I\n', ' True\n', ' sage: I > J\n', ' False\n', '\n', ' ::\n', '\n', " sage: R = PolynomialRing(QQ,'x,y,z

Failed example:: Got: (['@richcmp_method\n', 'class MPolynomialIdeal(MPolynomialIdeal_singular_repr, MPolynomialIdeal_macaulay2_repr, MPolynomialIdeal_magma_repr, Ideal_generic):\n', ' def __init__(self, ring, gens, coerce=True):\n', ' r"""\n', ' Create an ideal in a multivariate polynomial ring.\n', '\n', ' INPUT:\n', '\n', ' - ``ring`` -- the ring the ideal is defined in\n', '\n', ' - ``gens`` -- list of generators for the ideal\n', '\n', ' - ``coerce`` -- whether to coerce elements to the ring ``ring``\n', '\n', ' EXAMPLES::\n', '\n', " sage: R.<x,y> = PolynomialRing(IntegerRing(), 2, order='lex')\n", ' sage: R.ideal([x, y])\n', ' Ideal (x, y) of Multivariate Polynomial Ring in x, y over Integer Ring\n', ' sage: R.<x0,x1> = GF(3)[]\n', ' sage: R.ideal([x0^2, x1^3])\n', ' Ideal (x0^2, x1^3) of Multivariate Polynomial Ring in x0, x1 over Finite Field of size 3\n', ' """\n', ' Ideal_generic.__init__(self, ring, gens, coerce=coerce)\n', ' self._gb_by_ordering = dict()\n', '\n', ' def __hash__(self):\n', ' r"""\n', ' Stupid constant hash function.\n', '\n', ' TESTS::\n', '\n', " sage: R.<x,y> = PolynomialRing(IntegerRing(), 2, order='lex')\n", ' sage: hash(R.ideal([x, y]))\n', ' 0\n', ' """\n', ' return 0\n', '\n', ' @cached_method\n', ' def gens(self) -> Sequence_generic:\n', ' """\n', ' Return a set of generators / a basis of this ideal.\n', '\n', ' This is usually the set of generators provided during object\n', ' creation.\n', '\n', ' EXAMPLES::\n', '\n', ' sage: P.<x,y> = PolynomialRing(QQ,2)\n', ' sage: I = Ideal([x, y + 1]); I\n', ' Ideal (x, y + 1) of Multivariate Polynomial Ring in x, y over Rational Field\n', ' sage: I.gens()\n', ' [x, y + 1]\n', ' """\n', ' from sage.rings.polynomial.multi_polynomial_sequence import PolynomialSequence\n', '\n', ' return PolynomialSequence(self.ring(), Ideal_generic.gens(self), immutable=True)\n', '\n', ' @Property\n', ' def basis(self):\n', ' """\n', ' Shortcut to ``gens()``.\n', '\n', ' EXAMPLES::\n', '\n', ' sage: P.<x,y> = PolynomialRing(QQ,2)\n', ' sage: I = Ideal([x, y + 1])\n', ' sage: I.basis\n', ' [x, y + 1]\n', ' """\n', ' return self.gens()\n', '\n', ' def __richcmp__(self, other, op):\n', ' """\n', ' Compare ``self`` and ``other``.\n', '\n', ' INPUT:\n', '\n', ' - ``other`` -- a polynomial ideal\n', '\n', ' OUTPUT: boolean\n', '\n', ' ALGORITHM:\n', '\n', ' Comparison for ``==`` and ``!=`` compares two Groebner bases.\n', '\n', ' Comparison for ``<=`` and ``>=`` tests the inclusion of ideals\n', ' using the usual ideal membership test, namely all generators\n', " of one ideal must reduce to zero in the other ideal's Groebner\n", ' basis.\n', '\n', ' Comparison for ``<`` and ``>`` tests for inclusion and different\n', ' Groebner bases.\n', '\n', ' EXAMPLES::\n', '\n', ' sage: R.<x,y> = ZZ[]; I = R*[x^2 + y, 2*y]; J = R*[x^2 + y]\n', ' sage: I > J\n', ' True\n', ' sage: J < I\n', ' True\n', ' sage: I == I\n', ' True\n', '\n', ' ::\n', '\n', ' sage: R.<x,y> = GF(32003)[]\n', ' sage: I = R*[x^2 + x, y]\n', ' sage: J = R*[x + 1, y]\n', ' sage: J < I\n', ' False\n', ' sage: I < J\n', ' True\n', '\n', ' ::\n', '\n', ' sage: R.<x,y> = GF(32003)[]\n', ' sage: I = R*[x^2 + x, y]\n', ' sage: J = R*[x + 1, y]\n', ' sage: J > I\n', ' True\n', ' sage: I > J\n', ' False\n', '\n', ' ::\n', '\n', " sage: R = PolynomialRing(QQ,'x,y,z

Failed example:: Got: (['def base(x):\n', ' """\n', ' Test function to make sure\n', ' :func:`~sage.misc.sageinspect.sage_getsourcelines` can get\n', ' the code of a function created by ``functools.partial``.\n', '\n', ' EXAMPLES::\n', '\n', ' sage: from sage.tests.functools_partial_src import base, test_func\n', ' sage: base(3)\n', ' 21\n', ' sage: test_func()\n', ' 42\n', ' """\n', ' x = x * 7\n', ' return x\n'], 9)

Failed example:: Got: 95

Node.js 20 actions are deprecated. The following actions are running on Node.js 20 and may not work as expected: actions/checkout@v4, actions/upload-artifact@v4, docker/build-push-action@v6, docker/setup-buildx-action@v3. Actions will be forced to run with Node.js 24 by default starting June 2nd, 2026. Node.js 20 will be removed from the runner on September 16th, 2026. Please check if updated versions of these actions are available that support Node.js 24. To opt into Node.js 24 now, set the FORCE_JAVASCRIPT_ACTIONS_TO_NODE24=true environment variable on the runner or in your workflow file. Once Node.js 24 becomes the default, you can temporarily opt out by setting ACTIONS_ALLOW_USE_UNSECURE_NODE_VERSION=true. For more information see: https://github.blog/changelog/2025-09-19-deprecation-of-node-20-on-github-actions-runners/

Variable 'OL' referenced here was set only in doctest marked '# needs sage.rings.number_field'

Variable 'OL' referenced here was set only in doctest marked '# needs sage.rings.number_field'

Variable 'OL' referenced here was set only in doctest marked '# needs sage.rings.number_field'

Variable 'OL' referenced here was set only in doctest marked '# needs sage.rings.number_field'

slow doctest:: Test ran for 55.25s cpu, 54.99s wall Check ran for 0.00s cpu, 0.00s wall

slow doctest:: Test ran for 239.79s cpu, 242.20s wall Check ran for 0.00s cpu, 0.00s wall

slow doctest:: Test ran for 46.91s cpu, 47.17s wall Check ran for 0.00s cpu, 0.00s wall

slow doctest:: Test ran for 35.69s cpu, 36.14s wall Check ran for 0.00s cpu, 0.00s wall

slow doctest:: Test ran for 163.36s cpu, 164.88s wall Check ran for 0.00s cpu, 0.00s wall