tla-ts 0.0.8-dev.d9bffda → 0.0.9-dev.0493be549

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 (390) hide show
  1. package/README.md +30 -0
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +28 -28
  5. package/dist/deciders.js +43 -43
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +80 -10
  8. package/dist/index.d.ts +80 -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 +116 -36
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +128 -103
  21. package/dist/transfer.js +128 -103
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +7 -21
  26. package/src/bags.ts +99 -99
  27. package/src/builtins.ts +44 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check.ts +605 -311
  30. package/src/cli/options.ts +12 -6
  31. package/src/cli/run.ts +2 -2
  32. package/src/cli/runtime-invariants.ts +135 -0
  33. package/src/cli/shared.ts +20 -9
  34. package/src/cli/tlapm.ts +0 -12
  35. package/src/cli/tlc-arguments.ts +646 -0
  36. package/src/cli/tlc-usage.ts +362 -0
  37. package/src/cli/tlc.ts +545 -218
  38. package/src/cli/typescript.ts +23 -0
  39. package/src/cli/xml-exporter.ts +4 -16
  40. package/src/cli.ts +0 -1
  41. package/src/codegen.ts +191 -64
  42. package/src/config.ts +140 -109
  43. package/src/coverage.ts +837 -0
  44. package/src/dependencies.ts +6 -40
  45. package/src/dfid.ts +618 -0
  46. package/src/environment.ts +240 -118
  47. package/src/errors.ts +70 -55
  48. package/src/evaluate.ts +632 -298
  49. package/src/exit-codes.ts +37 -3
  50. package/src/fingerprints.ts +10 -10
  51. package/src/index.ts +3 -0
  52. package/src/instances.ts +79 -11
  53. package/src/java-overrides.ts +2 -12
  54. package/src/json-reader.ts +456 -0
  55. package/src/json.ts +262 -139
  56. package/src/levels.ts +2 -3
  57. package/src/lexer.ts +17 -26
  58. package/src/liveness-checker.ts +10 -18
  59. package/src/liveness.ts +121 -49
  60. package/src/obligations/action.ts +4 -28
  61. package/src/obligations/anonymize.ts +84 -80
  62. package/src/obligations/equality.ts +1 -1
  63. package/src/obligations/expression.ts +2 -19
  64. package/src/obligations/format.ts +1 -9
  65. package/src/obligations/generate.ts +1 -11
  66. package/src/obligations/index.ts +0 -11
  67. package/src/obligations/levels.ts +4 -8
  68. package/src/obligations/module.ts +1 -15
  69. package/src/obligations/normalize.ts +5 -24
  70. package/src/obligations/operators.ts +1 -2
  71. package/src/obligations/pragma.ts +1 -10
  72. package/src/obligations/printer.ts +47 -46
  73. package/src/obligations/proof.ts +1 -5
  74. package/src/obligations/regroup.ts +1 -4
  75. package/src/obligations/simplify.ts +3 -14
  76. package/src/obligations/source.ts +1 -21
  77. package/src/obligations/subexpression.ts +5 -11
  78. package/src/obligations/substitution.ts +1 -3
  79. package/src/obligations/temporal.ts +8 -14
  80. package/src/obligations/tuples.ts +3 -9
  81. package/src/parallel-worker.ts +31 -38
  82. package/src/parallel.ts +41 -17
  83. package/src/parser.ts +436 -90
  84. package/src/pcal/ast.ts +7 -28
  85. package/src/pcal/parse.ts +11 -39
  86. package/src/pcal/tokenize.ts +4 -20
  87. package/src/pcal/translate.ts +10 -42
  88. package/src/pcal/validate.ts +3 -21
  89. package/src/pretty-print.ts +1 -2
  90. package/src/prover/decide-pool.ts +5 -10
  91. package/src/prover/deciders.ts +0 -4
  92. package/src/prover/first-order.ts +0 -11
  93. package/src/prover/isabelle/decide.ts +0 -6
  94. package/src/prover/isabelle/encode.ts +11 -23
  95. package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
  96. package/src/prover/isabelle/isar/method.ts +25 -38
  97. package/src/prover/isabelle/isar/proof.ts +1 -10
  98. package/src/prover/isabelle/isar/statement.ts +1 -6
  99. package/src/prover/isabelle/isar/theory.ts +15 -26
  100. package/src/prover/isabelle/isar/type-check.ts +11 -25
  101. package/src/prover/isabelle/provers/blast/blast.ts +10 -41
  102. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  103. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  104. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  105. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  106. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  107. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  108. package/src/prover/isabelle/provers/classical.ts +14 -42
  109. package/src/prover/isabelle/provers/hypsubst.ts +11 -25
  110. package/src/prover/isabelle/pure/bicompose.ts +16 -13
  111. package/src/prover/isabelle/pure/consts.ts +1 -7
  112. package/src/prover/isabelle/pure/conv.ts +1 -9
  113. package/src/prover/isabelle/pure/drule.ts +24 -40
  114. package/src/prover/isabelle/pure/envir.ts +3 -52
  115. package/src/prover/isabelle/pure/goal.ts +1 -7
  116. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  117. package/src/prover/isabelle/pure/list.ts +0 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -14
  119. package/src/prover/isabelle/pure/name.ts +2 -9
  120. package/src/prover/isabelle/pure/net.ts +3 -59
  121. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  122. package/src/prover/isabelle/pure/pattern.ts +2 -19
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
  124. package/src/prover/isabelle/pure/rewriter.ts +26 -58
  125. package/src/prover/isabelle/pure/search.ts +3 -10
  126. package/src/prover/isabelle/pure/seq.ts +1 -10
  127. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  128. package/src/prover/isabelle/pure/table.ts +1 -31
  129. package/src/prover/isabelle/pure/tactic.ts +12 -22
  130. package/src/prover/isabelle/pure/tactical.ts +6 -12
  131. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  132. package/src/prover/isabelle/pure/term.ts +2 -43
  133. package/src/prover/isabelle/pure/thm.ts +13 -36
  134. package/src/prover/isabelle/pure/type.ts +2 -15
  135. package/src/prover/isabelle/pure/unify.ts +20 -30
  136. package/src/prover/isabelle/pure/variable.ts +3 -7
  137. package/src/prover/isabelle/tla/classical-setup.ts +9 -19
  138. package/src/prover/isabelle/tla/context.ts +8 -16
  139. package/src/prover/isabelle/tla/logic.ts +4 -11
  140. package/src/prover/isabelle/tla/simpdata.ts +46 -34
  141. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  142. package/src/prover/ocaml.ts +0 -6
  143. package/src/prover/prep/action.ts +4 -36
  144. package/src/prover/prep/enabled-axioms.ts +12 -19
  145. package/src/prover/prep/fingerprint.ts +0 -16
  146. package/src/prover/prep/level-comparison.ts +8 -12
  147. package/src/prover/prep/md5.ts +0 -2
  148. package/src/prover/prep/methods.ts +9 -36
  149. package/src/prover/prep/normalize.ts +4 -28
  150. package/src/prover/prove-worker.ts +0 -2
  151. package/src/prover/prove.ts +0 -36
  152. package/src/prover/ptl/decide.ts +7 -12
  153. package/src/prover/ptl/encode.ts +14 -36
  154. package/src/prover/ptl/sat.ts +24 -32
  155. package/src/prover/ptl/tableau.ts +12 -26
  156. package/src/prover/smt/axioms.ts +0 -7
  157. package/src/prover/smt/context.ts +19 -26
  158. package/src/prover/smt/data.ts +51 -54
  159. package/src/prover/smt/encode.ts +14 -35
  160. package/src/prover/smt/extensionality.ts +0 -10
  161. package/src/prover/smt/flatten.ts +3 -22
  162. package/src/prover/smt/format.ts +5 -10
  163. package/src/prover/smt/instances.ts +0 -10
  164. package/src/prover/smt/rewrite.ts +66 -101
  165. package/src/prover/smt/solver/act-cache.ts +0 -15
  166. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  167. package/src/prover/smt/solver/array.ts +1 -3
  168. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  169. package/src/prover/smt/solver/ast-lt.ts +1 -11
  170. package/src/prover/smt/solver/ast-util.ts +1 -6
  171. package/src/prover/smt/solver/ast.ts +1 -143
  172. package/src/prover/smt/solver/auf-solver.ts +6 -39
  173. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  174. package/src/prover/smt/solver/cg-table.ts +1 -18
  175. package/src/prover/smt/solver/clause.ts +1 -27
  176. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  177. package/src/prover/smt/solver/context.ts +4 -61
  178. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  179. package/src/prover/smt/solver/der.ts +2 -21
  180. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  181. package/src/prover/smt/solver/e-matching.ts +3 -34
  182. package/src/prover/smt/solver/enode.ts +1 -21
  183. package/src/prover/smt/solver/expr-ref.ts +1 -5
  184. package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
  185. package/src/prover/smt/solver/fingerprints.ts +1 -12
  186. package/src/prover/smt/solver/flat-literals.ts +1 -9
  187. package/src/prover/smt/solver/goal.ts +2 -14
  188. package/src/prover/smt/solver/hash.ts +0 -8
  189. package/src/prover/smt/solver/hashtable.ts +1 -12
  190. package/src/prover/smt/solver/internalizer.ts +6 -98
  191. package/src/prover/smt/solver/lbool.ts +1 -2
  192. package/src/prover/smt/solver/literal.ts +0 -3
  193. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  194. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  195. package/src/prover/smt/solver/lp/containers.ts +12 -30
  196. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  197. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  198. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  199. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  200. package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
  201. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  202. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  203. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  204. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  205. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  206. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  207. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  208. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  209. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  210. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  211. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  212. package/src/prover/smt/solver/lp/nex.ts +1 -6
  213. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  214. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  215. package/src/prover/smt/solver/lp/nla-core.ts +35 -130
  216. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  217. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  218. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  220. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  221. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  222. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  223. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  224. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  225. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  226. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  227. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  228. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  229. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  230. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  231. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  232. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  233. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  234. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  235. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  236. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  237. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  238. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  239. package/src/prover/smt/solver/mam-compiler.ts +14 -56
  240. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  241. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  242. package/src/prover/smt/solver/model-checker.ts +2 -36
  243. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  244. package/src/prover/smt/solver/model-finder.ts +3 -15
  245. package/src/prover/smt/solver/model-generator.ts +1 -12
  246. package/src/prover/smt/solver/model-macro-solver.ts +12 -69
  247. package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
  248. package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
  249. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  250. package/src/prover/smt/solver/nlsat/explain.ts +3 -47
  251. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  252. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
  253. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  254. package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
  255. package/src/prover/smt/solver/nlsat/solver.ts +7 -67
  256. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  257. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
  258. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  259. package/src/prover/smt/solver/nnf.ts +3 -38
  260. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  261. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  262. package/src/prover/smt/solver/propagate-values.ts +1 -10
  263. package/src/prover/smt/solver/proto-model.ts +3 -48
  264. package/src/prover/smt/solver/pull-quant.ts +1 -12
  265. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  266. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  267. package/src/prover/smt/solver/qe-lite.ts +3 -33
  268. package/src/prover/smt/solver/qi-queue.ts +1 -16
  269. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  270. package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
  271. package/src/prover/smt/solver/quantifier-manager.ts +1 -8
  272. package/src/prover/smt/solver/random-gen.ts +1 -2
  273. package/src/prover/smt/solver/rational.ts +1 -8
  274. package/src/prover/smt/solver/ref-vector.ts +1 -6
  275. package/src/prover/smt/solver/relevancy.ts +2 -15
  276. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  277. package/src/prover/smt/solver/rewriter.ts +3 -85
  278. package/src/prover/smt/solver/rlimit.ts +2 -20
  279. package/src/prover/smt/solver/smtlib-parser.ts +2 -37
  280. package/src/prover/smt/solver/solver.ts +23 -34
  281. package/src/prover/smt/solver/sort.ts +1 -5
  282. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  283. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  284. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
  285. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  286. package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
  287. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  288. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  289. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  290. package/src/prover/smt/solver/theory-lra.ts +1 -8
  291. package/src/prover/smt/solver/var-subst.ts +2 -26
  292. package/src/prover/smt/table.ts +0 -8
  293. package/src/prover/tlapm/cache.ts +20 -25
  294. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  295. package/src/prover/tlapm/tlapm.ts +12 -17
  296. package/src/prover/verdict.ts +0 -2
  297. package/src/prover/zenon/check/check.ts +0 -9
  298. package/src/prover/zenon/check/definitions.ts +5 -15
  299. package/src/prover/zenon/check/equality.ts +0 -8
  300. package/src/prover/zenon/check/functions.ts +0 -4
  301. package/src/prover/zenon/check/keys.ts +0 -7
  302. package/src/prover/zenon/check/propositional.ts +0 -3
  303. package/src/prover/zenon/check/records.ts +0 -5
  304. package/src/prover/zenon/check/relations.ts +0 -13
  305. package/src/prover/zenon/check/rewrites.ts +0 -6
  306. package/src/prover/zenon/check/sets.ts +0 -3
  307. package/src/prover/zenon/check/terms.ts +0 -17
  308. package/src/prover/zenon/check/tla.ts +0 -6
  309. package/src/prover/zenon/decide.ts +0 -12
  310. package/src/prover/zenon/encode.ts +1 -8
  311. package/src/prover/zenon/eqrel.ts +0 -13
  312. package/src/prover/zenon/equality-rules.ts +0 -4
  313. package/src/prover/zenon/expr.ts +1 -26
  314. package/src/prover/zenon/index-table.ts +17 -38
  315. package/src/prover/zenon/isar-case.ts +9 -19
  316. package/src/prover/zenon/isar.ts +1 -29
  317. package/src/prover/zenon/limits.ts +0 -4
  318. package/src/prover/zenon/llproof.ts +0 -9
  319. package/src/prover/zenon/mltoll.ts +54 -76
  320. package/src/prover/zenon/node.ts +1 -11
  321. package/src/prover/zenon/ocaml.ts +1 -17
  322. package/src/prover/zenon/parse.ts +2 -7
  323. package/src/prover/zenon/phrase.ts +1 -11
  324. package/src/prover/zenon/proof.ts +0 -9
  325. package/src/prover/zenon/propositional-rules.ts +0 -5
  326. package/src/prover/zenon/rules.ts +2 -6
  327. package/src/prover/zenon/search.ts +1 -17
  328. package/src/prover/zenon/tla/functions.ts +57 -29
  329. package/src/prover/zenon/tla/llproof.ts +63 -70
  330. package/src/prover/zenon/tla/records.ts +56 -27
  331. package/src/prover/zenon/tla/rewrites.ts +12 -19
  332. package/src/prover/zenon/tla/sets.ts +68 -39
  333. package/src/prover/zenon/tla/terms.ts +0 -6
  334. package/src/prover/zenon/tla/tla.ts +59 -58
  335. package/src/randomization.ts +84 -35
  336. package/src/resolve.ts +18 -60
  337. package/src/runtime.ts +11 -4
  338. package/src/sany/builtins.ts +3 -4
  339. package/src/sany/generator.ts +128 -176
  340. package/src/sany/levels.ts +6 -30
  341. package/src/sany/lexer.ts +7 -23
  342. package/src/sany/linter.ts +31 -29
  343. package/src/sany/modules.ts +1 -5
  344. package/src/sany/nodes.ts +0 -31
  345. package/src/sany/parse-error.ts +39 -117
  346. package/src/sany/report.ts +29 -63
  347. package/src/sany/selectors.ts +15 -39
  348. package/src/sany/source.ts +1 -17
  349. package/src/sany/xml.ts +13 -63
  350. package/src/search.ts +533 -174
  351. package/src/simulate.ts +694 -0
  352. package/src/spec-description.ts +166 -48
  353. package/src/standard-definitions.ts +2 -3
  354. package/src/standard-modules.ts +264 -68
  355. package/src/state-graph.ts +51 -18
  356. package/src/subexpressions.ts +31 -5
  357. package/src/substitution-levels.ts +2 -3
  358. package/src/successors.ts +267 -77
  359. package/src/symmetry.ts +31 -8
  360. package/src/tableau.ts +27 -24
  361. package/src/tlc/fingerprint.ts +183 -61
  362. package/src/tlc/jar-data.ts +113 -6
  363. package/src/tlc/messages.ts +122 -37
  364. package/src/tlc/order.ts +33 -38
  365. package/src/tlc/random.ts +16 -16
  366. package/src/tlc/replay.ts +563 -211
  367. package/src/tlc/summary.ts +2 -4
  368. package/src/tlc/tlc-operators.ts +81 -36
  369. package/src/tlc/tlcext-operators.ts +138 -117
  370. package/src/tlc/trace-spec.ts +273 -0
  371. package/src/tlc/value-stream.ts +143 -0
  372. package/src/tlc/version.ts +2 -4
  373. package/src/transfer.ts +22 -25
  374. package/src/typescript/actions.ts +481 -0
  375. package/src/typescript/collections.ts +600 -0
  376. package/src/typescript/compile.ts +65 -0
  377. package/src/typescript/context.ts +94 -0
  378. package/src/typescript/emit.ts +121 -0
  379. package/src/typescript/expressions.ts +496 -0
  380. package/src/typescript/formula.ts +152 -0
  381. package/src/typescript/functions.ts +284 -0
  382. package/src/typescript/model.ts +163 -0
  383. package/src/typescript/names.ts +114 -0
  384. package/src/typescript/program.ts +48 -0
  385. package/src/typescript/properties.ts +139 -0
  386. package/src/typescript/scope.ts +112 -0
  387. package/src/typescript/steps.ts +165 -0
  388. package/src/typescript/types.ts +171 -0
  389. package/src/values.ts +832 -255
  390. package/src/worker.ts +7 -8
