Package evaluation of KnuthBendix on Julia 1.11.5 (32ac370b68*) started at 2025-06-29T07:30:03.716 ################################################################################ # Set-up # Installing PkgEval dependencies (TestEnv)... Set-up completed after 8.6s ################################################################################ # Installation # Installing KnuthBendix... Resolving package versions... Updating `~/.julia/environments/v1.11/Project.toml` [c2604015] + KnuthBendix v0.5.0 Updating `~/.julia/environments/v1.11/Manifest.toml` [a8cc5b0e] + Crayons v4.1.1 [9a962f9c] + DataAPI v1.16.0 [e2d170a0] + DataValueInterfaces v1.0.0 [d5909c97] + GroupsCore v0.5.2 [82899510] + IteratorInterfaceExtensions v1.0.0 [c2604015] + KnuthBendix v0.5.0 [b964fa9f] + LaTeXStrings v1.4.0 [1914dd2f] + MacroTools v0.5.16 [bac558e1] + OrderedCollections v1.8.1 ⌅ [aea7be01] + PrecompileTools v1.2.1 [21216c6a] + Preferences v1.4.3 [08abe8d2] + PrettyTables v2.4.0 [92933f4c] + ProgressMeter v1.10.4 [189a3867] + Reexport v1.2.2 [892a3eda] + StringManipulation v0.4.1 [3783bdb8] + TableTraits v1.0.1 [bd369af6] + Tables v1.12.1 [2a0f44e3] + Base64 v1.11.0 [ade2ca70] + Dates v1.11.0 [8ba89e20] + Distributed 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 [fa267f1f] + TOML v1.0.3 [4ec0a83e] + Unicode v1.11.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 1.63s ################################################################################ # Precompilation # Precompiling PkgEval dependencies... Precompiling package dependencies... Precompilation completed after 31.64s ################################################################################ # Testing # Testing KnuthBendix Status `/tmp/jl_QhVszA/Project.toml` [e30172f5] Documenter v1.13.0 [d5909c97] GroupsCore v0.5.2 [c2604015] KnuthBendix v0.5.0 [1914dd2f] MacroTools v0.5.16 ⌅ [aea7be01] PrecompileTools v1.2.1 [08abe8d2] PrettyTables v2.4.0 [92933f4c] ProgressMeter v1.10.4 [bd369af6] Tables v1.12.1 [8dfed614] Test v1.11.0 Status `/tmp/jl_QhVszA/Manifest.toml` [a4c015fc] ANSIColoredPrinters v0.0.1 [1520ce14] AbstractTrees v0.4.5 [944b1d66] CodecZlib v0.7.8 [a8cc5b0e] Crayons v4.1.1 [9a962f9c] DataAPI v1.16.0 [e2d170a0] DataValueInterfaces v1.0.0 [ffbed154] DocStringExtensions v0.9.5 [e30172f5] Documenter v1.13.0 [d7ba0133] Git v1.4.0 [d5909c97] GroupsCore v0.5.2 [b5f81e59] IOCapture v0.2.5 [82899510] IteratorInterfaceExtensions v1.0.0 [692b3bcd] JLLWrappers v1.7.0 [682c06a0] JSON v0.21.4 [c2604015] KnuthBendix v0.5.0 [b964fa9f] LaTeXStrings v1.4.0 [0e77f7df] LazilyInitializedFields v1.3.0 [1914dd2f] MacroTools v0.5.16 [d0879d2d] MarkdownAST v0.1.2 [bac558e1] OrderedCollections v1.8.1 [69de0a69] Parsers v2.8.3 ⌅ [aea7be01] PrecompileTools v1.2.1 [21216c6a] Preferences v1.4.3 [08abe8d2] PrettyTables v2.4.0 [92933f4c] ProgressMeter v1.10.4 [189a3867] Reexport v1.2.2 [2792f1a3] RegistryInstances v0.1.0 [892a3eda] StringManipulation v0.4.1 [3783bdb8] TableTraits v1.0.1 [bd369af6] Tables v1.12.1 [3bb67fe8] TranscodingStreams v0.11.3 [2e619515] Expat_jll v2.6.5+0 [f8c6e375] Git_jll v2.50.0+0 [94ce4f54] Libiconv_jll v1.18.0+0 [9bd350c2] OpenSSH_jll v10.0.1+0 [458c3c95] OpenSSL_jll v3.5.0+0 [0dad84c5] ArgTools v1.1.2 [56f22d72] Artifacts v1.11.0 [2a0f44e3] Base64 v1.11.0 [ade2ca70] Dates v1.11.0 [8ba89e20] Distributed v1.11.0 [f43a241f] Downloads v1.6.0 [7b1f6079] FileWatching v1.11.0 [b77e0a4c] InteractiveUtils v1.11.0 [b27032c2] LibCURL v0.6.4 [76f85450] LibGit2 v1.11.0 [8f399da3] Libdl v1.11.0 [56ddb016] Logging v1.11.0 [d6f4376e] Markdown v1.11.0 [a63ad114] Mmap v1.11.0 [ca575930] NetworkOptions v1.2.0 [44cfe95a] Pkg v1.11.0 [de0858da] Printf v1.11.0 [3fa0cd96] REPL v1.11.0 [9a3f8284] Random v1.11.0 [ea8e919c] SHA v0.7.0 [9e88b42a] Serialization v1.11.0 [6462fe0b] Sockets v1.11.0 [f489334b] StyledStrings v1.11.0 [fa267f1f] TOML v1.0.3 [a4e569a6] Tar v1.10.0 [8dfed614] Test v1.11.0 [cf7118a7] UUIDs v1.11.0 [4ec0a83e] Unicode v1.11.0 [deac9b47] LibCURL_jll v8.6.0+0 [e37daf67] LibGit2_jll v1.7.2+0 [29816b5a] LibSSH2_jll v1.11.0+1 [c8ffd9c3] MbedTLS_jll v2.28.6+0 [14a3606d] MozillaCACerts_jll v2023.12.12 [efcefdf7] PCRE2_jll v10.42.0+1 [83775a58] Zlib_jll v1.2.13+1 [8e850ede] nghttp2_jll v1.59.0+0 [3f19e933] p7zip_jll v17.4.0+2 Info Packages marked with ⌅ have new versions available but compatibility constraints restrict them from upgrading. Testing Running tests... ┌ Warning: a already has an inverse: A; overriding └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/alphabets.jl:157 ┌ Warning: b already has an inverse: a; overriding └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/alphabets.jl:157 ┌ Warning: c already has an inverse: b; overriding └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/alphabets.jl:157 ┌ Warning: KBPlain is a simplistic completion algorithm for educational purposes only. └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/knuthbendix1.jl:138 [ Info: considering (1, 1) for critical pairs [ Info: considering (2, 1) for critical pairs [ Info: considering (1, 2) for critical pairs [ Info: considering (2, 2) for critical pairs [ Info: considering (3, 1) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (3·1 ⇒ (id), 1·3 ⇒ (id)) │ (a, b, c) = (3, 1, 3) └ pair = (3, 3) [ Info: pair does not fail local confluence, both sides rewrite to 3 [ Info: considering (1, 3) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (1·3 ⇒ (id), 3·1 ⇒ (id)) │ (a, b, c) = (1, 3, 1) └ pair = (1, 1) [ Info: pair does not fail local confluence, both sides rewrite to 1 [ Info: considering (3, 2) for critical pairs [ Info: considering (2, 3) for critical pairs [ Info: considering (3, 3) for critical pairs [ Info: considering (4, 1) for critical pairs [ Info: considering (1, 4) for critical pairs [ Info: considering (4, 2) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·2 ⇒ (id), 2·4 ⇒ (id)) │ (a, b, c) = (4, 2, 4) └ pair = (4, 4) [ Info: pair does not fail local confluence, both sides rewrite to 4 [ Info: considering (2, 4) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (2·4 ⇒ (id), 4·2 ⇒ (id)) │ (a, b, c) = (2, 4, 2) └ pair = (2, 2) [ Info: pair does not fail local confluence, both sides rewrite to 2 [ Info: considering (4, 3) for critical pairs [ Info: considering (3, 4) for critical pairs [ Info: considering (4, 4) for critical pairs [ Info: considering (5, 1) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (2·1 ⇒ 1·2, 1·3 ⇒ (id)) │ (a, b, c) = (2, 1, 3) └ pair = (1·2·3, 2) [ Info: pair fails local confluence, rewrites to 1·2·3 ≠ 2 [ Info: adding rule [ 6. a*b*A → b ] to rws [ Info: considering (1, 5) for critical pairs [ Info: considering (5, 2) for critical pairs [ Info: considering (2, 5) for critical pairs [ Info: considering (5, 3) for critical pairs [ Info: considering (3, 5) for critical pairs [ Info: considering (5, 4) for critical pairs [ Info: considering (4, 5) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·2 ⇒ (id), 2·1 ⇒ 1·2) │ (a, b, c) = (4, 2, 1) └ pair = (1, 4·1·2) [ Info: pair fails local confluence, rewrites to 1 ≠ 4·1·2 [ Info: adding rule [ 7. B*a*b → a ] to rws [ Info: considering (5, 5) for critical pairs [ Info: considering (6, 1) for critical pairs [ Info: considering (1, 6) for critical pairs [ Info: considering (6, 2) for critical pairs [ Info: considering (2, 6) for critical pairs [ Info: considering (6, 3) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (1·2·3 ⇒ 2, 3·1 ⇒ (id)) │ (a, b, c) = (1·2, 3, 1) └ pair = (2·1, 1·2) [ Info: pair does not fail local confluence, both sides rewrite to 1·2 [ Info: considering (3, 6) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (3·1 ⇒ (id), 1·2·3 ⇒ 2) │ (a, b, c) = (3, 1, 2·3) └ pair = (2·3, 3·2) [ Info: pair fails local confluence, rewrites to 2·3 ≠ 3·2 [ Info: adding rule [ 8. b*A → A*b ] to rws [ Info: considering (6, 4) for critical pairs [ Info: considering (4, 6) for critical pairs [ Info: considering (6, 5) for critical pairs [ Info: considering (5, 6) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (2·1 ⇒ 1·2, 1·2·3 ⇒ 2) │ (a, b, c) = (2, 1, 2·3) └ pair = (1·2·2·3, 2·2) [ Info: pair does not fail local confluence, both sides rewrite to 2·2 [ Info: considering (6, 6) for critical pairs [ Info: considering (7, 1) for critical pairs [ Info: considering (1, 7) for critical pairs [ Info: considering (7, 2) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·1·2 ⇒ 1, 2·4 ⇒ (id)) │ (a, b, c) = (4·1, 2, 4) └ pair = (1·4, 4·1) [ Info: pair fails local confluence, rewrites to 1·4 ≠ 4·1 [ Info: adding rule [ 9. B*a → a*B ] to rws [ Info: considering (2, 7) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (2·4 ⇒ (id), 4·1·2 ⇒ 1) │ (a, b, c) = (2, 4, 1·2) └ pair = (1·2, 2·1) [ Info: pair does not fail local confluence, both sides rewrite to 1·2 [ Info: considering (7, 3) for critical pairs [ Info: considering (3, 7) for critical pairs [ Info: considering (7, 4) for critical pairs [ Info: considering (4, 7) for critical pairs [ Info: considering (7, 5) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·1·2 ⇒ 1, 2·1 ⇒ 1·2) │ (a, b, c) = (4·1, 2, 1) └ pair = (1·1, 4·1·1·2) [ Info: pair does not fail local confluence, both sides rewrite to 1·1 [ Info: considering (5, 7) for critical pairs [ Info: considering (7, 6) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·1·2 ⇒ 1, 1·2·3 ⇒ 2) │ (a, b, c) = (4, 1·2, 3) └ pair = (1·3, 4·2) [ Info: pair does not fail local confluence, both sides rewrite to (id) [ Info: considering (6, 7) for critical pairs [ Info: considering (7, 7) for critical pairs [ Info: considering (8, 1) for critical pairs [ Info: considering (1, 8) for critical pairs [ Info: considering (8, 2) for critical pairs [ Info: considering (2, 8) for critical pairs [ Info: considering (8, 3) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (2·3 ⇒ 3·2, 3·1 ⇒ (id)) │ (a, b, c) = (2, 3, 1) └ pair = (3·2·1, 2) [ Info: pair does not fail local confluence, both sides rewrite to 2 [ Info: considering (3, 8) for critical pairs [ Info: considering (8, 4) for critical pairs [ Info: considering (4, 8) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·2 ⇒ (id), 2·3 ⇒ 3·2) │ (a, b, c) = (4, 2, 3) └ pair = (3, 4·3·2) [ Info: pair fails local confluence, rewrites to 3 ≠ 4·3·2 [ Info: adding rule [ 10. B*A*b → A ] to rws [ Info: considering (8, 5) for critical pairs [ Info: considering (5, 8) for critical pairs [ Info: considering (8, 6) for critical pairs [ Info: considering (6, 8) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (1·2·3 ⇒ 2, 2·3 ⇒ 3·2) │ (a, b, c) = (1, 2·3, (id)) └ pair = (2, 1·3·2) [ Info: pair does not fail local confluence, both sides rewrite to 2 [ Info: considering (8, 7) for critical pairs [ Info: considering (7, 8) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·1·2 ⇒ 1, 2·3 ⇒ 3·2) │ (a, b, c) = (4·1, 2, 3) └ pair = (1·3, 4·1·3·2) [ Info: pair does not fail local confluence, both sides rewrite to (id) [ Info: considering (8, 8) for critical pairs [ Info: considering (9, 1) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·1 ⇒ 1·4, 1·3 ⇒ (id)) │ (a, b, c) = (4, 1, 3) └ pair = (1·4·3, 4) [ Info: pair fails local confluence, rewrites to 1·4·3 ≠ 4 [ Info: adding rule [ 11. a*B*A → B ] to rws [ Info: considering (1, 9) for critical pairs [ Info: considering (9, 2) for critical pairs [ Info: considering (2, 9) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (2·4 ⇒ (id), 4·1 ⇒ 1·4) │ (a, b, c) = (2, 4, 1) └ pair = (1, 2·1·4) [ Info: pair does not fail local confluence, both sides rewrite to 1 [ Info: considering (9, 3) for critical pairs [ Info: considering (3, 9) for critical pairs [ Info: considering (9, 4) for critical pairs [ Info: considering (4, 9) for critical pairs [ Info: considering (9, 5) for critical pairs [ Info: considering (5, 9) for critical pairs [ Info: considering (9, 6) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·1 ⇒ 1·4, 1·2·3 ⇒ 2) │ (a, b, c) = (4, 1, 2·3) └ pair = (1·4·2·3, 4·2) [ Info: pair does not fail local confluence, both sides rewrite to (id) [ Info: considering (6, 9) for critical pairs [ Info: considering (9, 7) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·1 ⇒ 1·4, 4·1·2 ⇒ 1) │ (a, b, c) = ((id), 4·1, 2) └ pair = (1·4·2, 1) [ Info: pair does not fail local confluence, both sides rewrite to 1 [ Info: considering (7, 9) for critical pairs ┌ Info: lhs₂ is a subword of lhs₁ │ rules = (4·1·2 ⇒ 1, 4·1 ⇒ 1·4) │ (a, b, c) = ((id), 4·1, 2) └ pair = (1, 1·4·2) [ Info: pair does not fail local confluence, both sides rewrite to 1 [ Info: considering (9, 8) for critical pairs [ Info: considering (8, 9) for critical pairs [ Info: considering (9, 9) for critical pairs [ Info: considering (10, 1) for critical pairs [ Info: considering (1, 10) for critical pairs [ Info: considering (10, 2) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·3·2 ⇒ 3, 2·4 ⇒ (id)) │ (a, b, c) = (4·3, 2, 4) └ pair = (3·4, 4·3) [ Info: pair fails local confluence, rewrites to 3·4 ≠ 4·3 [ Info: adding rule [ 12. B*A → A*B ] to rws [ Info: considering (2, 10) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (2·4 ⇒ (id), 4·3·2 ⇒ 3) │ (a, b, c) = (2, 4, 3·2) └ pair = (3·2, 2·3) [ Info: pair does not fail local confluence, both sides rewrite to 3·2 [ Info: considering (10, 3) for critical pairs [ Info: considering (3, 10) for critical pairs [ Info: considering (10, 4) for critical pairs [ Info: considering (4, 10) for critical pairs [ Info: considering (10, 5) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·3·2 ⇒ 3, 2·1 ⇒ 1·2) │ (a, b, c) = (4·3, 2, 1) └ pair = (3·1, 4·3·1·2) [ Info: pair does not fail local confluence, both sides rewrite to (id) [ Info: considering (5, 10) for critical pairs [ Info: considering (10, 6) for critical pairs [ Info: considering (6, 10) for critical pairs [ Info: considering (10, 7) for critical pairs [ Info: considering (7, 10) for critical pairs [ Info: considering (10, 8) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·3·2 ⇒ 3, 2·3 ⇒ 3·2) │ (a, b, c) = (4·3, 2, 3) └ pair = (3·3, 4·3·3·2) [ Info: pair does not fail local confluence, both sides rewrite to 3·3 [ Info: considering (8, 10) for critical pairs [ Info: considering (10, 9) for critical pairs [ Info: considering (9, 10) for critical pairs [ Info: considering (10, 10) for critical pairs [ Info: considering (11, 1) for critical pairs [ Info: considering (1, 11) for critical pairs [ Info: considering (11, 2) for critical pairs [ Info: considering (2, 11) for critical pairs [ Info: considering (11, 3) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (1·4·3 ⇒ 4, 3·1 ⇒ (id)) │ (a, b, c) = (1·4, 3, 1) └ pair = (4·1, 1·4) [ Info: pair does not fail local confluence, both sides rewrite to 1·4 [ Info: considering (3, 11) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (3·1 ⇒ (id), 1·4·3 ⇒ 4) │ (a, b, c) = (3, 1, 4·3) └ pair = (4·3, 3·4) [ Info: pair does not fail local confluence, both sides rewrite to 3·4 [ Info: considering (11, 4) for critical pairs [ Info: considering (4, 11) for critical pairs [ Info: considering (11, 5) for critical pairs [ Info: considering (5, 11) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (2·1 ⇒ 1·2, 1·4·3 ⇒ 4) │ (a, b, c) = (2, 1, 4·3) └ pair = (1·2·4·3, 2·4) [ Info: pair does not fail local confluence, both sides rewrite to (id) [ Info: considering (11, 6) for critical pairs [ Info: considering (6, 11) for critical pairs [ Info: considering (11, 7) for critical pairs [ Info: considering (7, 11) for critical pairs [ Info: considering (11, 8) for critical pairs [ Info: considering (8, 11) for critical pairs [ Info: considering (11, 9) for critical pairs [ Info: considering (9, 11) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·1 ⇒ 1·4, 1·4·3 ⇒ 4) │ (a, b, c) = (4, 1, 4·3) └ pair = (1·4·4·3, 4·4) [ Info: pair does not fail local confluence, both sides rewrite to 4·4 [ Info: considering (11, 10) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (1·4·3 ⇒ 4, 4·3·2 ⇒ 3) │ (a, b, c) = (1, 4·3, 2) └ pair = (4·2, 1·3) [ Info: pair does not fail local confluence, both sides rewrite to (id) [ Info: considering (10, 11) for critical pairs [ Info: considering (11, 11) for critical pairs [ Info: considering (12, 1) for critical pairs [ Info: considering (1, 12) for critical pairs [ Info: considering (12, 2) for critical pairs [ Info: considering (2, 12) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (2·4 ⇒ (id), 4·3 ⇒ 3·4) │ (a, b, c) = (2, 4, 3) └ pair = (3, 2·3·4) [ Info: pair does not fail local confluence, both sides rewrite to 3 [ Info: considering (12, 3) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·3 ⇒ 3·4, 3·1 ⇒ (id)) │ (a, b, c) = (4, 3, 1) └ pair = (3·4·1, 4) [ Info: pair does not fail local confluence, both sides rewrite to 4 [ Info: considering (3, 12) for critical pairs [ Info: considering (12, 4) for critical pairs [ Info: considering (4, 12) for critical pairs [ Info: considering (12, 5) for critical pairs [ Info: considering (5, 12) for critical pairs [ Info: considering (12, 6) for critical pairs [ Info: considering (6, 12) for critical pairs [ Info: considering (12, 7) for critical pairs [ Info: considering (7, 12) for critical pairs [ Info: considering (12, 8) for critical pairs [ Info: considering (8, 12) for critical pairs [ Info: considering (12, 9) for critical pairs [ Info: considering (9, 12) for critical pairs [ Info: considering (12, 10) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (4·3 ⇒ 3·4, 4·3·2 ⇒ 3) │ (a, b, c) = ((id), 4·3, 2) └ pair = (3·4·2, 3) [ Info: pair does not fail local confluence, both sides rewrite to 3 [ Info: considering (10, 12) for critical pairs ┌ Info: lhs₂ is a subword of lhs₁ │ rules = (4·3·2 ⇒ 3, 4·3 ⇒ 3·4) │ (a, b, c) = ((id), 4·3, 2) └ pair = (3, 3·4·2) [ Info: pair does not fail local confluence, both sides rewrite to 3 [ Info: considering (12, 11) for critical pairs [ Info: considering (11, 12) for critical pairs ┌ Info: lhs₁ suffix-prefix lhs₂: │ rules = (1·4·3 ⇒ 4, 4·3 ⇒ 3·4) │ (a, b, c) = (1, 4·3, (id)) └ pair = (4, 1·3·4) [ Info: pair does not fail local confluence, both sides rewrite to 4 [ Info: considering (12, 12) for critical pairs Knuth-Bendix completion (KnuthBendix.KBStack()) 33% ETA: 0:00:01 ( 0.26 s/it) processing rules (done/total): 2/6   Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 ( 0.12 s/it) processing rules (done/total): 14/14  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 ( 0.11 s/it) processing rules (done/total): 15/15  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 ( 0.11 s/it) processing rules (done/total): 16/16  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 ( 0.10 s/it) processing rules (done/total): 17/17  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (94.73 ms/it) processing rules (done/total): 18/18  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (89.76 ms/it) processing rules (done/total): 19/19  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (85.28 ms/it) processing rules (done/total): 20/20  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (81.23 ms/it) processing rules (done/total): 21/21  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (77.54 ms/it) processing rules (done/total): 22/22  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (74.18 ms/it) processing rules (done/total): 23/23  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (71.10 ms/it) processing rules (done/total): 24/24  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (68.27 ms/it) processing rules (done/total): 25/25  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (65.66 ms/it) processing rules (done/total): 26/26  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (63.24 ms/it) processing rules (done/total): 27/27  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (61.00 ms/it) processing rules (done/total): 28/28  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (58.91 ms/it) processing rules (done/total): 29/29  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (56.96 ms/it) processing rules (done/total): 30/30  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (55.14 ms/it) processing rules (done/total): 31/31  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (53.44 ms/it) processing rules (done/total): 32/32  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (51.84 ms/it) processing rules (done/total): 33/33  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (50.34 ms/it) processing rules (done/total): 34/34  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (48.93 ms/it) processing rules (done/total): 35/35  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (47.59 ms/it) processing rules (done/total): 36/36  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (46.34 ms/it) processing rules (done/total): 37/37  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (45.15 ms/it) processing rules (done/total): 38/38  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (44.02 ms/it) processing rules (done/total): 39/39  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (42.95 ms/it) processing rules (done/total): 40/40  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (41.94 ms/it) processing rules (done/total): 41/41  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (40.98 ms/it) processing rules (done/total): 42/42  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (40.06 ms/it) processing rules (done/total): 43/43  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (39.19 ms/it) processing rules (done/total): 44/44  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (38.37 ms/it) processing rules (done/total): 45/45  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (37.59 ms/it) processing rules (done/total): 46/46  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (36.85 ms/it) processing rules (done/total): 47/47  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (36.16 ms/it) processing rules (done/total): 48/48  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (35.48 ms/it) processing rules (done/total): 49/49  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (34.85 ms/it) processing rules (done/total): 50/50  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (34.24 ms/it) processing rules (done/total): 51/51  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (33.66 ms/it) processing rules (done/total): 52/52  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (33.11 ms/it) processing rules (done/total): 53/53  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (32.57 ms/it) processing rules (done/total): 54/54  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (32.06 ms/it) processing rules (done/total): 55/55  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (31.57 ms/it) processing rules (done/total): 56/56  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (31.10 ms/it) processing rules (done/total): 57/57  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (30.65 ms/it) processing rules (done/total): 58/58  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (30.22 ms/it) processing rules (done/total): 59/59  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (29.81 ms/it) processing rules (done/total): 60/60  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (29.43 ms/it) processing rules (done/total): 61/61  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (29.06 ms/it) processing rules (done/total): 62/62  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (28.71 ms/it) processing rules (done/total): 63/63  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (28.38 ms/it) processing rules (done/total): 64/64  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (28.06 ms/it) processing rules (done/total): 65/65  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (27.75 ms/it) processing rules (done/total): 66/66  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (27.46 ms/it) processing rules (done/total): 67/67  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (27.19 ms/it) processing rules (done/total): 68/68  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (26.94 ms/it) processing rules (done/total): 69/69  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (26.70 ms/it) processing rules (done/total): 70/70  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (26.47 ms/it) processing rules (done/total): 71/71  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (26.26 ms/it) processing rules (done/total): 72/72  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (26.05 ms/it) processing rules (done/total): 73/73  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (25.86 ms/it) processing rules (done/total): 74/74  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (25.68 ms/it) processing rules (done/total): 75/75  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (25.52 ms/it) processing rules (done/total): 76/76  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (25.36 ms/it) processing rules (done/total): 77/77  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (25.24 ms/it) processing rules (done/total): 78/78  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:01 (25.12 ms/it) processing rules (done/total): 79/79  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (25.03 ms/it) processing rules (done/total): 80/80  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.94 ms/it) processing rules (done/total): 81/81  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.88 ms/it) processing rules (done/total): 82/82  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.82 ms/it) processing rules (done/total): 83/83  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.78 ms/it) processing rules (done/total): 84/84  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.75 ms/it) processing rules (done/total): 85/85  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.73 ms/it) processing rules (done/total): 86/86  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.73 ms/it) processing rules (done/total): 87/87  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.70 ms/it) processing rules (done/total): 88/88  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.66 ms/it) processing rules (done/total): 89/89  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.64 ms/it) processing rules (done/total): 90/90  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.63 ms/it) processing rules (done/total): 91/91  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.63 ms/it) processing rules (done/total): 92/92  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.63 ms/it) processing rules (done/total): 93/93  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.65 ms/it) processing rules (done/total): 94/94  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.67 ms/it) processing rules (done/total): 95/95  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.71 ms/it) processing rules (done/total): 96/96  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.76 ms/it) processing rules (done/total): 97/97  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.82 ms/it) processing rules (done/total): 98/98  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.88 ms/it) processing rules (done/total): 99/99  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (24.95 ms/it) processing rules (done/total): 100/100  Knuth-Bendix completion (KnuthBendix.KBStack()) 100% Time: 0:00:02 (25.03 ms/it) processing rules (done/total): 101/101 ┌ Warning: Maximum number of rules (100) reached. │ You may retry `knuthbendix` with a larger `max_rules` kwarg. └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/knuthbendix_base.jl:4 ┌ Warning: The returned rws is not confluent └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/knuthbendix_base.jl:56 ┌ Warning: Maximum number of rules (100) reached. │ You may retry `knuthbendix` with a larger `max_rules` kwarg. └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/knuthbendix_base.jl:4 ┌ Warning: The returned rws is not confluent └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/knuthbendix_base.jl:56 ┌ Warning: Maximum number of rules (100) reached. │ You may retry `knuthbendix` with a larger `max_rules` kwarg. └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/knuthbendix_base.jl:4 ┌ Warning: The returned rws is not confluent └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/knuthbendix_base.jl:56 ┌ Warning: Maximum number of rules (100) reached. │ You may retry `knuthbendix` with a larger `max_rules` kwarg. └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/knuthbendix_base.jl:4 ┌ Warning: The returned rws is not confluent └ @ KnuthBendix ~/.julia/packages/KnuthBendix/ziQjH/src/knuthbendix_base.jl:56 ┌ Warning: non-accepting state in the middle of the direct path found: │ rule = 3·11·5·1·12·6·3 ⇒ 1 │ σl = │ State: 3·11 │ data: 0 │ transitions: │ 1 → State: 3·11 (data=0) │ 2 → State: 3·11 (data=0) │ 3 → State: 3·11 (data=0) │ 4 → State: 3·11 (data=0) │ 5 → State: 3·11 (data=0) │ 6 → State: 3·11 (data=0) │ 7 → State: 3·11 (data=0) │ 8 → State: 3·11 (data=0) │ 9 → State: 3·11 (data=0) │ 10 → State: 3·11 (data=0) │ 11 → State: 3·11 (data=0) │ 12 → State: 3·11 (data=0) │ 13 → State: 3·11 (data=0) │ 14 → State: 3·11 (data=0) │ 15 → State: 3·11 (data=0) │ 16 → State: 3·11 (data=0) │ └ @ KnuthBendix.Automata ~/.julia/packages/KnuthBendix/ziQjH/src/Automata/rebuilding_idxA.jl:50 0.368410 seconds (179.40 k allocations: 11.645 MiB, 64.44% compilation time) 0.206397 seconds (114.70 k allocations: 8.625 MiB, 18.83% gc time) ┌ Error: monoid is infinite └ @ KnuthBendix.FPMonoids ~/.julia/packages/KnuthBendix/ziQjH/src/FPMonoids.jl:217 ┌ Error: monoid is infinite └ @ KnuthBendix.FPMonoids ~/.julia/packages/KnuthBendix/ziQjH/src/FPMonoids.jl:217 ┌ Error: monoid is infinite └ @ KnuthBendix.FPMonoids ~/.julia/packages/KnuthBendix/ziQjH/src/FPMonoids.jl:217 ┌ Error: monoid appears to be infinite (but the underlying rewriting system is not confluent) └ @ KnuthBendix.FPMonoids ~/.julia/packages/KnuthBendix/ziQjH/src/FPMonoids.jl:217 [ Info: 237 0.001586 seconds (4.22 k allocations: 185.586 KiB) 0.001167 seconds (4.31 k allocations: 193.266 KiB) [ Info: 237_8 4.272519 seconds (605.31 k allocations: 32.290 MiB) 2.140126 seconds (746.39 k allocations: 40.991 MiB) [ Info: 3a6 0.075044 seconds (84.43 k allocations: 3.847 MiB) 0.048009 seconds (76.93 k allocations: 3.494 MiB) [ Info: a4 0.000344 seconds (1.26 k allocations: 56.539 KiB) 0.000440 seconds (1.40 k allocations: 63.500 KiB) [ Info: a4monoid 0.000212 seconds (514 allocations: 26.031 KiB) 0.000250 seconds (644 allocations: 32.789 KiB) [ Info: ab1 0.000122 seconds (278 allocations: 13.125 KiB) 0.000191 seconds (372 allocations: 17.320 KiB) [ Info: ab2 0.000218 seconds (769 allocations: 35.117 KiB) 0.000331 seconds (925 allocations: 43.578 KiB) [ Info: c2 0.000152 seconds (288 allocations: 13.391 KiB) 0.000165 seconds (335 allocations: 15.570 KiB) [ Info: cosets 0.001000 seconds (3.73 k allocations: 162.000 KiB) 0.000978 seconds (3.80 k allocations: 170.227 KiB) [ Info: d22 0.003053 seconds (8.87 k allocations: 412.484 KiB) 0.001936 seconds (6.64 k allocations: 325.664 KiB) [ Info: degen1 0.000102 seconds (216 allocations: 9.859 KiB) 0.000178 seconds (300 allocations: 13.570 KiB) [ Info: degen2 0.000146 seconds (339 allocations: 14.875 KiB) 0.000159 seconds (354 allocations: 15.633 KiB) [ Info: degen3 0.000208 seconds (715 allocations: 31.867 KiB) 0.000197 seconds (497 allocations: 22.359 KiB) [ Info: degen4a 0.006118 seconds (13.15 k allocations: 569.438 KiB) 0.027325 seconds (35.18 k allocations: 1.739 MiB) [ Info: degen4b 0.437665 seconds (482.46 k allocations: 27.996 MiB) 0.417918 seconds (340.48 k allocations: 16.389 MiB) [ Info: e8 2.428727 seconds (550.91 k allocations: 27.466 MiB) 1.581996 seconds (448.46 k allocations: 24.424 MiB) [ Info: f2 0.000145 seconds (402 allocations: 19.633 KiB) 0.000257 seconds (516 allocations: 24.828 KiB) [ Info: f25 0.004086 seconds (21.21 k allocations: 894.500 KiB) 0.003673 seconds (21.20 k allocations: 902.266 KiB) [ Info: f25monoid 0.001956 seconds (5.63 k allocations: 248.719 KiB) 0.001166 seconds (4.13 k allocations: 184.148 KiB) [ Info: f27 37.348015 seconds (1.25 M allocations: 77.929 MiB) 11.002890 seconds (824.18 k allocations: 61.377 MiB) [ Info: f27_2gen 1.426215 seconds (349.36 k allocations: 18.686 MiB) 3.030397 seconds (473.64 k allocations: 33.958 MiB) [ Info: f27monoid 5.148215 seconds (583.11 k allocations: 44.936 MiB) 26.098801 seconds (1.14 M allocations: 165.037 MiB, 0.17% gc time) [ Info: freenilpc3 0.005060 seconds (10.02 k allocations: 486.086 KiB) 0.004712 seconds (12.19 k allocations: 619.945 KiB) [ Info: funny3 1.272591 seconds (300.89 k allocations: 15.792 MiB) 4.588919 seconds (632.84 k allocations: 47.368 MiB) [ Info: heinnilp 0.186037 seconds (101.36 k allocations: 7.139 MiB) 1.435181 seconds (507.91 k allocations: 46.377 MiB) [ Info: l32ext 4.703783 seconds (640.88 k allocations: 33.504 MiB) 2.712442 seconds (760.43 k allocations: 43.196 MiB) [ Info: m11 3.404953 seconds (1.10 M allocations: 54.812 MiB) 7.516672 seconds (1.19 M allocations: 77.695 MiB) [ Info: nilp2 0.001090 seconds (2.35 k allocations: 104.617 KiB) 0.000743 seconds (2.48 k allocations: 113.516 KiB) [ Info: nonhopf 0.000694 seconds (1.89 k allocations: 85.312 KiB) 0.000904 seconds (2.34 k allocations: 115.445 KiB) [ Info: s16 0.057494 seconds (75.88 k allocations: 3.581 MiB) 0.037713 seconds (48.77 k allocations: 2.290 MiB) [ Info: s3 0.000131 seconds (371 allocations: 16.844 KiB) 0.000206 seconds (471 allocations: 21.211 KiB) [ Info: s4 0.000544 seconds (1.60 k allocations: 72.680 KiB) 0.000481 seconds (1.58 k allocations: 72.859 KiB) [ Info: s9 0.003569 seconds (7.93 k allocations: 371.945 KiB) 0.002805 seconds (8.03 k allocations: 386.266 KiB) [ Info: torus 0.000529 seconds (1.80 k allocations: 81.945 KiB) 0.000603 seconds (1.87 k allocations: 93.094 KiB) [ Info: verifynilp 0.198296 seconds (125.51 k allocations: 38.217 MiB) 0.129248 seconds (119.05 k allocations: 7.818 MiB) Test Summary: | Pass Total Time KnuthBendix.jl | 1635 1635 6m41.3s Testing KnuthBendix tests passed Testing completed after 413.93s PkgEval succeeded after 462.4s