tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -1,50 +1,18 @@
1
- // Ported from Z3 (src/math/polynomial/polynomial.{h,cpp}, src/math/polynomial/polynomial_cache.cpp),
2
- // MIT license, see z3-license.txt. Multivariate polynomials over the integers for nlsat, with
3
- // Z3's factorization: univariate through upolynomial-factorization, quadratics through the square
4
- // root of the discriminant, and higher degrees through bivariate Hensel lifting. A polynomial keeps its monomials in the order Z3's som buffers
5
- // produce, with a monomial of maximal degree in the maximal variable first, because factorization
6
- // breaks ties on the order in which variables occur.
7
- //
8
- // Deviations from Z3, which only change the order of equal results:
9
- // - gcd computes with Z3's subresultant PRS (gcd_prs), not its modular algorithms (mod_gcd,
10
- // uni_mod_gcd). Both return the same polynomial, normalized to a positive leading coefficient,
11
- // but its monomials may come out in another order. Z3's modular gcd can also return a constant
12
- // other than 1 for coprime primitive polynomials, gcd(2x - 3, 2x - 1) = 2
13
- // (polynomial.cpp:4815), where this port returns 1. The callers in scope only test whether
14
- // the gcd is constant.
15
- // - Polynomial ids count up from zero. Z3 recycles the ids of deleted polynomials, so where nlsat
16
- // breaks a tie between two root functions on their ids it may pick the other one. Matching Z3
17
- // would take explicit reference counts at its roughly 490 polynomial_ref sites in polynomial,
18
- // algebraic_numbers, explain, levelwise and nra, and every pm routine allocating the same
19
- // temporaries as Z3's, not just returning the same result. Random differential tests hit such a
20
- // tie in about 1 of 300 levelwise and 1 of 3,000 explain programs, and no corpus trace yet.
21
1
  import { SmtInvariantError } from "../../../../errors";
22
2
  import { getGcd, Rational } from "../rational";
23
- import { UpolynomialManager } from "./upolynomial";
3
+ import { floorDiv, UpolynomialManager } from "./upolynomial";
24
4
  import {
25
5
  DEFAULT_FACTOR_PARAMS,
26
6
  factorSquareFree,
27
7
  getExactSquareRoot,
28
- type UpolynomialFactors,
8
+ mkFactors,
29
9
  } from "./upolynomial-factorization";
30
10
 
31
11
  export const NULL_VAR = -1;
32
12
 
33
- // s_factor_eval_values and s_factor_primes: the points multivariate factorization evaluates the
34
- // other variables at, and the primes it lifts modulo.
35
13
  const FACTOR_EVAL_VALUES = [0n, 1n, -1n, 2n, -2n, 3n, -3n];
36
14
  const FACTOR_PRIMES = [39103n, 104729n, 1000003n, 100000007n];
37
15
 