@@ -1,26 +1,8 @@
1
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.
2
+ // MIT license, see z3-license.txt.
21
3
  import { SmtInvariantError } from "../../../../errors";
22
4
  import { getGcd, Rational } from "../rational";
23
- import { UpolynomialManager } from "./upolynomial";
5
+ import { floorDiv, UpolynomialManager } from "./upolynomial";
24
6
  import {
25
7
  DEFAULT_FACTOR_PARAMS,
26
8
  factorSquareFree,
@@ -30,21 +12,9 @@ import {
30
12
 
31
13
  export const NULL_VAR = -1;
32
14
 
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
15
  const FACTOR_EVAL_VALUES = [0n, 1n, -1n, 2n, -2n, 3n, -3n];
36
16
  const FACTOR_PRIMES = [39103n, 104729n, 1000003n, 100000007n];
37
17
 
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
18
  export interface ValueOps<T> {
49
19
  fromInteger(value: bigint): T;
50
20
  add(first: T, second: T): T;
@@ -65,7 +35,6 @@ const getMonomialKey = (vars: readonly number[], degrees: readonly number[]) =>
65
35
  class Monomial {
66
36
  readonly totalDegree: number;
67
37
 
68
- // vars and degrees change only when the manager renames the variables.
69
38
  constructor(
70
39
  readonly id: number,
71
40
  public vars: readonly number[],
@@ -93,7 +62,6 @@ class Monomial {
93
62
  return index === -1 ? 0 : this.degrees[index];
94
63
  }
95
64
 
96
- // max_smaller_than: the largest variable of the monomial below x.
97
65
  maxSmallerThan(variable: number) {
98
66
  let result = NULL_VAR;
99
67
  for (const current of this.vars) if (current < variable) result = current;
@@ -101,7 +69,6 @@ class Monomial {
101
69
  }
102
70
  }
103
71
 
104
- // lex_compare: the biggest variable dominates, then its degree.
105
72
  const lexCompare = (first: Monomial, second: Monomial) => {
106
73
  if (first === second) return 0;
107
74
  let firstIndex = first.size - 1;
@@ -131,7 +98,6 @@ const gradedLexCompare = (first: Monomial, second: Monomial) =>
131
98
  ? -1
132
99
  : 1;
133
100
 
134
- // po_gt: the order that puts a monomial with the maximal variable at its maximal degree first.
135
101
  const isPoGreater = (first: Monomial, second: Monomial) => {
136
102
  if (first.size === 0) return false;
137
103
  if (second.size === 0) return true;
@@ -150,7 +116,6 @@ export class Polynomial {
150
116
  this.makeFirstMaximal();
151
117
  }
152
118
 
153
- // make_first_maximal: a monomial with the maximal variable at its maximal degree first.
154
119
  makeFirstMaximal() {
155
120
  if (this.ms.length <= 1) return;
156
121
  let maxPos = 0;
@@ -174,8 +139,7 @@ export class Polynomial {
174
139
  this.ms[position] = monomial;
175
140
  }
176
141
 
177
- // lex_sort: puts the monomials in decreasing lexicographic order, which Z3 does in place whenever it
178
- // hashes the polynomial.
142
+ // Z3 sorts in place whenever it hashes or evaluates the polynomial, so later reads see this order.
179
143
  lexSort() {
180
144
  if (this.isLexSorted) return;
181
145
  this.isLexSorted = true;
@@ -190,7 +154,6 @@ export class Polynomial {
190
154
  }
191
155
  }
192
156
 
193
- // graded_lex_max_pos
194
157
  getGradedLexMaxPos() {
195
158
  if (this.ms.length === 0) return -1;
196
159
  let maxPos = 0;
@@ -214,8 +177,6 @@ export class Polynomial {
214
177
  }
215
178
  }
216
179
 
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
180
  class SomBuffer {
220
181
  as: bigint[] = [];
221
182
  ms: Monomial[] = [];
@@ -253,7 +214,6 @@ class SomBuffer {
253
214
  }
254
215
  }
255
216
 
256
- // addmul: adds a*m*p.
257
217
  addmul(coeff: bigint, monomial: Monomial, polynomial: Polynomial) {
258
218
  if (coeff === 0n) return;
259
219
  for (let index = 0; index < polynomial.size; index++) {
@@ -267,8 +227,7 @@ class SomBuffer {
267
227
  }
268
228
  }
269
229
 
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.
230
+ // Like Z3, zero entries of the other buffer are added too, which keeps their monomials' positions.
272
231
  addmulBuffer(coeff: bigint, monomial: Monomial, buffer: SomBuffer) {
273
232
  if (coeff === 0n) return;
274
233
  for (let index = 0; index < buffer.ms.length; index++) {
@@ -291,7 +250,6 @@ class SomBuffer {
291
250
  return maxPos;
292
251
  }
293
252
 
294
- // mk(normalize): the nonzero entries, divided by the gcd of their coefficients when normalizing.
295
253
  mk(isNormalized = false) {
296
254
  const as: bigint[] = [];
297
255
  const ms: Monomial[] = [];
@@ -306,7 +264,6 @@ class SomBuffer {
306
264
  }
307
265
  }
308
266
 
309
- // cheap_som_buffer: each monomial is added at most once, so it needs no position map.
310
267
  class CheapSomBuffer {
311
268
  private as: bigint[] = [];
312
269
  private ms: Monomial[] = [];
@@ -358,8 +315,6 @@ export class PolynomialManager {
358
315
  this.one = this.mkPolynomialCore([1n], [this.unit]);
359
316
  }
360
317
 
361
- // Monomials.
362
-
363
318
  mkMonomial(vars: readonly number[], degrees: readonly number[]) {
364
319
  const key = getMonomialKey(vars, degrees);
365
320
  const existing = this.monomials.get(key);
@@ -369,10 +324,6 @@ export class PolynomialManager {
369
324
  return monomial;
370
325
  }
371
326
 
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
327
  rename(permutation: readonly number[], polynomials: Iterable<Polynomial>) {
377
328
  const monomials = new Map<string, Monomial>();
378
329
  for (const monomial of this.monomials.values()) {
@@ -390,7 +341,6 @@ export class PolynomialManager {
390
341
  for (const polynomial of polynomials) polynomial.makeFirstMaximal();
391
342
  }
392
343
 
393
- // mk_monomial(x, k): x^k, the unit for k = 0.
394
344
  mkPower(variable: number, power: number) {
395
345
  return power === 0 ? this.unit : this.mkMonomial([variable], [power]);
396
346
  }
@@ -419,7 +369,6 @@ export class PolynomialManager {
419
369
  return this.mkMonomial(vars, degrees);
420
370
  }
421
371
 
422
- // div: m1/m2, or null when m2 does not divide m1.
423
372
  divMonomials(first: Monomial, second: Monomial) {
424
373
  const vars: number[] = [];
425
374
  const degrees: number[] = [];
@@ -439,7 +388,6 @@ export class PolynomialManager {
439
388
  return secondIndex < second.size ? null : this.mkMonomial(vars, degrees);
440
389
  }
441
390
 
442
- // div_x_k: m/x^k.
443
391
  private divXk(monomial: Monomial, variable: number, power: number) {
444
392
  const vars: number[] = [];
445
393
  const degrees: number[] = [];
@@ -455,13 +403,10 @@ export class PolynomialManager {
455
403
  return this.mkMonomial(vars, degrees);
456
404
  }
457
405
 
458
- // div_x: m with x removed.
459
406
  private divX(monomial: Monomial, variable: number) {
460
407
  return this.divXk(monomial, variable, monomial.degreeOf(variable));
461
408
  }
462
409
 
463
- // Construction.
464
-
465
410
  mkPolynomialCore(as: bigint[], ms: Monomial[]) {
466
411
  return new Polynomial(this.nextPolynomialId++, as, ms);
467
412
  }
@@ -482,7 +427,6 @@ export class PolynomialManager {
482
427
  return this.som.mk();
483
428
  }
484
429
 
485
- // mk_linear: sum of as[i]*xs[i] plus c.
486
430
  mkLinear(as: readonly bigint[], vars: readonly number[], constant: bigint) {
487
431
  const coeffs: bigint[] = [];
488
432
  const ms: Monomial[] = [];
@@ -498,8 +442,6 @@ export class PolynomialManager {
498
442
  return this.mkPolynomial(coeffs, ms);
499
443
  }
500
444
 
501
- // Queries.
502
-
503
445
  isZero(polynomial: Polynomial) {
504
446
  return polynomial.size === 0;
505
447
  }
@@ -532,7 +474,6 @@ export class PolynomialManager {
532
474
  return result;
533
475
  }
534
476
 
535
- // eq: the same monomials with the same coefficients, in any order.
536
477
  eq(first: Polynomial, second: Polynomial) {
537
478
  if (first === second) return true;
538
479
  if (first.size !== second.size) return false;
@@ -546,8 +487,6 @@ export class PolynomialManager {
546
487
  return true;
547
488
  }
548
489
 
549
- // The key of the hash-consing table. It lexicographically sorts the polynomial in place, as Z3's
550
- // hash does.
551
490
  getKey(polynomial: Polynomial) {
552
491
  polynomial.lexSort();
553
492
  let key = "";
@@ -556,8 +495,6 @@ export class PolynomialManager {
556
495
  return key;
557
496
  }
558
497
 
559
- // Arithmetic.
560
-
561
498
  private addmul(firstCoeff: bigint, first: Polynomial, secondCoeff: bigint, second: Polynomial) {
562
499
  this.som.reset();
563
500
  this.som.addmul(firstCoeff, this.unit, first);
@@ -581,7 +518,6 @@ export class PolynomialManager {
581
518
  return this.som.mk();
582
519
  }
583
520
 
584
- // mul(a, m, p): a*m*p.
585
521
  mulTerm(coeff: bigint, monomial: Monomial, polynomial: Polynomial) {
586
522
  if (coeff === 0n) return this.zero;
587
523
  if (coeff === 1n && monomial === this.unit) return polynomial;
@@ -606,7 +542,6 @@ export class PolynomialManager {
606
542
  return result;
607
543
  }
608
544
 
609
- // coeff: the coefficient of x^k, a polynomial in the other variables.
610
545
  coeff(polynomial: Polynomial, variable: number, power: number) {
611
546
  for (let index = 0; index < polynomial.size; index++) {
612
547
  const monomial = polynomial.ms[index];
@@ -616,7 +551,6 @@ export class PolynomialManager {
616
551
  return this.cheap.mk();
617
552
  }
618
553
 
619
- // const_coeff: the coefficient of x^k when it is a number, else null.
620
554
  getConstCoeff(polynomial: Polynomial, variable: number, power: number) {
621
555
  let result = 0n;
622
556
  for (let index = 0; index < polynomial.size; index++) {
@@ -642,13 +576,11 @@ export class PolynomialManager {
642
576
  return this.cheap.mk();
643
577
  }
644
578
 
645
- // flip_sign_if_lm_neg: negates p when its graded-lex leading coefficient is negative.
646
579
  flipSignIfLmNeg(polynomial: Polynomial) {
647
580
  if (polynomial.size === 0) return polynomial;
648
581
  return polynomial.as[polynomial.getGradedLexMaxPos()] < 0n ? this.neg(polynomial) : polynomial;
649
582
  }
650
583
 
651
- // ic: the integer content, the gcd of the coefficients.
652
584
  private getIc(polynomial: Polynomial) {
653
585
  if (polynomial.size === 0) return 0n;
654
586
  if (this.isConst(polynomial)) return polynomial.as[0];
@@ -660,7 +592,6 @@ export class PolynomialManager {
660
592
  return result;
661
593
  }
662
594
 
663
- // ic(p, a, c): p = a*c, with the coefficients of c coprime.
664
595
  private icWithContent(polynomial: Polynomial): [bigint, Polynomial] {
665
596
  if (polynomial.size === 0) return [0n, polynomial];
666
597
  if (this.isConst(polynomial)) return [polynomial.as[0], this.one];
@@ -672,7 +603,6 @@ export class PolynomialManager {
672
603
  return [content, this.cheap.mk()];
673
604
  }
674
605
 
675
- // iccp: the integer content, the content and the primitive part of p with respect to x.
676
606
  iccp(polynomial: Polynomial, variable: number): [bigint, Polynomial, Polynomial] {
677
607
  if (polynomial.size === 0) return [0n, this.one, polynomial];
678
608
  if (this.isConst(polynomial)) return [polynomial.as[0], this.one, this.one];
@@ -681,7 +611,6 @@ export class PolynomialManager {
681
611
  const [integer, content] = this.icWithContent(polynomial);
682
612
  return [integer, content, this.one];
683
613
  }
684
- // The quick filter: a power of x that occurs only as a pure power means the content is 1.
685
614
  const filter = Array.from({ length: degree + 1 }, () => 0);
686
615
  const powers: number[] = [];
687
616
  for (const monomial of polynomial.ms) {
@@ -704,8 +633,6 @@ export class PolynomialManager {
704
633
  return this.iccp(polynomial, variable)[2];
705
634
  }
706
635
 
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
636
  squareFree(polynomial: Polynomial): Polynomial {
710
637
  if (this.isConst(polynomial)) return polynomial;
711
638
  const variable = this.maxVar(polynomial);
@@ -717,7 +644,6 @@ export class PolynomialManager {
717
644
  return this.mul(this.mulConst(integer, squareFreeContent), squareFreePrimitive);
718
645
  }
719
646
 
720
- // normalize: p divided by the gcd of its coefficients.
721
647
  normalize(polynomial: Polynomial) {
722
648
  if (polynomial.size === 0) return polynomial;
723
649
  let g = 0n;
@@ -728,13 +654,11 @@ export class PolynomialManager {
728
654
  return this.cheap.mk();
729
655
  }
730
656
 
731
- // nonzero_const_coeff: whether the coefficient of x^k is a nonzero number.
732
657
  isNonzeroConstCoeff(polynomial: Polynomial, variable: number, power: number) {
733
658
  const coeff = this.getConstCoeff(polynomial, variable, power);
734
659
  return coeff !== null && coeff !== 0n;
735
660
  }
736
661
 
737
- // exact_div: p/q, where q divides p.
738
662
  exactDiv(polynomial: Polynomial, divisor: Polynomial) {
739
663
  if (polynomial.size === 0) return polynomial;
740
664
  const remainder = this.som;
@@ -759,8 +683,6 @@ export class PolynomialManager {
759
683
  }
760
684
  }
761
685
 
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
686
  exactPseudoDivision(
765
687
  polynomial: Polynomial,
766
688
  divisor: Polynomial,
@@ -770,7 +692,6 @@ export class PolynomialManager {
770
692
  return this.pseudoDivisionCore(polynomial, divisor, variable, true, isQuotient);
771
693
  }
772
694
 
773
- // pseudo_remainder: R with lc(q)^d * p = Q*q + R, where d counts the division steps.
774
695
  pseudoRemainder(polynomial: Polynomial, divisor: Polynomial, variable: number) {
775
696
  return this.pseudoDivisionCore(polynomial, divisor, variable, false, false);
776
697
  }
@@ -835,7 +756,6 @@ export class PolynomialManager {
835
756
  return this.exactPseudoDivision(polynomial, divisor, variable, false).remainder;
836
757
  }
837
758
 
838
- // The reduct of coeff(p, x, k, reduct): p without its x^k monomials.
839
759
  reduct(polynomial: Polynomial, variable: number, power: number) {
840
760
  for (let index = 0; index < polynomial.size; index++)
841
761
  if (polynomial.ms[index].degreeOf(variable) !== power)
@@ -843,18 +763,24 @@ export class PolynomialManager {
843
763
  return this.cheap.mk();
844
764
  }
845
765
 
846
- // var_max_degrees, sorted by variable.
847
- private getVarMaxDegrees(polynomial: Polynomial) {
766
+ private getMaxDegrees(polynomial: Polynomial) {
848
767
  const degrees = new Map<number, number>();
849
768
  for (const monomial of polynomial.ms)
850
769
  for (let index = 0; index < monomial.size; index++) {
851
770
  const variable = monomial.vars[index];
852
- degrees.set(variable, Math.max(degrees.get(variable) ?? 0, monomial.degrees[index]));
771
+ if (monomial.degrees[index] > (degrees.get(variable) ?? 0))
772
+ degrees.set(variable, monomial.degrees[index]);
853
773
  }
854
- return [...degrees.entries()].sort((first, second) => first[0] - second[0]);
774
+ return degrees;
775
+ }
776
+
777
+ private getVarMaxDegrees(polynomial: Polynomial) {
778
+ return [...this.getMaxDegrees(polynomial).entries()].sort(
779
+ (first, second) => first[0] - second[0],
780
+ );
855
781
  }
856
782
 
857
- // gcd: the greatest common divisor, with a positive integer content and leading coefficient.
783
+ // Deviation from Z3: subresultant PRS (gcd_prs), not mod_gcd, which can return 2 for coprime inputs (polynomial.cpp:4815).
858
784
  gcd(first: Polynomial, second: Polynomial): Polynomial {
859
785
  if (first.size === 0) return this.flipSignIfLmNeg(second);
860
786
  if (second.size === 0) return this.flipSignIfLmNeg(first);
@@ -875,13 +801,11 @@ export class PolynomialManager {
875
801
  return this.gcdPrs(first, second, firstDegrees[size - 1][0]);
876
802
  }
877
803
 
878
- // gcd_content: gcd(content(u, x), v).
879
804
  private gcdContent(polynomial: Polynomial, variable: number, other: Polynomial) {
880
805
  const [integer, content] = this.iccp(polynomial, variable);
881
806
  return this.gcd(this.mulConst(integer, content), other);
882
807
  }
883
808
 
884
- // gcd_prs: Collins' subresultant polynomial remainder sequence.
885
809
  private gcdPrs(first: Polynomial, second: Polynomial, variable: number) {
886
810
  const [u, v] =
887
811
  this.degree(first, variable) < this.degree(second, variable)
@@ -914,18 +838,10 @@ export class PolynomialManager {
914
838
  }
915
839
  }
916
840
 
917
- // get_min_degree_var: the first variable, in order of occurrence, of minimal degree.
918
841
  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
842
  let result = NULL_VAR;
927
843
  let minDegree = Infinity;
928
- for (const [variable, degree] of degrees)
844
+ for (const [variable, degree] of this.getMaxDegrees(polynomial))
929
845
  if (degree < minDegree) {
930
846
  result = variable;
931
847
  minDegree = degree;
@@ -933,8 +849,6 @@ export class PolynomialManager {
933
849
  return result;
934
850
  }
935
851
 
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
852
  factor(polynomial: Polynomial): Factors {
939
853
  const result: Factors = { constant: 1n, factors: [], degrees: [] };
940
854
  if (polynomial.size === 0) result.constant = 0n;
@@ -967,7 +881,6 @@ export class PolynomialManager {
967
881
  }
968
882
  }
969
883
 
970
- // factor_sqf_pp: the factors of a primitive square-free p of positive degree in x.
971
884
  private factorSqfPp(polynomial: Polynomial, variable: number, k: number, result: Factors) {
972
885
  const degree = this.degree(polynomial, variable);
973
886
  if (degree === 1) this.pushFactor(result, polynomial, k);
@@ -982,9 +895,6 @@ export class PolynomialManager {
982
895
  result.degrees.push(k);
983
896
  }
984
897
 
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
898
  toCoeffs(polynomial: Polynomial) {
989
899
  const coeffs = Array.from({ length: this.totalDegree(polynomial) + 1 }, () => 0n);
990
900
  for (let index = 0; index < polynomial.size; index++)
@@ -992,14 +902,12 @@ export class PolynomialManager {
992
902
  return this.um.set(coeffs);
993
903
  }
994
904
 
995
- // to_polynomial, mk_univariate: the monomials from the highest degree down.
996
905
  fromCoeffs(coeffs: readonly bigint[], variable: number) {
997
906
  for (let power = coeffs.length - 1; power >= 0; power--)
998
907
  this.cheap.add(coeffs[power], this.mkPower(variable, power));
999
908
  return this.cheap.mk();
1000
909
  }
1001
910
 
1002
- // factor_sqf_pp_univ
1003
911
  private factorSqfPpUniv(polynomial: Polynomial, k: number, result: Factors) {
1004
912
  const variable = this.maxVar(polynomial);
1005
913
  const fs: UpolynomialFactors = { constant: 1n, factors: [], degrees: [] };
@@ -1013,8 +921,6 @@ export class PolynomialManager {
1013
921
  if (fs.constant === -1n && k % 2 === 1) result.constant = -result.constant;
1014
922
  }
1015
923
 
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
924
  private factorQuadratic(polynomial: Polynomial, variable: number, k: number, result: Factors) {
1019
925
  let a = this.coeff(polynomial, variable, 2);
1020
926
  let b = this.coeff(polynomial, variable, 1);
@@ -1036,15 +942,12 @@ export class PolynomialManager {
1036
942
  this.pushFactor(result, this.pp(this.add(linear, root), variable), k);
1037
943
  }
1038
944
 
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
945
  private getTermSquareRoot(polynomial: Polynomial, position: number) {
1042
946
  const monomial = polynomial.ms[position];
1043
947
  if (monomial.degrees.some((degree) => degree % 2 === 1)) return null;
1044
948
  return getExactSquareRoot(polynomial.as[position]);
1045
949
  }
1046
950
 
1047
- // sqrt: the square root of p with a positive graded-lex leading coefficient, or null.
1048
951
  sqrt(polynomial: Polynomial) {
1049
952
  if (polynomial.size === 0) return polynomial;
1050
953
  if (this.getTermSquareRoot(polynomial, this.getGradedLexMinPos(polynomial)) === null)
@@ -1088,7 +991,6 @@ export class PolynomialManager {
1088
991
  }
1089
992
  }
1090
993
 
1091
- // graded_lex_min_pos
1092
994
  private getGradedLexMinPos(polynomial: Polynomial) {
1093
995
  let minPos = 0;
1094
996
  for (let index = 1; index < polynomial.size; index++)
@@ -1096,8 +998,6 @@ export class PolynomialManager {
1096
998
  return minPos;
1097
999
  }
1098
1000
 
1099
- // vars: the variables of p in order of occurrence.
1100
- // vars: the variables of p in the order they first occur.
1101
1001
  getVars(polynomial: Polynomial) {
1102
1002
  const vars: number[] = [];
1103
1003
  for (const monomial of polynomial.ms)
@@ -1105,7 +1005,6 @@ export class PolynomialManager {
1105
1005
  return vars;
1106
1006
  }
1107
1007
 
1108
- // substitute: p with each xs[i] replaced by the integer values[i].
1109
1008
  substitute(polynomial: Polynomial, vars: readonly number[], values: readonly bigint[]) {
1110
1009
  this.som.reset();
1111
1010
  for (let index = 0; index < polynomial.size; index++) {
@@ -1125,7 +1024,6 @@ export class PolynomialManager {
1125
1024
  return this.som.mk();
1126
1025
  }
1127
1026
 
1128
- // translate: p(x + v), by Horner on the coefficients of p in x.
1129
1027
  translate(polynomial: Polynomial, variable: number, value: bigint) {
1130
1028
  const degree = this.degree(polynomial, variable);
1131
1029
  if (degree === 0 || value === 0n) return polynomial;
@@ -1146,18 +1044,8 @@ export class PolynomialManager {
1146
1044
  return this.som.mk();
1147
1045
  }
1148
1046
 
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
1047
  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
- }
1048
+ const maxDegrees = this.getMaxDegrees(polynomial);
1161
1049
  if (![...maxDegrees.keys()].some((variable) => values[variable] !== undefined))
1162
1050
  return polynomial;
1163
1051
  this.som.reset();
@@ -1189,7 +1077,6 @@ export class PolynomialManager {
1189
1077
  return this.som.mk(true);
1190
1078
  }
1191
1079
 
1192
- // muladd: p*q + a.
1193
1080
  private muladd(first: Polynomial, second: Polynomial, constant: bigint) {
1194
1081
  if (first.size === 0 || second.size === 0) return this.mkConst(constant);
1195
1082
  this.som.reset();
@@ -1199,7 +1086,6 @@ export class PolynomialManager {
1199
1086
  return this.som.mk();
1200
1087
  }
1201
1088
 
1202
- // compose: p(q) for a univariate p, by Horner.
1203
1089
  private compose(polynomial: Polynomial, inner: Polynomial) {
1204
1090
  if (this.isConst(polynomial)) return polynomial;
1205
1091
  const variable = this.maxVar(polynomial);
@@ -1213,14 +1099,12 @@ export class PolynomialManager {
1213
1099
  return result;
1214
1100
  }
1215
1101
 
1216
- // compose_x_minus_y: p(x - y) for a univariate p in x.
1217
1102
  composeXMinusY(polynomial: Polynomial, variable: number) {
1218
1103
  const x = this.maxVar(polynomial);
1219
1104
  if (variable === x) return this.coeff(polynomial, x, 0);
1220
1105
  return this.compose(polynomial, this.mkLinear([1n, -1n], [x, variable], 0n));
1221
1106
  }
1222
1107
 
1223
- // compose_x_div_y: y^n * p(x/y) for a univariate p in x of degree n.
1224
1108
  composeXDivY(polynomial: Polynomial, variable: number) {
1225
1109
  if (this.isConst(polynomial)) return polynomial;
1226
1110
  const x = this.maxVar(polynomial);
@@ -1249,7 +1133,6 @@ export class PolynomialManager {
1249
1133
  return this.cheap.mk();
1250
1134
  }
1251
1135
 
1252
- // resultant: Res(p, q) in x, by the subresultant PRS on the primitive parts, times the contents.
1253
1136
  resultant(first: Polynomial, second: Polynomial, variable: number) {
1254
1137
  if (first.size === 0 || second.size === 0) return this.zero;
1255
1138
  if (this.isConst(first))
@@ -1302,10 +1185,6 @@ export class PolynomialManager {
1302
1185
  return this.eq(polynomial, this.pp(polynomial, variable));
1303
1186
  }
1304
1187
 
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
1188
  private factorMultivariate(polynomial: Polynomial, x: number, k: number, result: Factors) {
1310
1189
  const allVars = this.getVars(polynomial);
1311
1190
  const mainVars = [
@@ -1415,7 +1294,6 @@ export class PolynomialManager {
1415
1294
  return false;
1416
1295
  }
1417
1296
 
1418
- // The factors of a lifted part, splitting only linear and quadratic ones further.
1419
1297
  private pushSmallFactor(polynomial: Polynomial, x: number, k: number, result: Factors) {
1420
1298
  const degree = this.degree(polynomial, x);
1421
1299
  if (degree === 2 && this.isPrimitive(polynomial, x) && this.isSquareFreeIn(polynomial, x))
@@ -1428,9 +1306,6 @@ export class PolynomialManager {
1428
1306
  return polynomial.as[0] ?? 0n;
1429
1307
  }
1430
1308
 
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
1309
  private liftBivariate(
1435
1310
  q: Polynomial,
1436
1311
  x: number,
@@ -1486,9 +1361,6 @@ export class PolynomialManager {
1486
1361
  return this.eq(this.mul(first, second), q) ? [first, second] : null;
1487
1362
  }
1488
1363
 
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
1364
  pscChain(first: Polynomial, second: Polynomial, variable: number) {
1493
1365
  const chain =
1494
1366
  this.degree(first, variable) >= this.degree(second, variable)
@@ -1505,7 +1377,6 @@ export class PolynomialManager {
1505
1377
  while (b.size > 0) {
1506
1378
  const d = this.degree(a, x);
1507
1379
  const e = this.degree(b, x);
1508
- // b is S_{d-1}.
1509
1380
  const principal = this.coeff(b, x, d - 1);
1510
1381
  if (principal.size > 0) chain.push(principal);
1511
1382
  let c = b;
@@ -1522,7 +1393,6 @@ export class PolynomialManager {
1522
1393
  return chain;
1523
1394
  }
1524
1395
 
1525
- // Se_Lazard: S_e from S_{d-1} and lc(S_d) by dichotomous Lazard.
1526
1396
  private getSeLazard(d: number, lcSd: Polynomial, sd1: Polynomial, x: number) {
1527
1397
  let n = d - this.degree(sd1, x) - 1;
1528
1398
  if (n === 0) return sd1;
@@ -1541,7 +1411,6 @@ export class PolynomialManager {
1541
1411
  return this.exactDiv(this.mul(c, sd1), lcSd);
1542
1412
  }
1543
1413
 
1544
- // optimized_S_e_1: S_{e-1} from A = S_{d+1}, S_{d-1}, S_e and s = lc(S_d).
1545
1414
  private getOptimizedSe1(
1546
1415
  d: number,
1547
1416
  e: number,
@@ -1573,10 +1442,6 @@ export class PolynomialManager {
1573
1442
  return (d - e + 1) % 2 === 1 ? this.neg(result) : result;
1574
1443
  }
1575
1444
 
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
1445
  evaluateWith<T>(polynomial: Polynomial, ops: ValueOps<T>, getValue: (variable: number) => T) {
1581
1446
  if (polynomial.size === 0) return ops.fromInteger(0n);
1582
1447
  if (this.isConst(polynomial)) return ops.fromInteger(polynomial.as[0]);
@@ -1591,7 +1456,6 @@ export class PolynomialManager {
1591
1456
  );
1592
1457
  }
1593
1458
 
1594
- // t_eval_core: the monomials in [start, end), ignoring the variables above x.
1595
1459
  private evaluateCore<T>(
1596
1460
  polynomial: Polynomial,
1597
1461
  ops: ValueOps<T>,
@@ -1647,7 +1511,6 @@ export class PolynomialManager {
1647
1511
  return result;
1648
1512
  }
1649
1513
 
1650
- // max_smaller_than: the largest variable below x in the monomials in [start, end).
1651
1514
  private maxSmallerThan(polynomial: Polynomial, start: number, end: number, x: number) {
1652
1515
  let max = NULL_VAR;
1653
1516
  for (let index = start; index < end; index++)
@@ -1669,7 +1532,6 @@ export class PolynomialManager {
1669
1532
  }
1670
1533
  }
1671
1534
 
1672
- // polynomial::cache: hash-conses polynomials and memoizes their subresultants and factors.
1673
1535
  export class PolynomialCache {
1674
1536
  private table = new Map<string, Polynomial>();
1675
1537
  private inCache = new Set<number>();
@@ -1710,7 +1572,6 @@ export class PolynomialCache {
1710
1572
  return chain;
1711
1573
  }
1712
1574
 
1713
- // factor: the distinct factors, without the constant.
1714
1575
  factor(polynomial: Polynomial) {
1715
1576
  const unique = this.mkUnique(polynomial);
1716
1577
  const cached = this.factorizations.get(unique.id);