Package evaluation to test RationalFunctionFields on Julia 1.14.0-DEV.1621 (4d04bb6b3b*) started at 2026-01-27T22:56:51.907 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.14` Set-up completed after 10.4s ################################################################################ # Installation # Installing RationalFunctionFields... Resolving package versions... Updating `~/.julia/environments/v1.14/Project.toml` [73480bc8] + RationalFunctionFields v0.3.0 Updating `~/.julia/environments/v1.14/Manifest.toml` ⌅ [c3fe647b] + AbstractAlgebra v0.47.6 [a9b6321e] + Atomix v1.1.2 [861a8166] + Combinatorics v1.1.0 [e2ba6199] + ExprTools v0.1.10 [0b43b601] + Groebner v0.10.2 [18e54dd8] + IntegerMathUtils v0.1.3 [692b3bcd] + JLLWrappers v1.7.1 [1914dd2f] + MacroTools v0.5.16 ⌅ [2edaba10] + Nemo v0.52.4 [3e851597] + ParamPunPam v0.5.7 [aea7be01] + PrecompileTools v1.3.3 [21216c6a] + Preferences v1.5.1 [27ebfcd6] + Primes v0.5.7 [92933f4c] + ProgressMeter v1.11.0 [fb686558] + RandomExtensions v0.4.4 [73480bc8] + RationalFunctionFields v0.3.0 [a759f4b9] + TimerOutputs v0.5.29 [013be700] + UnsafeAtomics v0.3.0 ⌅ [e134572f] + FLINT_jll v301.300.102+0 [656ef2d0] + OpenBLAS32_jll v0.3.30+0 [56f22d72] + Artifacts v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.13.0 [56ddb016] + Logging v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v1.0.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.13.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.3.0+1 [781609d7] + GMP_jll v6.3.0+2 [3a97d323] + MPFR_jll v4.2.2+0 [4536629a] + OpenBLAS_jll v0.3.30+0 [bea87d4a] + SuiteSparse_jll v7.10.1+0 [8e850b90] + libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. To see why use `status --outdated -m` Installation completed after 4.99s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling packages... 26531.2 ms ✓ Nemo 131404.0 ms ✓ Groebner 8464.9 ms ✓ ParamPunPam 10977.4 ms ✓ RationalFunctionFields 4 dependencies successfully precompiled in 178 seconds. 36 already precompiled. Precompilation completed after 196.53s ################################################################################ # Testing # Testing RationalFunctionFields Status `/tmp/jl_TL1P0k/Project.toml` ⌅ [c3fe647b] AbstractAlgebra v0.47.6 [861a8166] Combinatorics v1.1.0 [0b43b601] Groebner v0.10.2 ⌅ [2edaba10] Nemo v0.52.4 [3e851597] ParamPunPam v0.5.7 [73480bc8] RationalFunctionFields v0.3.0 [98d24dd4] TestSetExtensions v3.0.0 [a759f4b9] TimerOutputs v0.5.29 [37e2e46d] LinearAlgebra v1.13.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_TL1P0k/Manifest.toml` ⌅ [c3fe647b] AbstractAlgebra v0.47.6 [a9b6321e] Atomix v1.1.2 [861a8166] Combinatorics v1.1.0 [ab62b9b5] DeepDiffs v1.2.0 [e2ba6199] ExprTools v0.1.10 [0b43b601] Groebner v0.10.2 [18e54dd8] IntegerMathUtils v0.1.3 [692b3bcd] JLLWrappers v1.7.1 [1914dd2f] MacroTools v0.5.16 ⌅ [2edaba10] Nemo v0.52.4 [3e851597] ParamPunPam v0.5.7 [aea7be01] PrecompileTools v1.3.3 [21216c6a] Preferences v1.5.1 [27ebfcd6] Primes v0.5.7 [92933f4c] ProgressMeter v1.11.0 [fb686558] RandomExtensions v0.4.4 [73480bc8] RationalFunctionFields v0.3.0 [98d24dd4] TestSetExtensions v3.0.0 [a759f4b9] TimerOutputs v0.5.29 [013be700] UnsafeAtomics v0.3.0 ⌅ [e134572f] FLINT_jll v301.300.102+0 [656ef2d0] OpenBLAS32_jll v0.3.30+0 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [ac6e5ff7] JuliaSyntaxHighlighting v1.13.0 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.13.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v1.0.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.13.0 [f489334b] StyledStrings v1.13.0 [fa267f1f] TOML v1.0.3 [8dfed614] Test v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.3.0+1 [781609d7] GMP_jll v6.3.0+2 [3a97d323] MPFR_jll v4.2.2+0 [4536629a] OpenBLAS_jll v0.3.30+0 [bea87d4a] SuiteSparse_jll v7.10.1+0 [8e850b90] libblastrampoline_jll v5.15.0+0 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... [ Info: Testing started ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 215__Tag_3 = (x^3 + y^3 + z^3)//(x + y + z) │ 215__Tag_1 = (x^2 + y^2 + z^2)//(x + y + z) └ 215__Tag_2 = x + y + z ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 53__Tag_3 = x*y*z │ 53__Tag_1 = x + y + z └ 53__Tag_2 = x*y + x*z + y*z ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 117__Tag_3 = a + b + c │ 117__Tag_1 = a └ 117__Tag_2 = b ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 117__Tag_3 = a + b + c │ 117__Tag_1 = a └ 117__Tag_2 = b ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 63__Tag_3 = 5*a │ 63__Tag_1 = 2*c └ 63__Tag_2 = 3*b ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 159__Tag_1 = a + b + c └ 159__Tag_2 = a^2 + b^2 + c^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 187__Tag_3 = a^4 + b^4 │ 187__Tag_1 = a^2 + b^2 └ 187__Tag_2 = a^3 + b^3 ┌ Info: Names for generators were not provided, so they have been generated as follows: └ 67__Tag_1 = T1^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 52__Tag_3 = _t │ 52__Tag_1 = T1 └ 52__Tag_2 = t ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 178__Tag_3 = x │ 178__Tag_1 = x - 1 └ 178__Tag_2 = 1//(x^5 - 1) ┌ Info: Names for generators were not provided, so they have been generated as follows: └ 192__Tag_1 = x^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 84__Tag_3 = x^4 + y^4 │ 84__Tag_1 = x^2 + y^2 └ 84__Tag_2 = x^3 + y^3 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 240__Tag_1 = x1 │ 240__Tag_2 = a │ 240__Tag_5 = x2//(a + b) │ 240__Tag_4 = c//x2 └ 240__Tag_3 = a*c + c^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 234__Tag_11 = (-alpha^2*beta_W^2*gamma*zeta - 2*alpha*beta_I*beta_W*gamma*zeta^2 - beta_I^2*gamma*zeta^3)//(alpha*beta_I) │ 234__Tag_12 = (-2*alpha*beta_W*gamma - 2*alpha*beta_W*zeta - 3*beta_I*gamma*zeta - 2*beta_I*zeta^2)//alpha │ 234__Tag_4 = (alpha*beta_W + beta_I*zeta)//beta_I │ 234__Tag_13 = (-alpha^2*beta_W^2*gamma - alpha^2*beta_W^2*zeta - 4*alpha*beta_I*beta_W*gamma*zeta - 2*alpha*beta_I*beta_W*zeta^2 - 3*beta_I^2*gamma*zeta^2 - beta_I^2*zeta^3)//(alpha*beta_I) │ 234__Tag_1 = 1 │ 234__Tag_10 = (-alpha^2*beta_W^2 - 2*alpha*beta_I*beta_W*zeta - beta_I^2*zeta^2)//(alpha*beta_I) │ 234__Tag_6 = (-alpha*beta_W - beta_I*zeta)//beta_I │ 234__Tag_7 = (-2*alpha*beta_W - 2*beta_I*zeta)//alpha │ 234__Tag_2 = -1 │ 234__Tag_9 = (-alpha*beta_W*gamma - alpha*beta_W*zeta - beta_I*zeta^2)//beta_I │ 234__Tag_3 = -beta_I//alpha │ 234__Tag_8 = (alpha*beta_W*gamma + alpha*beta_W*zeta + beta_I*zeta^2)//beta_I └ 234__Tag_5 = (-beta_I*gamma - beta_I*zeta)//alpha [ Info: Parameter names: ["x", "y1"] [ Info: Indeterm. names: ["t1", "y1", "y2"] [ Info: Parameter names: ["a", "b", "c", "x(t)"] [ Info: Indeterm. names: ["y1", "y2", "y3", "y4"] [ Info: Parameter names: ["a", "b", "c", "x(t)"] [ Info: Indeterm. names: ["t1", "y1", "y2", "y3", "y4"] [ Info: Search for polynomial generators concluded in 10.12183457 [ Info: Search for polynomial generators concluded in 0.746447791 [ Info: Search for polynomial generators concluded in 0.001217699 [ Info: Search for polynomial generators concluded in 0.002627505 [ Info: Search for polynomial generators concluded in 0.004075992 [ Info: Search for polynomial generators concluded in 0.041696542 [ Info: Search for polynomial generators concluded in 0.483553539 [ Info: Search for polynomial generators concluded in 0.001912962 [ Info: Search for polynomial generators concluded in 2.575890311 [ Info: Search for polynomial generators concluded in 0.904385531 [ Info: Simplifying generating set. Simplification level: standard ⌜ # Computing specializations.. Time: 0:00:11 ✓ # Computing specializations.. Time: 0:00:13 [ Info: Search for polynomial generators concluded in 0.006993805 [ Info: Selecting generators in 0.010163535 [ Info: Inclusion checked with probability 0.99 in 0.003505157 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.00652186 [ Info: Inclusion checked with probability 0.99 in 0.002955472 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 1.066850926 [ Info: Selecting generators in 0.187308034 [ Info: Inclusion checked with probability 0.99 in 0.004947364 seconds AbstractAlgebra.Generic.FracFieldElem{QQMPolyRingElem}[k01, k21 + k31, k12 + k13, k21*k31, k12*k31 + k13*k21] [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.030542155 [ Info: Selecting generators in 0.023044375 [ Info: Inclusion checked with probability 0.99 in 0.00530474 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.005954325 [ Info: Selecting generators in 0.000613205 [ Info: Inclusion checked with probability 0.99 in 0.002913083 seconds [ Info: Simplifying generating set. Simplification level: strong [ Info: Search for polynomial generators concluded in 0.005861665 [ Info: Computing 3 Groebner bases for degrees (3, 3) for block orderings ⌜ # Computing specializations.. Time: 0:00:35 ✓ # Computing specializations.. Time: 0:00:35 [ Info: Computed Groebner bases in 46.425779489 seconds [ Info: Selecting generators in 0.000530415 [ Info: Inclusion checked with probability 0.99 in 0.003103751 seconds [ Info: Simplifying generating set. Simplification level: standard ⌜ # Computing specializations.. Time: 0:00:00 Points: 101   ✓ # Computing specializations.. Time: 0:00:00 [ Info: Search for polynomial generators concluded in 0.283863142 [ Info: Selecting generators in 0.008824628 [ Info: Inclusion checked with probability 0.99 in 0.012279026 seconds [ Info: Simplifying generating set. Simplification level: strong [ Info: Search for polynomial generators concluded in 0.041479163 [ Info: Computing 5 Groebner bases for degrees (3, 3) for block orderings [ Info: Computed Groebner bases in 1.801299843 seconds [ Info: Selecting generators in 0.005746116 [ Info: Inclusion checked with probability 0.99 in 0.00859803 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.019106032 [ Info: Selecting generators in 0.010964268 [ Info: Inclusion checked with probability 0.99 in 0.003406228 seconds [ Info: Simplifying generating set. Simplification level: strong [ Info: Search for polynomial generators concluded in 0.01920277 [ Info: Computing 6 Groebner bases for degrees (3, 3) for block orderings [ Info: Computed Groebner bases in 0.953056648 seconds [ Info: Selecting generators in 0.031706754 [ Info: Inclusion checked with probability 0.99 in 0.005376939 seconds Test Summary: | Pass Total Time All the tests | 166 166 10m06.6s RationalFunctionField | 2 2 1m54.7s Transcendence basis computations and algebraicity checks | 13 13 8.3s RationalFunctionField: constructive field membership (basic) | 6 6 1m16.9s RationalFunctionField: constructive field membership | 91 91 13.0s RationalFunctionField: simplification | 1 1 2m22.2s RationalFunctionField: membership | 24 24 1m47.3s MQS raw ideal generators | 4 4 4.1s Linear relations over the rationals | 10 10 20.4s Rational function comparison | 7 7 1.0s RationalFunctionField: simplification | 8 8 1m55.4s 607.043465 seconds (321.70 M allocations: 19.912 GiB, 3.46% gc time, 68.90% compilation time: <1% of which was recompilation) Testing RationalFunctionFields tests passed Testing completed after 624.39s PkgEval succeeded after 851.96s