38
- // mpz div: rounds toward minus infinity.
39
- const floorDiv = (dividend: bigint, divisor: bigint) => {
40
- const quotient = dividend / divisor;
41
- return dividend % divisor !== 0n && dividend < 0n !== divisor < 0n ? quotient - 1n : quotient;
42
- };
43
-
44
- // Input outside what the port of nlsat supports so far: subresultants of polynomials of degree 2
45
- // or more in the variable being projected. The nra solver answers unknown on it, which is always
46
- // sound.
47
- // The arithmetic t_eval evaluates in: rationals, intervals or algebraic numbers.
48
16
  export interface ValueOps<T> {
49
17
  fromInteger(value: bigint): T;
50
18
  add(first: T, second: T): T;
@@ -65,7 +33,6 @@ const getMonomialKey = (vars: readonly number[], degrees: readonly number[]) =>
65
33
  class Monomial {
66
34
  readonly totalDegree: number;
67
35
 
68
- // vars and degrees change only when the manager renames the variables.
69
36
  constructor(
70
37
  readonly id: number,
71
38
  public vars: readonly number[],
@@ -93,7 +60,6 @@ class Monomial {
93
60
  return index === -1 ? 0 : this.degrees[index];
94
61
  }
95
62
 
96
- // max_smaller_than: the largest variable of the monomial below x.
97
63
  maxSmallerThan(variable: number) {
98
64
  let result = NULL_VAR;
99
65
  for (const current of this.vars) if (current < variable) result = current;
@@ -101,7 +67,6 @@ class Monomial {
101
67
  }
102
68
  }
103
69
 
104
- // lex_compare: the biggest variable dominates, then its degree.
105
70
  const lexCompare = (first: Monomial, second: Monomial) => {
106
71
  if (first === second) return 0;
107
72
  let firstIndex = first.size - 1;
@@ -131,7 +96,6 @@ const gradedLexCompare = (first: Monomial, second: Monomial) =>
131
96
  ? -1
132
97
  : 1;
133
98
 
134
- // po_gt: the order that puts a monomial with the maximal variable at its maximal degree first.
135
99
  const isPoGreater = (first: Monomial, second: Monomial) => {
136
100
  if (first.size === 0) return false;
137
101
  if (second.size === 0) return true;
@@ -150,7 +114,6 @@ export class Polynomial {
150
114
  this.makeFirstMaximal();
151
115
  }
152
116
 
153
- // make_first_maximal: a monomial with the maximal variable at its maximal degree first.
154
117
  makeFirstMaximal() {
155
118
  if (this.ms.length <= 1) return;
156
119
  let maxPos = 0;
@@ -174,8 +137,7 @@ export class Polynomial {
174
137
  this.ms[position] = monomial;
175
138
  }
176
139
 
177
- // lex_sort: puts the monomials in decreasing lexicographic order, which Z3 does in place whenever it
178
- // hashes the polynomial.
140
+ // Z3 sorts in place whenever it hashes or evaluates the polynomial, so later reads see this order.
179
141
  lexSort() {
180
142
  if (this.isLexSorted) return;
181
143
  this.isLexSorted = true;
@@ -190,7 +152,6 @@ export class Polynomial {
190
152
  }
191
153
  }
192
154
 
193
- // graded_lex_max_pos
194
155
  getGradedLexMaxPos() {
195
156
  if (this.ms.length === 0) return -1;
196
157
  let maxPos = 0;
@@ -214,8 +175,6 @@ export class Polynomial {
214
175
  }
215
176
  }
216
177
 
217
- // som_buffer: a sum of monomials, each kept at the position where it first appeared. Zero entries
218
- // stay until mk removes them.
219
178
  class SomBuffer {
220
179
  as: bigint[] = [];
221
180
  ms: Monomial[] = [];
@@ -253,7 +212,6 @@ class SomBuffer {
253
212
  }
254
213
  }
255
214
 
256
- // addmul: adds a*m*p.
257
215
  addmul(coeff: bigint, monomial: Monomial, polynomial: Polynomial) {
258
216
  if (coeff === 0n) return;
259
217
  for (let index = 0; index < polynomial.size; index++) {
@@ -267,8 +225,7 @@ class SomBuffer {
267
225
  }
268
226
  }
269
227
 
270
- // addmul(a, m, buffer): adds a*m times each entry of another buffer, zero entries included,
271
- // which keeps their monomials at new positions as Z3 does.
228
+ // Like Z3, zero entries of the other buffer are added too, which keeps their monomials' positions.
272
229
  addmulBuffer(coeff: bigint, monomial: Monomial, buffer: SomBuffer) {
273
230
  if (coeff === 0n) return;
274
231
  for (let index = 0; index < buffer.ms.length; index++) {
@@ -291,7 +248,6 @@ class SomBuffer {
291
248
  return maxPos;
292
249
  }
293
250
 
294
- // mk(normalize): the nonzero entries, divided by the gcd of their coefficients when normalizing.
295
251
  mk(isNormalized = false) {
296
252
  const as: bigint[] = [];
297
253
  const ms: Monomial[] = [];
@@ -306,7 +262,6 @@ class SomBuffer {
306
262
  }
307
263
  }
308
264
 
309
- // cheap_som_buffer: each monomial is added at most once, so it needs no position map.
310
265
  class CheapSomBuffer {
311
266
  private as: bigint[] = [];
312
267
  private ms: Monomial[] = [];
@@ -358,8 +313,6 @@ export class PolynomialManager {
358
313
  this.one = this.mkPolynomialCore([1n], [this.unit]);
359
314
  }
360
315
 
361
- // Monomials.
362
-
363
316
  mkMonomial(vars: readonly number[], degrees: readonly number[]) {
364
317
  const key = getMonomialKey(vars, degrees);
365
318
  const existing = this.monomials.get(key);
@@ -369,10 +322,6 @@ export class PolynomialManager {
369
322
  return monomial;
370
323
  }
371
324
 
372
- // rename: every variable x becomes permutation[x], in place in every monomial, as Z3 renames its
373
- // monomial table. Z3 then moves a maximal monomial first in every live polynomial. Here that is
374
- // the given polynomials, the ones nlsat keeps in its atoms. Others keep their order, which
375
- // matches again once the order is restored.
376
325
  rename(permutation: readonly number[], polynomials: Iterable<Polynomial>) {
377
326
  const monomials = new Map<string, Monomial>();
378
327
  for (const monomial of this.monomials.values()) {
@@ -390,7 +339,6 @@ export class PolynomialManager {
390
339
  for (const polynomial of polynomials) polynomial.makeFirstMaximal();
391
340
  }
392
341
 
393
- // mk_monomial(x, k): x^k, the unit for k = 0.
394
342
  mkPower(variable: number, power: number) {
395
343
  return power === 0 ? this.unit : this.mkMonomial([variable], [power]);
396
344
  }
@@ -419,7 +367,6 @@ export class PolynomialManager {
419
367
  return this.mkMonomial(vars, degrees);
420
368
  }
421
369
 
422
- // div: m1/m2, or null when m2 does not divide m1.
423
370
  divMonomials(first: Monomial, second: Monomial) {
424
371
  const vars: number[] = [];
425
372
  const degrees: number[] = [];
@@ -439,7 +386,6 @@ export class PolynomialManager {
439
386
  return secondIndex < second.size ? null : this.mkMonomial(vars, degrees);
440
387
  }
441
388
 
442
- // div_x_k: m/x^k.
443
389
  private divXk(monomial: Monomial, variable: number, power: number) {
444
390
  const vars: number[] = [];
445
391
  const degrees: number[] = [];
@@ -455,13 +401,10 @@ export class PolynomialManager {
455
401
  return this.mkMonomial(vars, degrees);
456
402
  }
457
403
 
458
- // div_x: m with x removed.
459
404
  private divX(monomial: Monomial, variable: number) {
460
405
  return this.divXk(monomial, variable, monomial.degreeOf(variable));
461
406
  }
462
407
 
463
- // Construction.
464
-
465
408
  mkPolynomialCore(as: bigint[], ms: Monomial[]) {
466
409
  return new Polynomial(this.nextPolynomialId++, as, ms);
467
410
  }
@@ -482,7 +425,6 @@ export class PolynomialManager {
482
425
  return this.som.mk();
483
426
  }
484
427
 
485
- // mk_linear: sum of as[i]*xs[i] plus c.
486
428
  mkLinear(as: readonly bigint[], vars: readonly number[], constant: bigint) {
487
429
  const coeffs: bigint[] = [];
488
430
  const ms: Monomial[] = [];
@@ -498,8 +440,6 @@ export class PolynomialManager {
498
440
  return this.mkPolynomial(coeffs, ms);
499
441
  }
500
442
 
501
- // Queries.
502
-
503
443
  isZero(polynomial: Polynomial) {
504
444
  return polynomial.size === 0;
505
445
  }
@@ -520,6 +460,15 @@ export class PolynomialManager {
520
460
  return polynomial.size === 0 ? NULL_VAR : polynomial.ms[0].maxVar;
521
461
  }
522
462
 
463
+ getMaxVarOfPolys(polynomials: readonly Polynomial[]) {
464
+ let result = NULL_VAR;
465
+ for (const polynomial of polynomials) {
466
+ const variable = this.maxVar(polynomial);
467
+ if (result === NULL_VAR || variable > result) result = variable;
468
+ }
469
+ return result;
470
+ }
471
+
523
472
  degree(polynomial: Polynomial, variable: number) {
524
473
  let result = 0;
525
474
  for (const monomial of polynomial.ms) result = Math.max(result, monomial.degreeOf(variable));
@@ -532,7 +481,6 @@ export class PolynomialManager {
532
481
  return result;
533
482
  }
534
483
 
535
- // eq: the same monomials with the same coefficients, in any order.
536
484
  eq(first: Polynomial, second: Polynomial) {
537
485
  if (first === second) return true;
538
486
  if (first.size !== second.size) return false;
@@ -546,8 +494,6 @@ export class PolynomialManager {
546
494
  return true;
547
495
  }
548
496
 
549
- // The key of the hash-consing table. It lexicographically sorts the polynomial in place, as Z3's
550
- // hash does.
551
497
  getKey(polynomial: Polynomial) {
552
498
  polynomial.lexSort();
553
499
  let key = "";
@@ -556,9 +502,7 @@ export class PolynomialManager {
556
502
  return key;
557
503
  }
558
504
 
559
- // Arithmetic.
560
-
561
- private addmul(firstCoeff: bigint, first: Polynomial, secondCoeff: bigint, second: Polynomial) {
505
+ addmul(firstCoeff: bigint, first: Polynomial, secondCoeff: bigint, second: Polynomial) {
562
506
  this.som.reset();
563
507
  this.som.addmul(firstCoeff, this.unit, first);
564
508
  this.som.addmul(secondCoeff, this.unit, second);
@@ -581,7 +525,6 @@ export class PolynomialManager {
581
525
  return this.som.mk();
582
526
  }
583
527
 
584
- // mul(a, m, p): a*m*p.
585
528
  mulTerm(coeff: bigint, monomial: Monomial, polynomial: Polynomial) {
586
529
  if (coeff === 0n) return this.zero;
587
530
  if (coeff === 1n && monomial === this.unit) return polynomial;
@@ -606,7 +549,6 @@ export class PolynomialManager {
606
549
  return result;
607
550
  }
608
551
 
609
- // coeff: the coefficient of x^k, a polynomial in the other variables.
610
552
  coeff(polynomial: Polynomial, variable: number, power: number) {
611
553
  for (let index = 0; index < polynomial.size; index++) {
612
554
  const monomial = polynomial.ms[index];
@@ -616,7 +558,6 @@ export class PolynomialManager {
616
558
  return this.cheap.mk();
617
559
  }
618
560
 
619
- // const_coeff: the coefficient of x^k when it is a number, else null.
620
561
  getConstCoeff(polynomial: Polynomial, variable: number, power: number) {
621
562
  let result = 0n;
622
563
  for (let index = 0; index < polynomial.size; index++) {
@@ -642,13 +583,11 @@ export class PolynomialManager {
642
583
  return this.cheap.mk();
643
584
  }
644
585
 
645
- // flip_sign_if_lm_neg: negates p when its graded-lex leading coefficient is negative.
646
586
  flipSignIfLmNeg(polynomial: Polynomial) {
647
587
  if (polynomial.size === 0) return polynomial;
648
588
  return polynomial.as[polynomial.getGradedLexMaxPos()] < 0n ? this.neg(polynomial) : polynomial;
649
589
  }
650
590
 
651
- // ic: the integer content, the gcd of the coefficients.
652
591
  private getIc(polynomial: Polynomial) {
653
592
  if (polynomial.size === 0) return 0n;
654
593
  if (this.isConst(polynomial)) return polynomial.as[0];
@@ -660,7 +599,6 @@ export class PolynomialManager {
660
599
  return result;
661
600
  }
662
601
 
663
- // ic(p, a, c): p = a*c, with the coefficients of c coprime.
664
602
  private icWithContent(polynomial: Polynomial): [bigint, Polynomial] {
665
603
  if (polynomial.size === 0) return [0n, polynomial];
666
604
  if (this.isConst(polynomial)) return [polynomial.as[0], this.one];
@@ -672,7 +610,6 @@ export class PolynomialManager {
672
610
  return [content, this.cheap.mk()];
673
611
  }
674
612
 
675
- // iccp: the integer content, the content and the primitive part of p with respect to x.
676
613
  iccp(polynomial: Polynomial, variable: number): [bigint, Polynomial, Polynomial] {
677
614
  if (polynomial.size === 0) return [0n, this.one, polynomial];
678
615
  if (this.isConst(polynomial)) return [polynomial.as[0], this.one, this.one];
@@ -681,7 +618,6 @@ export class PolynomialManager {
681
618
  const [integer, content] = this.icWithContent(polynomial);
682
619
  return [integer, content, this.one];
683
620
  }
684
- // The quick filter: a power of x that occurs only as a pure power means the content is 1.
685
621
  const filter = Array.from({ length: degree + 1 }, () => 0);
686
622
  const powers: number[] = [];
687
623
  for (const monomial of polynomial.ms) {
@@ -704,8 +640,6 @@ export class PolynomialManager {
704
640
  return this.iccp(polynomial, variable)[2];
705
641
  }
706
642
 
707
- // square_free: the integer content times the square-free parts of the content and the primitive
708
- // part in the maximal variable, or p itself when it is square-free.
709
643
  squareFree(polynomial: Polynomial): Polynomial {
710
644
  if (this.isConst(polynomial)) return polynomial;
711
645
  const variable = this.maxVar(polynomial);
@@ -717,7 +651,6 @@ export class PolynomialManager {
717
651
  return this.mul(this.mulConst(integer, squareFreeContent), squareFreePrimitive);
718
652
  }
719
653
 
720
- // normalize: p divided by the gcd of its coefficients.
721
654
  normalize(polynomial: Polynomial) {
722
655
  if (polynomial.size === 0) return polynomial;
723
656
  let g = 0n;
@@ -728,13 +661,11 @@ export class PolynomialManager {
728
661
  return this.cheap.mk();
729
662
  }
730
663
 
731
- // nonzero_const_coeff: whether the coefficient of x^k is a nonzero number.
732
664
  isNonzeroConstCoeff(polynomial: Polynomial, variable: number, power: number) {
733
665
  const coeff = this.getConstCoeff(polynomial, variable, power);
734
666
  return coeff !== null && coeff !== 0n;
735
667
  }
736
668
 
737
- // exact_div: p/q, where q divides p.
738
669
  exactDiv(polynomial: Polynomial, divisor: Polynomial) {
739
670
  if (polynomial.size === 0) return polynomial;
740
671
  const remainder = this.som;
@@ -759,8 +690,6 @@ export class PolynomialManager {
759
690
  }
760
691
  }
761
692
 
762
- // exact_pseudo_division: Q and R with lc(q)^(deg(p) - deg(q) + 1) * p = Q*q + R. The
763
- // quotient is only built when asked for, as in pseudo_division_core.
764
693
  exactPseudoDivision(
765
694
  polynomial: Polynomial,
766
695
  divisor: Polynomial,
@@ -770,7 +699,6 @@ export class PolynomialManager {
770
699
  return this.pseudoDivisionCore(polynomial, divisor, variable, true, isQuotient);
771
700
  }
772
701
 
773
- // pseudo_remainder: R with lc(q)^d * p = Q*q + R, where d counts the division steps.
774
702
  pseudoRemainder(polynomial: Polynomial, divisor: Polynomial, variable: number) {
775
703
  return this.pseudoDivisionCore(polynomial, divisor, variable, false, false);
776
704
  }
@@ -835,7 +763,6 @@ export class PolynomialManager {
835
763
  return this.exactPseudoDivision(polynomial, divisor, variable, false).remainder;
836
764
  }
837
765
 
838
- // The reduct of coeff(p, x, k, reduct): p without its x^k monomials.
839
766
  reduct(polynomial: Polynomial, variable: number, power: number) {
840
767
  for (let index = 0; index < polynomial.size; index++)
841
768
  if (polynomial.ms[index].degreeOf(variable) !== power)
@@ -843,18 +770,24 @@ export class PolynomialManager {
843
770
  return this.cheap.mk();
844
771
  }
845
772
 
846
- // var_max_degrees, sorted by variable.
847
- private getVarMaxDegrees(polynomial: Polynomial) {
773
+ private getMaxDegrees(polynomial: Polynomial) {
848
774
  const degrees = new Map<number, number>();
849
775
  for (const monomial of polynomial.ms)
850
776
  for (let index = 0; index < monomial.size; index++) {
851
777
  const variable = monomial.vars[index];
852
- degrees.set(variable, Math.max(degrees.get(variable) ?? 0, monomial.degrees[index]));
778
+ if (monomial.degrees[index] > (degrees.get(variable) ?? 0))
779
+ degrees.set(variable, monomial.degrees[index]);
853
780
  }
854
- return [...degrees.entries()].sort((first, second) => first[0] - second[0]);
781
+ return degrees;
782
+ }
783
+
784
+ private getVarMaxDegrees(polynomial: Polynomial) {
785
+ return [...this.getMaxDegrees(polynomial).entries()].sort(
786
+ (first, second) => first[0] - second[0],
787
+ );
855
788
  }
856
789
 
857
- // gcd: the greatest common divisor, with a positive integer content and leading coefficient.
790
+ // Deviation from Z3: subresultant PRS (gcd_prs), not mod_gcd, which can return 2 for coprime inputs (polynomial.cpp:4815).
858
791
  gcd(first: Polynomial, second: Polynomial): Polynomial {
859
792
  if (first.size === 0) return this.flipSignIfLmNeg(second);
860
793
  if (second.size === 0) return this.flipSignIfLmNeg(first);
@@ -875,13 +808,11 @@ export class PolynomialManager {
875
808
  return this.gcdPrs(first, second, firstDegrees[size - 1][0]);
876
809
  }
877
810
 
878
- // gcd_content: gcd(content(u, x), v).
879
811
  private gcdContent(polynomial: Polynomial, variable: number, other: Polynomial) {
880
812
  const [integer, content] = this.iccp(polynomial, variable);
881
813
  return this.gcd(this.mulConst(integer, content), other);
882
814
  }
883
815
 
884
- // gcd_prs: Collins' subresultant polynomial remainder sequence.
885
816
  private gcdPrs(first: Polynomial, second: Polynomial, variable: number) {
886
817
  const [u, v] =
887
818
  this.degree(first, variable) < this.degree(second, variable)
@@ -914,18 +845,10 @@ export class PolynomialManager {
914
845
  }
915
846
  }
916
847
 
917
- // get_min_degree_var: the first variable, in order of occurrence, of minimal degree.
918
848
  private getMinDegreeVar(polynomial: Polynomial) {
919
- const degrees = new Map<number, number>();
920
- for (const monomial of polynomial.ms)
921
- for (let index = 0; index < monomial.size; index++) {
922
- const variable = monomial.vars[index];
923
- if (monomial.degrees[index] > (degrees.get(variable) ?? 0))
924
- degrees.set(variable, monomial.degrees[index]);
925
- }
926
849
  let result = NULL_VAR;
927
850
  let minDegree = Infinity;
928
- for (const [variable, degree] of degrees)
851
+ for (const [variable, degree] of this.getMaxDegrees(polynomial))
929
852
  if (degree < minDegree) {
930
853
  result = variable;
931
854
  minDegree = degree;
@@ -933,8 +856,6 @@ export class PolynomialManager {
933
856
  return result;
934
857
  }
935
858
 
936
- // factor: the constant and the irreducible factors, each with its multiplicity. A square-free
937
- // primitive part of degree 2 or more in its variable of minimal degree is out of scope.
938
859
  factor(polynomial: Polynomial): Factors {
939
860
  const result: Factors = { constant: 1n, factors: [], degrees: [] };
940
861
  if (polynomial.size === 0) result.constant = 0n;
@@ -967,7 +888,6 @@ export class PolynomialManager {
967
888
  }
968
889
  }
969
890
 
970
- // factor_sqf_pp: the factors of a primitive square-free p of positive degree in x.
971
891
  private factorSqfPp(polynomial: Polynomial, variable: number, k: number, result: Factors) {
972
892
  const degree = this.degree(polynomial, variable);
973
893
  if (degree === 1) this.pushFactor(result, polynomial, k);
@@ -982,9 +902,6 @@ export class PolynomialManager {
982
902
  result.degrees.push(k);
983
903
  }
984
904
 
985
- // to_numeral_vector: the coefficients of a univariate p by degree. Z3 normalizes p first but
986
- // reads the coefficients of p itself.
987
- // to_numeral_vector: a univariate p as its coefficients, low to high.
988
905
  toCoeffs(polynomial: Polynomial) {
989
906
  const coeffs = Array.from({ length: this.totalDegree(polynomial) + 1 }, () => 0n);
990
907
  for (let index = 0; index < polynomial.size; index++)
@@ -992,17 +909,15 @@ export class PolynomialManager {
992
909
  return this.um.set(coeffs);
993
910
  }
994
911
 
995
- // to_polynomial, mk_univariate: the monomials from the highest degree down.
996
912
  fromCoeffs(coeffs: readonly bigint[], variable: number) {
997
913
  for (let power = coeffs.length - 1; power >= 0; power--)
998
914
  this.cheap.add(coeffs[power], this.mkPower(variable, power));
999
915
  return this.cheap.mk();
1000
916
  }
1001
917
 
1002
- // factor_sqf_pp_univ
1003
918
  private factorSqfPpUniv(polynomial: Polynomial, k: number, result: Factors) {
1004
919
  const variable = this.maxVar(polynomial);
1005
- const fs: UpolynomialFactors = { constant: 1n, factors: [], degrees: [] };
920
+ const fs = mkFactors();
1006
921
  factorSquareFree(this.um, this.toCoeffs(polynomial), fs, 1, DEFAULT_FACTOR_PARAMS);
1007
922
  if (fs.factors.length === 1 && fs.degrees[0] === 1) {
1008
923
  this.pushFactor(result, polynomial, k);
@@ -1013,8 +928,6 @@ export class PolynomialManager {
1013
928
  if (fs.constant === -1n && k % 2 === 1) result.constant = -result.constant;
1014
929
  }
1015
930
 
1016
- // factor_2_sqf_pp: a*x^2 + b*x + c splits into the primitive parts of 2*a*x + b -/+ sqrt(disc)
1017
- // when the discriminant b^2 - 4*a*c is a square.
1018
931
  private factorQuadratic(polynomial: Polynomial, variable: number, k: number, result: Factors) {
1019
932
  let a = this.coeff(polynomial, variable, 2);
1020
933
  let b = this.coeff(polynomial, variable, 1);
@@ -1036,15 +949,12 @@ export class PolynomialManager {
1036
949
  this.pushFactor(result, this.pp(this.add(linear, root), variable), k);
1037
950
  }
1038
951
 
1039
- // is_perfect_square for the monomial at a position: the square root of its coefficient when the
1040
- // whole term is a square.
1041
952
  private getTermSquareRoot(polynomial: Polynomial, position: number) {
1042
953
  const monomial = polynomial.ms[position];
1043
954
  if (monomial.degrees.some((degree) => degree % 2 === 1)) return null;
1044
955
  return getExactSquareRoot(polynomial.as[position]);
1045
956
  }
1046
957
 
1047
- // sqrt: the square root of p with a positive graded-lex leading coefficient, or null.
1048
958
  sqrt(polynomial: Polynomial) {
1049
959
  if (polynomial.size === 0) return polynomial;
1050
960
  if (this.getTermSquareRoot(polynomial, this.getGradedLexMinPos(polynomial)) === null)
@@ -1088,7 +998,6 @@ export class PolynomialManager {
1088
998
  }
1089
999
  }
1090
1000
 
1091
- // graded_lex_min_pos
1092
1001
  private getGradedLexMinPos(polynomial: Polynomial) {
1093
1002
  let minPos = 0;
1094
1003
  for (let index = 1; index < polynomial.size; index++)
@@ -1096,8 +1005,6 @@ export class PolynomialManager {
1096
1005
  return minPos;
1097
1006
  }
1098
1007
 
1099
- // vars: the variables of p in order of occurrence.
1100
- // vars: the variables of p in the order they first occur.
1101
1008
  getVars(polynomial: Polynomial) {
1102
1009
  const vars: number[] = [];
1103
1010
  for (const monomial of polynomial.ms)
@@ -1105,7 +1012,6 @@ export class PolynomialManager {
1105
1012
  return vars;
1106
1013
  }
1107
1014
 
1108
- // substitute: p with each xs[i] replaced by the integer values[i].
1109
1015
  substitute(polynomial: Polynomial, vars: readonly number[], values: readonly bigint[]) {
1110
1016
  this.som.reset();
1111
1017
  for (let index = 0; index < polynomial.size; index++) {
@@ -1125,7 +1031,6 @@ export class PolynomialManager {
1125
1031
  return this.som.mk();
1126
1032
  }
1127
1033
 
1128
- // translate: p(x + v), by Horner on the coefficients of p in x.
1129
1034
  translate(polynomial: Polynomial, variable: number, value: bigint) {
1130
1035
  const degree = this.degree(polynomial, variable);
1131
1036
  if (degree === 0 || value === 0n) return polynomial;
@@ -1146,18 +1051,8 @@ export class PolynomialManager {
1146
1051
  return this.som.mk();
1147
1052
  }
1148
1053
 
1149
- // substitute(p, x2v): p with the rational values of its assigned variables, each term scaled by
1150
- // the denominators to the maximal degree of their variable, and the content divided out. p itself
1151
- // when it has no assigned variable.
1152
1054
  substituteRational(polynomial: Polynomial, values: readonly (Rational | undefined)[]) {
1153
- // Map keeps the order in which the variables first occur, as var_max_degree does.
1154
- const maxDegrees = new Map<number, number>();
1155
- for (const monomial of polynomial.ms)
1156
- for (let index = 0; index < monomial.size; index++) {
1157
- const variable = monomial.vars[index];
1158
- if (monomial.degrees[index] > (maxDegrees.get(variable) ?? 0))
1159
- maxDegrees.set(variable, monomial.degrees[index]);
1160
- }
1055
+ const maxDegrees = this.getMaxDegrees(polynomial);
1161
1056
  if (![...maxDegrees.keys()].some((variable) => values[variable] !== undefined))
1162
1057
  return polynomial;
1163
1058
  this.som.reset();
@@ -1189,7 +1084,6 @@ export class PolynomialManager {
1189
1084
  return this.som.mk(true);
1190
1085
  }
1191
1086
 
1192
- // muladd: p*q + a.
1193
1087
  private muladd(first: Polynomial, second: Polynomial, constant: bigint) {
1194
1088
  if (first.size === 0 || second.size === 0) return this.mkConst(constant);
1195
1089
  this.som.reset();
@@ -1199,7 +1093,6 @@ export class PolynomialManager {
1199
1093
  return this.som.mk();
1200
1094
  }
1201
1095
 
1202
- // compose: p(q) for a univariate p, by Horner.
1203
1096
  private compose(polynomial: Polynomial, inner: Polynomial) {
1204
1097
  if (this.isConst(polynomial)) return polynomial;
1205
1098
  const variable = this.maxVar(polynomial);
@@ -1213,14 +1106,12 @@ export class PolynomialManager {
1213
1106
  return result;
1214
1107
  }
1215
1108
 
1216
- // compose_x_minus_y: p(x - y) for a univariate p in x.
1217
1109
  composeXMinusY(polynomial: Polynomial, variable: number) {
1218
1110
  const x = this.maxVar(polynomial);
1219
1111
  if (variable === x) return this.coeff(polynomial, x, 0);
1220
1112
  return this.compose(polynomial, this.mkLinear([1n, -1n], [x, variable], 0n));
1221
1113
  }
1222
1114
 
1223
- // compose_x_div_y: y^n * p(x/y) for a univariate p in x of degree n.
1224
1115
  composeXDivY(polynomial: Polynomial, variable: number) {
1225
1116
  if (this.isConst(polynomial)) return polynomial;
1226
1117
  const x = this.maxVar(polynomial);
@@ -1249,7 +1140,6 @@ export class PolynomialManager {
1249
1140
  return this.cheap.mk();
1250
1141
  }
1251
1142
 
1252
- // resultant: Res(p, q) in x, by the subresultant PRS on the primitive parts, times the contents.
1253
1143
  resultant(first: Polynomial, second: Polynomial, variable: number) {
1254
1144
  if (first.size === 0 || second.size === 0) return this.zero;
1255
1145
  if (this.isConst(first))
@@ -1302,10 +1192,6 @@ export class PolynomialManager {
1302
1192
  return this.eq(polynomial, this.pp(polynomial, variable));
1303
1193
  }
1304
1194
 
1305
- // factor_n_sqf_pp, try_multivar_factor: reduces p to two variables by evaluating the others,
1306
- // factors it at a point of the lifting variable, lifts a split of the univariate factors with
1307
- // Hensel's lemma and keeps it when the lifted factors multiply back to p. Returns false when no
1308
- // split lifts, leaving p unfactored.
1309
1195
  private factorMultivariate(polynomial: Polynomial, x: number, k: number, result: Factors) {
1310
1196
  const allVars = this.getVars(polynomial);
1311
1197
  const mainVars = [
@@ -1347,7 +1233,7 @@ export class PolynomialManager {
1347
1233
  if (!this.isUnivariate(univariate)) continue;
1348
1234
  if (this.degree(univariate, mainVar) !== degMain) continue;
1349
1235
  if (!this.isSquareFreeIn(univariate, mainVar)) continue;
1350
- const univariateFs: UpolynomialFactors = { constant: 1n, factors: [], degrees: [] };
1236
+ const univariateFs = mkFactors();
1351
1237
  factorSquareFree(
1352
1238
  this.um,
1353
1239
  this.um.getPrimitive(this.toCoeffs(univariate)),
@@ -1415,7 +1301,6 @@ export class PolynomialManager {
1415
1301
  return false;
1416
1302
  }
1417
1303
 
1418
- // The factors of a lifted part, splitting only linear and quadratic ones further.
1419
1304
  private pushSmallFactor(polynomial: Polynomial, x: number, k: number, result: Factors) {
1420
1305
  const degree = this.degree(polynomial, x);
1421
1306
  if (degree === 2 && this.isPrimitive(polynomial, x) && this.isSquareFreeIn(polynomial, x))
@@ -1428,9 +1313,6 @@ export class PolynomialManager {
1428
1313
  return polynomial.as[0] ?? 0n;
1429
1314
  }
1430
1315
 
1431
- // try_bivar_hensel_lift: lifts q(x, 0) = lc * h1 * h2 to q = F1 * F2 in Z_p[x][y] by linear
1432
- // Hensel lifting on the coefficients of y, then reads F1 and F2 back over Z. Null when h1 and h2
1433
- // are not coprime in Z_p, q is not bivariate, or the product of the lifted factors is not q.
1434
1316
  private liftBivariate(
1435
1317
  q: Polynomial,
1436
1318
  x: number,
@@ -1486,9 +1368,6 @@ export class PolynomialManager {
1486
1368
  return this.eq(this.mul(first, second), q) ? [first, second] : null;
1487
1369
  }
1488
1370
 
1489
- // psc_chain: the nonzero principal subresultant coefficients of p and q in x, the resultant
1490
- // first, or [0] when there are none. psc_chain_optimized: Ducos's subresultant chain with
1491
- // Lazard's dichotomous S_e.
1492
1371
  pscChain(first: Polynomial, second: Polynomial, variable: number) {
1493
1372
  const chain =
1494
1373
  this.degree(first, variable) >= this.degree(second, variable)
@@ -1505,7 +1384,6 @@ export class PolynomialManager {
1505
1384
  while (b.size > 0) {
1506
1385
  const d = this.degree(a, x);
1507
1386
  const e = this.degree(b, x);
1508
- // b is S_{d-1}.
1509
1387
  const principal = this.coeff(b, x, d - 1);
1510
1388
  if (principal.size > 0) chain.push(principal);
1511
1389
  let c = b;
@@ -1522,7 +1400,6 @@ export class PolynomialManager {
1522
1400
  return chain;
1523
1401
  }
1524
1402
 
1525
- // Se_Lazard: S_e from S_{d-1} and lc(S_d) by dichotomous Lazard.
1526
1403
  private getSeLazard(d: number, lcSd: Polynomial, sd1: Polynomial, x: number) {
1527
1404
  let n = d - this.degree(sd1, x) - 1;
1528
1405
  if (n === 0) return sd1;
@@ -1541,7 +1418,6 @@ export class PolynomialManager {
1541
1418
  return this.exactDiv(this.mul(c, sd1), lcSd);
1542
1419
  }
1543
1420
 
1544
- // optimized_S_e_1: S_{e-1} from A = S_{d+1}, S_{d-1}, S_e and s = lc(S_d).
1545
1421
  private getOptimizedSe1(
1546
1422
  d: number,
1547
1423
  e: number,
@@ -1573,10 +1449,6 @@ export class PolynomialManager {
1573
1449
  return (d - e + 1) % 2 === 1 ? this.neg(result) : result;
1574
1450
  }
1575
1451
 
1576
- // Evaluation.
1577
-
1578
- // t_eval: p at the values of its variables, by Horner on the lexicographically sorted monomials,
1579
- // which sorts p in place as Z3 does.
1580
1452
  evaluateWith<T>(polynomial: Polynomial, ops: ValueOps<T>, getValue: (variable: number) => T) {
1581
1453
  if (polynomial.size === 0) return ops.fromInteger(0n);
1582
1454
  if (this.isConst(polynomial)) return ops.fromInteger(polynomial.as[0]);
@@ -1591,7 +1463,6 @@ export class PolynomialManager {
1591
1463
  );
1592
1464
  }
1593
1465
 
1594
- // t_eval_core: the monomials in [start, end), ignoring the variables above x.
1595
1466
  private evaluateCore<T>(
1596
1467
  polynomial: Polynomial,
1597
1468
  ops: ValueOps<T>,
@@ -1647,7 +1518,6 @@ export class PolynomialManager {
1647
1518
  return result;
1648
1519
  }
1649
1520
 
1650
- // max_smaller_than: the largest variable below x in the monomials in [start, end).
1651
1521
  private maxSmallerThan(polynomial: Polynomial, start: number, end: number, x: number) {
1652
1522
  let max = NULL_VAR;
1653
1523
  for (let index = start; index < end; index++)
@@ -1669,7 +1539,6 @@ export class PolynomialManager {
1669
1539
  }
1670
1540
  }
1671
1541
 
1672
- // polynomial::cache: hash-conses polynomials and memoizes their subresultants and factors.
1673
1542
  export class PolynomialCache {
1674
1543
  private table = new Map<string, Polynomial>();
1675
1544
  private inCache = new Set<number>();
@@ -1710,7 +1579,6 @@ export class PolynomialCache {
1710
1579
  return chain;
1711
1580
  }
1712
1581
 
1713
- // factor: the distinct factors, without the constant.
1714
1582
  factor(polynomial: Polynomial) {
1715
1583
  const unique = this.mkUnique(polynomial);
1716
1584
  const cached = this.factorizations.get(unique.id);