Package evaluation to test RationalFunctionFields on Julia 1.11.8 (29b3528cce*) started at 2026-01-20T04:38:31.456 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Activating project at `~/.julia/environments/v1.11` Set-up completed after 8.01s ################################################################################ # Installation # Installing RationalFunctionFields... Resolving package versions... Installed ParamPunPam ─ v0.5.7 Updating `~/.julia/environments/v1.11/Project.toml` [73480bc8] + RationalFunctionFields v0.3.0 Updating `~/.julia/environments/v1.11/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.2.1 [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.29+0 [56f22d72] + Artifacts v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed v1.11.0 [8f399da3] + Libdl v1.11.0 [37e2e46d] + LinearAlgebra v1.11.0 [56ddb016] + Logging v1.11.0 [de0858da] + Printf v1.11.0 [9a3f8284] + Random v1.11.0 [ea8e919c] + SHA v0.7.0 [9e88b42a] + Serialization v1.11.0 [6462fe0b] + Sockets v1.11.0 [2f01184e] + SparseArrays v1.11.0 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.0 [e66e0078] + CompilerSupportLibraries_jll v1.1.1+0 [781609d7] + GMP_jll v6.3.0+0 [3a97d323] + MPFR_jll v4.2.1+0 [4536629a] + OpenBLAS_jll v0.3.27+1 [bea87d4a] + SuiteSparse_jll v7.7.0+0 [8e850b90] + libblastrampoline_jll v5.11.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 7.95s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompiling project... 33195.0 ms ✓ Nemo 150433.8 ms ✓ Groebner 8711.1 ms ✓ ParamPunPam 8855.8 ms ✓ RationalFunctionFields 4 dependencies successfully precompiled in 202 seconds. 35 already precompiled. Precompilation completed after 216.4s ################################################################################ # Testing # Testing RationalFunctionFields Status `/tmp/jl_L7YuNQ/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.11.0 [9a3f8284] Random v1.11.0 [8dfed614] Test v1.11.0 Status `/tmp/jl_L7YuNQ/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.2.1 [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.29+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 [8f399da3] Libdl v1.11.0 [37e2e46d] LinearAlgebra v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [de0858da] Printf v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [2f01184e] SparseArrays v1.11.0 [fa267f1f] TOML v1.0.3 [8dfed614] Test v1.11.0 [4ec0a83e] Unicode v1.11.0 [e66e0078] CompilerSupportLibraries_jll v1.1.1+0 [781609d7] GMP_jll v6.3.0+0 [3a97d323] MPFR_jll v4.2.1+0 [4536629a] OpenBLAS_jll v0.3.27+1 [bea87d4a] SuiteSparse_jll v7.7.0+0 [8e850b90] libblastrampoline_jll v5.11.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: │ 101__Tag_2 = x + y + z │ 101__Tag_1 = (x^2 + y^2 + z^2)//(x + y + z) └ 101__Tag_3 = (x^3 + y^3 + z^3)//(x + y + z) ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 202__Tag_2 = x*y + x*z + y*z │ 202__Tag_1 = x + y + z └ 202__Tag_3 = x*y*z ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 129__Tag_2 = b │ 129__Tag_1 = a └ 129__Tag_3 = a + b + c ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 77__Tag_2 = b │ 77__Tag_1 = a └ 77__Tag_3 = a + b + c ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 148__Tag_2 = 3*b │ 148__Tag_1 = 2*c └ 148__Tag_3 = 5*a ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 153__Tag_2 = a^2 + b^2 + c^2 └ 153__Tag_1 = a + b + c ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 73__Tag_2 = a^3 + b^3 │ 73__Tag_1 = a^2 + b^2 └ 73__Tag_3 = a^4 + b^4 ┌ Info: Names for generators were not provided, so they have been generated as follows: └ 186__Tag_1 = T1^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 56__Tag_2 = t │ 56__Tag_1 = T1 └ 56__Tag_3 = _t ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 78__Tag_2 = 1//(x^5 - 1) │ 78__Tag_1 = x - 1 └ 78__Tag_3 = x ┌ Info: Names for generators were not provided, so they have been generated as follows: └ 234__Tag_1 = x^2 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 223__Tag_2 = x^3 + y^3 │ 223__Tag_1 = x^2 + y^2 └ 223__Tag_3 = x^4 + y^4 ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 86__Tag_3 = a*c + c^2 │ 86__Tag_2 = a │ 86__Tag_4 = c//x2 │ 86__Tag_1 = x1 └ 86__Tag_5 = x2//(a + b) ┌ Info: Names for generators were not provided, so they have been generated as follows: │ 229__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) │ 229__Tag_6 = (-alpha*beta_W - beta_I*zeta)//beta_I │ 229__Tag_8 = (alpha*beta_W*gamma + alpha*beta_W*zeta + beta_I*zeta^2)//beta_I │ 229__Tag_2 = -1 │ 229__Tag_4 = (alpha*beta_W + beta_I*zeta)//beta_I │ 229__Tag_7 = (-2*alpha*beta_W - 2*beta_I*zeta)//alpha │ 229__Tag_5 = (-beta_I*gamma - beta_I*zeta)//alpha │ 229__Tag_9 = (-alpha*beta_W*gamma - alpha*beta_W*zeta - beta_I*zeta^2)//beta_I │ 229__Tag_1 = 1 │ 229__Tag_12 = (-2*alpha*beta_W*gamma - 2*alpha*beta_W*zeta - 3*beta_I*gamma*zeta - 2*beta_I*zeta^2)//alpha │ 229__Tag_3 = -beta_I//alpha │ 229__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) └ 229__Tag_10 = (-alpha^2*beta_W^2 - 2*alpha*beta_I*beta_W*zeta - beta_I^2*zeta^2)//(alpha*beta_I) [ 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 14.181794324 [ Info: Search for polynomial generators concluded in 1.144448045 [ Info: Search for polynomial generators concluded in 0.002456827 [ Info: Search for polynomial generators concluded in 0.005003033 [ Info: Search for polynomial generators concluded in 0.00099292 [ Info: Search for polynomial generators concluded in 0.071852204 [ Info: Search for polynomial generators concluded in 0.780417497 [ Info: Search for polynomial generators concluded in 0.003024042 [ Info: Search for polynomial generators concluded in 3.618581407 [ Info: Search for polynomial generators concluded in 1.433653578 [ Info: Simplifying generating set. Simplification level: standard ⌜ # Computing specializations.. Time: 0:00:12 ✓ # Computing specializations.. Time: 0:00:14 [ Info: Search for polynomial generators concluded in 0.009969227 [ Info: Selecting generators in 0.011884758 [ Info: Inclusion checked with probability 0.99 in 0.004776146 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.008446971 [ Info: Inclusion checked with probability 0.99 in 0.003679385 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 1.180736742 [ Info: Selecting generators in 0.209972528 [ Info: Inclusion checked with probability 0.99 in 0.005437688 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.030806861 [ Info: Selecting generators in 0.022872385 [ Info: Inclusion checked with probability 0.99 in 0.004370659 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.006303611 [ Info: Selecting generators in 0.000652054 [ Info: Inclusion checked with probability 0.99 in 0.003116051 seconds [ Info: Simplifying generating set. Simplification level: strong [ Info: Search for polynomial generators concluded in 0.006791067 [ 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 48.190582978 seconds [ Info: Selecting generators in 0.000918461 [ Info: Inclusion checked with probability 0.99 in 0.003821774 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.290576862 [ Info: Selecting generators in 0.008490301 [ Info: Inclusion checked with probability 0.99 in 0.014296466 seconds [ Info: Simplifying generating set. Simplification level: strong [ Info: Search for polynomial generators concluded in 0.046684172 [ Info: Computing 5 Groebner bases for degrees (3, 3) for block orderings [ Info: Computed Groebner bases in 2.527787483 seconds [ Info: Selecting generators in 0.008353842 [ Info: Inclusion checked with probability 0.99 in 0.013709631 seconds [ Info: Simplifying generating set. Simplification level: standard [ Info: Search for polynomial generators concluded in 0.15868301 [ Info: Selecting generators in 0.022680308 [ Info: Inclusion checked with probability 0.99 in 0.006154182 seconds [ Info: Simplifying generating set. Simplification level: strong [ Info: Search for polynomial generators concluded in 0.02770976 [ Info: Computing 6 Groebner bases for degrees (3, 3) for block orderings [ Info: Computed Groebner bases in 0.946325137 seconds [ Info: Selecting generators in 0.029912519 [ Info: Inclusion checked with probability 0.99 in 0.004795435 seconds Test Summary: | Pass Total Time All the tests | 166 166 10m38.1s RationalFunctionField | 2 2 1m53.7s Transcendence basis computations and algebraicity checks | 13 13 8.1s RationalFunctionField: constructive field membership (basic) | 6 6 1m09.5s RationalFunctionField: constructive field membership | 91 91 12.9s RationalFunctionField: simplification | 1 1 2m32.9s RationalFunctionField: membership | 24 24 1m55.0s MQS raw ideal generators | 4 4 4.2s Linear relations over the rationals | 10 10 21.5s Rational function comparison | 7 7 1.6s RationalFunctionField: simplification | 8 8 2m08.1s 638.474095 seconds (321.23 M allocations: 19.515 GiB, 1.91% gc time, 67.70% compilation time: <1% of which was recompilation) Testing RationalFunctionFields tests passed Testing completed after 656.26s PkgEval succeeded after 901.99s