tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.f57f64938

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 (568) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  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 +3 -0
  8. package/dist/index.d.ts +3 -0
  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.cjs +2682 -426
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -42
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +42 -39
  19. package/dist/transfer.js +42 -39
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/builtins.ts +4 -13
  25. package/src/check-failure.ts +116 -0
  26. package/src/check-trace.ts +282 -0
  27. package/src/check.ts +353 -549
  28. package/src/cli/options.ts +6 -31
  29. package/src/cli/shared.ts +1 -1
  30. package/src/cli/tlapm.ts +433 -70
  31. package/src/cli/tlc-arguments.ts +222 -210
  32. package/src/cli/tlc-output.ts +687 -0
  33. package/src/cli/tlc-usage.ts +1 -2
  34. package/src/cli/tlc.ts +49 -702
  35. package/src/cli/xml-exporter.ts +23 -33
  36. package/src/codegen.ts +5 -10
  37. package/src/coverage.ts +0 -2
  38. package/src/dependencies.ts +30 -14
  39. package/src/dfid.ts +16 -16
  40. package/src/environment-config.ts +315 -0
  41. package/src/environment.ts +55 -338
  42. package/src/errors.ts +33 -5
  43. package/src/evaluate.ts +5 -4
  44. package/src/exit-codes.ts +1 -0
  45. package/src/fingerprints.ts +65 -1
  46. package/src/instances.ts +47 -10
  47. package/src/json.ts +4 -7
  48. package/src/levels.ts +39 -42
  49. package/src/lexer.ts +5 -3
  50. package/src/liveness-checker.ts +553 -237
  51. package/src/liveness.ts +94 -86
  52. package/src/obligations/action.ts +14 -17
  53. package/src/obligations/anonymize.ts +37 -16
  54. package/src/obligations/enabled-axioms.ts +218 -0
  55. package/src/obligations/equality.ts +1 -3
  56. package/src/obligations/expression.ts +36 -8
  57. package/src/obligations/format.ts +0 -2
  58. package/src/obligations/generate.ts +66 -54
  59. package/src/obligations/index.ts +38 -8
  60. package/src/obligations/levels.ts +24 -11
  61. package/src/obligations/module.ts +28 -41
  62. package/src/obligations/normalize.ts +26 -14
  63. package/src/obligations/operators.ts +0 -2
  64. package/src/obligations/pragma.ts +53 -16
  65. package/src/obligations/printer.ts +43 -13
  66. package/src/obligations/proof.ts +3 -2
  67. package/src/obligations/regroup.ts +0 -2
  68. package/src/obligations/simplify.ts +55 -50
  69. package/src/obligations/source.ts +118 -74
  70. package/src/obligations/subexpression.ts +45 -18
  71. package/src/obligations/substitution.ts +1 -3
  72. package/src/obligations/temporal.ts +5 -7
  73. package/src/obligations/tuples.ts +0 -2
  74. package/src/parallel-worker.ts +10 -30
  75. package/src/parallel.ts +24 -47
  76. package/src/parser.ts +580 -180
  77. package/src/pretty-print.ts +1 -1
  78. package/src/prover/decide-pool.ts +3 -3
  79. package/src/prover/deciders.ts +12 -9
  80. package/src/prover/isabelle/decide.ts +3 -25
  81. package/src/prover/isabelle/encode.ts +72 -42
  82. package/src/prover/isabelle/isar/attrib.ts +250 -0
  83. package/src/prover/isabelle/isar/context.ts +335 -0
  84. package/src/prover/isabelle/isar/induct.ts +382 -0
  85. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  86. package/src/prover/isabelle/isar/method.ts +509 -212
  87. package/src/prover/isabelle/isar/proof.ts +570 -14
  88. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  89. package/src/prover/isabelle/isar/theory.ts +487 -76
  90. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  91. package/src/prover/isabelle/isar/type-check.ts +89 -14
  92. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  93. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  94. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  95. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  96. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  98. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  99. package/src/prover/isabelle/provers/classical.ts +45 -20
  100. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  101. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  102. package/src/prover/isabelle/pure/consts.ts +0 -2
  103. package/src/prover/isabelle/pure/conv.ts +2 -10
  104. package/src/prover/isabelle/pure/drule.ts +72 -6
  105. package/src/prover/isabelle/pure/envir.ts +0 -2
  106. package/src/prover/isabelle/pure/goal.ts +1 -3
  107. package/src/prover/isabelle/pure/logic.ts +1 -3
  108. package/src/prover/isabelle/pure/name.ts +0 -2
  109. package/src/prover/isabelle/pure/net.ts +0 -2
  110. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  111. package/src/prover/isabelle/pure/pattern.ts +0 -2
  112. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  113. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  114. package/src/prover/isabelle/pure/search.ts +0 -2
  115. package/src/prover/isabelle/pure/seq.ts +0 -2
  116. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  117. package/src/prover/isabelle/pure/table.ts +2 -3
  118. package/src/prover/isabelle/pure/tactic.ts +0 -2
  119. package/src/prover/isabelle/pure/tactical.ts +42 -37
  120. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  121. package/src/prover/isabelle/pure/term.ts +0 -2
  122. package/src/prover/isabelle/pure/thm.ts +14 -13
  123. package/src/prover/isabelle/pure/type.ts +0 -2
  124. package/src/prover/isabelle/pure/unify.ts +0 -2
  125. package/src/prover/isabelle/pure/variable.ts +0 -2
  126. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  127. package/src/prover/isabelle/tla/context.ts +58 -11
  128. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  129. package/src/prover/isabelle/tla/logic.ts +49 -21
  130. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  131. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  132. package/src/prover/ocaml.ts +4 -1
  133. package/src/prover/prep/action.ts +30 -31
  134. package/src/prover/prep/enabled-axioms.ts +11 -2
  135. package/src/prover/prep/fingerprint.ts +2 -5
  136. package/src/prover/prep/methods.ts +181 -51
  137. package/src/prover/prep/normalize.ts +38 -9
  138. package/src/prover/prove.ts +395 -94
  139. package/src/prover/ptl/decide.ts +95 -50
  140. package/src/prover/ptl/encode.ts +2 -3
  141. package/src/prover/ptl/tableau.ts +28 -2
  142. package/src/prover/smt/arithmetic.ts +310 -0
  143. package/src/prover/smt/axioms.ts +12 -8
  144. package/src/prover/smt/context.ts +43 -8
  145. package/src/prover/smt/data.ts +498 -379
  146. package/src/prover/smt/encode.ts +148 -57
  147. package/src/prover/smt/extensionality.ts +5 -3
  148. package/src/prover/smt/flatten.ts +4 -6
  149. package/src/prover/smt/format.ts +28 -4
  150. package/src/prover/smt/instances.ts +7 -1
  151. package/src/prover/smt/layout.ts +91 -0
  152. package/src/prover/smt/rewrite.ts +1021 -618
  153. package/src/prover/smt/simplify.ts +441 -0
  154. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  155. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  156. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  157. package/src/prover/smt/solver/act-cache.ts +0 -1
  158. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  159. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  160. package/src/prover/smt/solver/aig.ts +889 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  162. package/src/prover/smt/solver/arith-terms.ts +121 -0
  163. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  164. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  165. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  166. package/src/prover/smt/solver/ast-lt.ts +166 -12
  167. package/src/prover/smt/solver/ast-util.ts +160 -2
  168. package/src/prover/smt/solver/ast.ts +1427 -41
  169. package/src/prover/smt/solver/auf-solver.ts +2 -6
  170. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  171. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  172. package/src/prover/smt/solver/bound-manager.ts +196 -0
  173. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  174. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  175. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  176. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  177. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  178. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  179. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  180. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  181. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  182. package/src/prover/smt/solver/card2bv.ts +110 -0
  183. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  184. package/src/prover/smt/solver/cg-table.ts +39 -25
  185. package/src/prover/smt/solver/check-logic.ts +330 -0
  186. package/src/prover/smt/solver/clause.ts +0 -1
  187. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  188. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  189. package/src/prover/smt/solver/context.ts +516 -115
  190. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  191. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  192. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  193. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  194. package/src/prover/smt/solver/demodulator.ts +786 -0
  195. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  196. package/src/prover/smt/solver/der.ts +38 -10
  197. package/src/prover/smt/solver/diff-neq.ts +206 -0
  198. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  199. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  200. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  201. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  202. package/src/prover/smt/solver/e-matching.ts +7 -8
  203. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  204. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  205. package/src/prover/smt/solver/enode.ts +100 -3
  206. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  207. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  208. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  209. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  210. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  211. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  212. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  213. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  214. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  215. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  216. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  217. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  218. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  219. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  220. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  221. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  222. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  223. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  224. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  225. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  226. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  227. package/src/prover/smt/solver/expr-ref.ts +0 -1
  228. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  229. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  230. package/src/prover/smt/solver/factor.ts +141 -0
  231. package/src/prover/smt/solver/fd-solver.ts +265 -0
  232. package/src/prover/smt/solver/fingerprints.ts +15 -15
  233. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  234. package/src/prover/smt/solver/flat-literals.ts +0 -1
  235. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  236. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  237. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  238. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  239. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  240. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  241. package/src/prover/smt/solver/goal.ts +175 -15
  242. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  243. package/src/prover/smt/solver/guard-set.ts +219 -0
  244. package/src/prover/smt/solver/hash.ts +0 -1
  245. package/src/prover/smt/solver/hashtable.ts +30 -16
  246. package/src/prover/smt/solver/inf-eps.ts +63 -0
  247. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  248. package/src/prover/smt/solver/internalizer.ts +110 -38
  249. package/src/prover/smt/solver/lackr.ts +381 -0
  250. package/src/prover/smt/solver/lbool.ts +0 -1
  251. package/src/prover/smt/solver/lia2card.ts +268 -0
  252. package/src/prover/smt/solver/lia2pb.ts +154 -0
  253. package/src/prover/smt/solver/literal.ts +0 -1
  254. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  255. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  256. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  257. package/src/prover/smt/solver/lp/containers.ts +0 -1
  258. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  259. package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
  260. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  261. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  262. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  263. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  264. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  265. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  266. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  267. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  268. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  269. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  270. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  271. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  272. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  273. package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
  274. package/src/prover/smt/solver/lp/nex.ts +0 -1
  275. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-core.ts +42 -11
  278. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -4
  282. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  286. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  288. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  289. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  292. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  294. package/src/prover/smt/solver/lp/nra-solver.ts +25 -4
  295. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  296. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  297. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  298. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  299. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  300. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  301. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  302. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  303. package/src/prover/smt/solver/macro-finder.ts +530 -0
  304. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  305. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  306. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  307. package/src/prover/smt/solver/max-cliques.ts +105 -0
  308. package/src/prover/smt/solver/maxcore.ts +309 -0
  309. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  310. package/src/prover/smt/solver/maxlex.ts +115 -0
  311. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  312. package/src/prover/smt/solver/maxsmt.ts +92 -0
  313. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  314. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  315. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  316. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  317. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  318. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  319. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  320. package/src/prover/smt/solver/model-checker.ts +18 -27
  321. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  322. package/src/prover/smt/solver/model-finder.ts +12 -18
  323. package/src/prover/smt/solver/model-generator.ts +56 -29
  324. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  325. package/src/prover/smt/solver/model-printer.ts +214 -0
  326. package/src/prover/smt/solver/mpf.ts +711 -0
  327. package/src/prover/smt/solver/mus.ts +51 -0
  328. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  329. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  330. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  331. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  332. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  333. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  334. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  335. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  336. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  337. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  338. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  339. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  340. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  341. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  342. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  343. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  344. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  345. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  346. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  347. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  348. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  349. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  350. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  351. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  352. package/src/prover/smt/solver/nlqsat.ts +484 -0
  353. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  354. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  355. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  356. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  357. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  358. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  359. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  360. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  361. package/src/prover/smt/solver/nlsat/solver.ts +234 -36
  362. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  363. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  364. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  365. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  366. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  367. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  368. package/src/prover/smt/solver/nnf.ts +105 -23
  369. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  370. package/src/prover/smt/solver/occf.ts +97 -0
  371. package/src/prover/smt/solver/opt-context.ts +787 -0
  372. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  373. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  374. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  375. package/src/prover/smt/solver/opt-solver.ts +308 -0
  376. package/src/prover/smt/solver/opt-value.ts +55 -0
  377. package/src/prover/smt/solver/optsmt.ts +692 -0
  378. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  379. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  380. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  381. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  382. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  383. package/src/prover/smt/solver/probes.ts +512 -0
  384. package/src/prover/smt/solver/propagate-values.ts +37 -21
  385. package/src/prover/smt/solver/proto-model.ts +648 -19
  386. package/src/prover/smt/solver/pull-quant.ts +28 -12
  387. package/src/prover/smt/solver/purify-arith.ts +632 -0
  388. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  389. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  390. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  391. package/src/prover/smt/solver/qe-lite.ts +37 -17
  392. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  393. package/src/prover/smt/solver/qe.ts +1498 -0
  394. package/src/prover/smt/solver/qel.ts +25 -0
  395. package/src/prover/smt/solver/qi-queue.ts +0 -1
  396. package/src/prover/smt/solver/qsat.ts +814 -0
  397. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  398. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  399. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  400. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  401. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  402. package/src/prover/smt/solver/random-gen.ts +0 -1
  403. package/src/prover/smt/solver/rational.ts +45 -1
  404. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  405. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  406. package/src/prover/smt/solver/reduce-args.ts +225 -0
  407. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  408. package/src/prover/smt/solver/ref-vector.ts +0 -1
  409. package/src/prover/smt/solver/relevancy.ts +1 -2
  410. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  411. package/src/prover/smt/solver/rewriter.ts +475 -36
  412. package/src/prover/smt/solver/rlimit.ts +25 -2
  413. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  414. package/src/prover/smt/solver/sat/big.ts +177 -0
  415. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  416. package/src/prover/smt/solver/sat/clause.ts +203 -0
  417. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  418. package/src/prover/smt/solver/sat/config.ts +122 -0
  419. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  420. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  421. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  422. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  423. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  424. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  425. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  426. package/src/prover/smt/solver/sat/probing.ts +170 -0
  427. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  428. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  429. package/src/prover/smt/solver/sat/scc.ts +142 -0
  430. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  431. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  432. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  433. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  434. package/src/prover/smt/solver/search-tree.ts +284 -0
  435. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  436. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  437. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  438. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  439. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  440. package/src/prover/smt/solver/seq-factory.ts +89 -0
  441. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  442. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  443. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  444. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  445. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  446. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  447. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  448. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  449. package/src/prover/smt/solver/seq-subset.ts +165 -0
  450. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  451. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  452. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  453. package/src/prover/smt/solver/smt-logics.ts +66 -0
  454. package/src/prover/smt/solver/smt-setup.ts +496 -0
  455. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  456. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  457. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  458. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  459. package/src/prover/smt/solver/solver.ts +113 -22
  460. package/src/prover/smt/solver/static-features.ts +314 -0
  461. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  462. package/src/prover/smt/solver/tactic.ts +1986 -0
  463. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  464. package/src/prover/smt/solver/theory-array.ts +1240 -0
  465. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  466. package/src/prover/smt/solver/theory-char.ts +355 -0
  467. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  468. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  469. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  470. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  471. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  472. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  473. package/src/prover/smt/solver/theory-lra-internalize.ts +86 -27
  474. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  475. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  476. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  477. package/src/prover/smt/solver/theory-lra.ts +188 -1
  478. package/src/prover/smt/solver/theory-pb.ts +934 -0
  479. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  480. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  481. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  482. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  483. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  484. package/src/prover/smt/solver/theory-seq.ts +961 -0
  485. package/src/prover/smt/solver/theory.ts +189 -0
  486. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  487. package/src/prover/smt/solver/var-subst.ts +36 -14
  488. package/src/prover/smt/table.ts +3 -2
  489. package/src/prover/smt/types.ts +146 -0
  490. package/src/prover/tlapm/cache.ts +50 -19
  491. package/src/prover/tlapm/tlapm.ts +15 -9
  492. package/src/prover/tlapm-library.ts +3208 -0
  493. package/src/prover/verdict.ts +9 -0
  494. package/src/prover/zenon/check/check.ts +1 -2
  495. package/src/prover/zenon/check/records.ts +1 -1
  496. package/src/prover/zenon/check/relations.ts +2 -1
  497. package/src/prover/zenon/check/rewrites.ts +2 -15
  498. package/src/prover/zenon/check/sets.ts +40 -58
  499. package/src/prover/zenon/check/terms.ts +1 -2
  500. package/src/prover/zenon/decide.ts +10 -7
  501. package/src/prover/zenon/encode.ts +0 -2
  502. package/src/prover/zenon/eqrel.ts +2 -2
  503. package/src/prover/zenon/equality-rules.ts +0 -2
  504. package/src/prover/zenon/expr.ts +7 -2
  505. package/src/prover/zenon/index-table.ts +9 -21
  506. package/src/prover/zenon/isar-case.ts +0 -2
  507. package/src/prover/zenon/isar.ts +35 -37
  508. package/src/prover/zenon/llproof.ts +2 -13
  509. package/src/prover/zenon/mltoll.ts +12 -30
  510. package/src/prover/zenon/node.ts +20 -5
  511. package/src/prover/zenon/parse.ts +9 -8
  512. package/src/prover/zenon/phrase.ts +0 -2
  513. package/src/prover/zenon/proof.ts +0 -2
  514. package/src/prover/zenon/propositional-rules.ts +0 -2
  515. package/src/prover/zenon/rules.ts +0 -2
  516. package/src/prover/zenon/search.ts +11 -19
  517. package/src/prover/zenon/tla/functions.ts +2 -4
  518. package/src/prover/zenon/tla/llproof.ts +9 -13
  519. package/src/prover/zenon/tla/records.ts +1 -8
  520. package/src/prover/zenon/tla/rewrites.ts +0 -2
  521. package/src/prover/zenon/tla/sets.ts +22 -22
  522. package/src/prover/zenon/tla/terms.ts +0 -2
  523. package/src/prover/zenon/tla/tla.ts +7 -8
  524. package/src/resolve.ts +56 -74
  525. package/src/runtime.ts +4 -0
  526. package/src/sany/generation.ts +394 -0
  527. package/src/sany/generator-def-entries.ts +210 -0
  528. package/src/sany/generator-definitions.ts +686 -0
  529. package/src/sany/generator-expressions.ts +1100 -0
  530. package/src/sany/generator-proofs.ts +662 -0
  531. package/src/sany/generator.ts +155 -2625
  532. package/src/sany/levels.ts +0 -2
  533. package/src/sany/lexer.ts +17 -16
  534. package/src/sany/linter.ts +0 -2
  535. package/src/sany/nodes.ts +2 -3
  536. package/src/sany/report.ts +3 -6
  537. package/src/sany/selectors.ts +35 -38
  538. package/src/sany/xml.ts +23 -55
  539. package/src/search.ts +205 -43
  540. package/src/simulate.ts +157 -133
  541. package/src/spec-description.ts +33 -48
  542. package/src/standard-definitions.ts +4 -0
  543. package/src/standard-modules.ts +16 -32
  544. package/src/state-graph.ts +0 -2
  545. package/src/substitution-levels.ts +5 -4
  546. package/src/successors.ts +6 -8
  547. package/src/symmetry.ts +2 -2
  548. package/src/tableau.ts +2 -2
  549. package/src/tlc/fingerprint.ts +81 -9
  550. package/src/tlc/messages.ts +20 -15
  551. package/src/tlc/random.ts +4 -4
  552. package/src/tlc/replay.ts +8 -15
  553. package/src/tlc/summary.ts +29 -14
  554. package/src/tlc/tlc-operators.ts +2 -3
  555. package/src/tlc/tlcext-operators.ts +44 -12
  556. package/src/tlc/trace-spec.ts +21 -40
  557. package/src/typed-tier.ts +6535 -0
  558. package/src/typescript/actions.ts +2 -4
  559. package/src/typescript/collections.ts +34 -20
  560. package/src/typescript/compile.ts +1 -3
  561. package/src/typescript/formula.ts +5 -3
  562. package/src/typescript/model.ts +4 -5
  563. package/src/typescript/steps.ts +20 -18
  564. package/src/values.ts +62 -152
  565. package/src/prover/isabelle/isar/statement.ts +0 -52
  566. package/src/prover/smt/solver/z3-license.txt +0 -10
  567. package/src/prover/tlaps-module.ts +0 -510
  568. package/src/prover/zenon/LICENSE +0 -32
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (maximize_term and its helpers in src/math/lp/lar_solver.cpp, and the tableau part
2
- // of src/math/lp/lp_primal_core_solver.h, src/math/lp/lp_primal_core_solver_def.h,
3
- // src/math/lp/lp_primal_core_solver_tableau_def.h), MIT license, see z3-license.txt.
4
1
  import { Rational } from "../rational";
5
2
  import {
6
3
  COLUMN_BOXED,
@@ -15,6 +12,7 @@ import {
15
12
  LP_OPTIMAL,
16
13
  LP_UNBOUNDED,
17
14
  } from "./core-solver";
15
+ import { type Dependency, mkJoin } from "./dependency";
18
16
  import type { LarSolver } from "./lar-solver";
19
17
  import { LarTerm } from "./lar-term";
20
18
  import { Impq } from "./numeric-pair";
@@ -304,19 +302,70 @@ const maximizeTermOnFeasibleRSolver = (solver: LarSolver, term: LarTerm) => {
304
302
  core.reducedCosts = undefined;
305
303
  const status = core.status;
306
304
  core.status = LP_OPTIMAL;
307
- return status === LP_UNBOUNDED || status === LP_CANCELLED ? undefined : term.apply(core.x);
305
+ return status === LP_UNBOUNDED || status === LP_CANCELLED
306
+ ? undefined
307
+ : { value: term.apply(core.x), reducedCosts };
308
308
  };
309
309
 
310
- export const maximizeTerm = (solver: LarSolver, column: number) => {
310
+ // Every column with a positive reduced cost sits at its upper bound, and every column with a
311
+ // negative one at its lower bound, so those bounds prove the maximum.
312
+ const getDependenciesOfMaximum = (solver: LarSolver, reducedCosts: readonly Rational[]) => {
313
+ let dependency: Dependency = null;
314
+ for (const [column, reducedCost] of reducedCosts.entries()) {
315
+ if (reducedCost.isZero()) continue;
316
+ dependency = mkJoin(
317
+ dependency,
318
+ reducedCost.isPositive() ? solver.getUpperWitness(column) : solver.getLowerWitness(column),
319
+ );
320
+ }
321
+ return dependency;
322
+ };
323
+
324
+ // Integer columns that maximization left fractional move out of the basis, if they can.
325
+ const adjustIntegerColumns = (solver: LarSolver, term: LarTerm, previous: Impq, maximum: Impq) => {
326
+ const core = solver.core;
327
+ const restore = () => {
328
+ core.restoreX();
329
+ return { status: LP_FEASIBLE, value: previous };
330
+ };
331
+ let isChanged = false;
332
+ for (let column = 0; column < core.x.length; column++) {
333
+ if (!solver.isInt(column) || core.x[column].isInt()) continue;
334
+ if (solver.isBase(column) && !solver.removeFromBasis(column)) return restore();
335
+ if (!core.x[column].isInt()) return restore();
336
+ isChanged = true;
337
+ }
338
+ const changed = isChanged ? term.apply(core.x) : maximum;
339
+ const isWorse = changed.compare(previous) < 0;
340
+ if (isWorse) core.restoreX();
341
+ const value = isWorse ? previous : changed;
342
+ if (!value.equals(maximum)) return { status: LP_FEASIBLE, value };
343
+ solver.status = LP_OPTIMAL;
344
+ return { status: LP_OPTIMAL, value };
345
+ };
346
+
347
+ export const maximizeTerm = (
348
+ solver: LarSolver,
349
+ column: number,
350
+ isFixingIntCols = false,
351
+ isComputingDependencies = false,
352
+ ) => {
311
353
  const term = solver.hasTerm(column)
312
354
  ? solver.getTerm(column)
313
355
  : new LarTerm([[column, Rational.one]]);
314
- const backup = solver.core.x.slice();
356
+ solver.core.backupX();
357
+ const previous = term.apply(solver.core.x);
315
358
  const maximum = maximizeTermOnFeasibleRSolver(solver, term);
316
359
  if (maximum === undefined) {
317
- solver.core.x.splice(0, backup.length, ...backup);
318
- return undefined;
360
+ solver.core.restoreX();
361
+ return { status: LP_UNBOUNDED, value: Impq.zero, dependency: null };
319
362
  }
320
- solver.status = LP_OPTIMAL;
321
- return maximum;
363
+ const dependency = isComputingDependencies
364
+ ? getDependenciesOfMaximum(solver, maximum.reducedCosts)
365
+ : null;
366
+ if (!isFixingIntCols) {
367
+ solver.status = LP_OPTIMAL;
368
+ return { status: LP_OPTIMAL, value: maximum.value, dependency };
369
+ }
370
+ return { ...adjustIntegerColumns(solver, term, previous, maximum.value), dependency };
322
371
  };
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nex_creator.h, src/math/lp/nex_creator.cpp), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import {
4
3
  type Nex,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nex.h), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
 
4
3
  interface NexScalar {
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_backoff.h), MIT license, see z3-license.txt.
2
-
3
1
  export class Backoff {
4
2
  private delay = 0;
5
3
 
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_basics_lemmas.h, src/math/lp/nla_basics_lemmas.cpp), MIT license,
2
- // see z3-license.txt.
3
1
  import { Rational } from "../rational";
4
2
  import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
5
3
  import { LarTerm } from "./lar-term";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_core.h, src/math/lp/nla_core.cpp, src/math/lp/nla_common.cpp, src/math/lp/nla_explanations.cpp, src/math/lp/factorization.cpp, src/math/lp/factorization_factory_imp.cpp, src/math/lp/nla_solver.cpp), MIT license, see z3-license.txt.
2
1
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
3
2
  import type { ResourceLimit } from "../rlimit";
4
3
  import { Rational } from "../rational";
@@ -22,6 +21,7 @@ import { MonomialBounds } from "./nla-monomial-bounds";
22
21
  import { Monotone } from "./nla-monotone";
23
22
  import { Order } from "./nla-order";
24
23
  import { Patcher } from "./nla-patcher";
24
+ import { checkPower } from "./nla-powers";
25
25
  import { Tangents } from "./nla-tangents";
26
26
  import { NlaThrottle } from "./nla-throttle";
27
27
  import {
@@ -32,6 +32,7 @@ import {
32
32
  mkIneq,
33
33
  negateKind,
34
34
  } from "./nla-types";
35
+ import { NlaTranscendentals } from "./nla-transcendentals";
35
36
  import { NraSolver } from "./nra-solver";
36
37
  import { getSignedVarVar, isSignedVarNegated, mkSignedVar, VarEqs } from "./nla-var-eqs";
37
38
 
@@ -143,6 +144,7 @@ export class NlaCore {
143
144
  private readonly horner: Horner;
144
145
  readonly grobner: Grobner;
145
146
  readonly nra = new NraSolver(this);
147
+ readonly transcendentals = new NlaTranscendentals(this);
146
148
  isUsingNraModel = false;
147
149
  private nlsatBackoff: Backoff;
148
150
  private checkAssignmentFailCount = 0;
@@ -174,10 +176,6 @@ export class NlaCore {
174
176
  };
175
177
  }
176
178
 
177
- private get settings() {
178
- return this.lra.settings;
179
- }
180
-
181
179
  get stats() {
182
180
  return this.lra.settings.stats;
183
181
  }
@@ -353,6 +351,7 @@ export class NlaCore {
353
351
  }
354
352
 
355
353
  hasRelevantMonomial() {
354
+ if (!this.transcendentals.isEmpty) return true;
356
355
  return this.emons.monics.some((monic) => this.isRelevant(monic.variable));
357
356
  }
358
357
 
@@ -552,11 +551,17 @@ export class NlaCore {
552
551
  }
553
552
 
554
553
  random() {
555
- return this.settings.getRandomNext();
554
+ return this.lra.settings.getRandomNext();
556
555
  }
557
556
 
558
557
  isCanceled() {
559
- return this.settings.isCanceled();
558
+ return this.lra.settings.isCanceled();
559
+ }
560
+
561
+ checkPower(result: number, base: number, exponent: number) {
562
+ this.clear();
563
+ if (this.lra.isFeasible()) this.lra.getRidOfInfEps();
564
+ return checkPower(this, result, base, exponent);
560
565
  }
561
566
 
562
567
  checkBoundedDivisions() {
@@ -661,7 +666,29 @@ export class NlaCore {
661
666
 
662
667
  private onToRefineEmpty() {
663
668
  this.squeezeSchedule.onNothingToRefine();
664
- return L_TRUE;
669
+ return this.checkTranscendentalsAndFinish();
670
+ }
671
+
672
+ // The applications of transcendental functions still need checking when the monomials hold. A
673
+ // failure of the check needs nlsat, and a model of nlsat that is not tight enough is unknown.
674
+ private checkTranscendentalsAndFinish() {
675
+ const transcendentals = this.transcendentals;
676
+ if (transcendentals.isEmpty) return L_TRUE;
677
+ const numFailures = transcendentals.numFailures;
678
+ transcendentals.check();
679
+ if (this.lemmas.length > 0 || this.literals.length > 0) return L_FALSE;
680
+ const isFailed = transcendentals.numFailures > numFailures;
681
+ let isRunningNlsat = this.shouldRunBoundedNlsat() && transcendentals.numFailures > 0;
682
+ if (isFailed && !isRunningNlsat) {
683
+ if (!NLA_PARAMS.nra) return L_UNDEF;
684
+ isRunningNlsat = true;
685
+ }
686
+ if (!isRunningNlsat) return L_TRUE;
687
+ const result = this.boundedNlsat();
688
+ if (result === L_FALSE) return L_FALSE;
689
+ if (result === L_TRUE && transcendentals.isNraModelValid()) return L_TRUE;
690
+ if (result === L_TRUE) this.setUseNraModel(false);
691
+ return L_UNDEF;
665
692
  }
666
693
 
667
694
  check(level: number) {
@@ -723,7 +750,8 @@ export class NlaCore {
723
750
  );
724
751
  if (this.isCanceled()) return L_UNDEF;
725
752
  if (this.lemmas.length > 0 || this.literals.length > 0 || this.isCheckFeasible) return L_FALSE;
726
- if (this.isNlaSatisfied) return L_TRUE;
753
+ if (this.isNlaSatisfied) return this.checkTranscendentalsAndFinish();
754
+ if (hasNoEffect() && !this.transcendentals.isEmpty) this.transcendentals.check();
727
755
  if (
728
756
  hasNoEffect() &&
729
757
  NLA_PARAMS.nraCheckAssignment &&
@@ -732,8 +760,7 @@ export class NlaCore {
732
760
  result = this.nra.checkAssignment();
733
761
  if (result !== L_TRUE) this.checkAssignmentFailCount++;
734
762
  }
735
- if (hasNoEffect() && NLA_PARAMS.nra && this.nlsatBackoff.shouldRun())
736
- result = this.boundedNlsat();
763
+ if (hasNoEffect() && this.shouldRunBoundedNlsat()) result = this.boundedNlsat();
737
764
  if (hasNoEffect()) this.basics.basicLemma(true);
738
765
  if (hasNoEffect() && isDelayingBounds) this.basics.basicLemma(false);
739
766
  if (hasNoEffect() && isDelayingBounds) this.addBounds();
@@ -758,6 +785,10 @@ export class NlaCore {
758
785
  return result;
759
786
  }
760
787
 
788
+ private shouldRunBoundedNlsat() {
789
+ return NLA_PARAMS.nra && this.nlsatBackoff.shouldRun();
790
+ }
791
+
761
792
  private boundedNlsat() {
762
793
  const budget = 100000;
763
794
  const result = this.nra.check(100, budget);
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_divisions.h, src/math/lp/nla_divisions.cpp), MIT license, see
2
- // z3-license.txt.
3
1
  import { getEuclideanDiv, Rational } from "../rational";
4
2
  import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
5
3
  import { NULL_LPVAR } from "./lar-solver";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/monic.h, src/math/lp/emonics.h, src/math/lp/emonics.cpp), MIT license, see z3-license.txt.
2
1
  import { getSignedVarVar, isSignedVarNegated, negateSignedVar, type VarEqs } from "./nla-var-eqs";
3
2
  import { TrailStack, UnionFind } from "./union-find";
4
3
 
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/factorization.h), MIT license, see z3-license.txt.
2
1
  import type { Monic } from "./nla-emonics";
3
2
  import { signToRat } from "./nla-types";
4
3
 
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_grobner.h, src/math/lp/nla_grobner.cpp), MIT license, see z3-license.txt.
2
1
  // Deviation from Z3: its nlsat conflict check (is_nla_conflict) is not ported.
3
2
  import { PddMemoryOutError } from "../../../../errors";
4
3
  import { getEuclideanMod, getGcd, getLcm, Rational } from "../rational";
@@ -97,9 +96,9 @@ const isPerfectSquareCross = (
97
96
  };
98
97
 
99
98
  export class Grobner {
100
- private readonly propagatesQuotients = NLA_PARAMS.grobnerPropagateQuotients;
101
- private readonly hasGcdTest = NLA_PARAMS.grobnerGcdTest;
102
- private readonly expandsTerms = NLA_PARAMS.grobnerExpandTerms;
99
+ private propagatesQuotients = false;
100
+ private hasGcdTest = false;
101
+ private expandsTerms = false;
103
102
  private readonly manager: PddManager;
104
103
  private readonly solver: PddSolver;
105
104
  private readonly nexCreator = new NexCreator();
@@ -116,6 +115,12 @@ export class Grobner {
116
115
  this.solver = new PddSolver(this.manager, () => core.isCanceled());
117
116
  }
118
117
 
118
+ updateParams() {
119
+ this.propagatesQuotients = NLA_PARAMS.grobnerPropagateQuotients;
120
+ this.hasGcdTest = NLA_PARAMS.grobnerGcdTest;
121
+ this.expandsTerms = NLA_PARAMS.grobnerExpandTerms;
122
+ }
123
+
119
124
  run() {
120
125
  if (this.core.lra.getColumnCount() > 5000) return;
121
126
  if (this.quota === 0) this.quota = NLA_PARAMS.grQ;
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/horner.h, src/math/lp/horner.cpp, and nexvar, create_sum_from_row,
2
- // and add_deps_of_fixed from src/math/lp/nla_common.cpp), MIT license, see z3-license.txt.
3
1
  import { Rational } from "../rational";
4
2
  import { CrossNested } from "./cross-nested";
5
3
  import { type Dependency, mkJoin } from "./dependency";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_intervals.h, src/math/lp/nla_intervals.cpp), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import {
4
3
  type DepInterval,
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/monomial_bounds.{h,cpp}, src/util/mpq.h root), MIT license, see
2
- // z3-license.txt.
3
1
  import { getLcm, Rational } from "../rational";
4
2
  import { type ConstraintKind, KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
5
3
  import {
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_monotone_lemmas.h, src/math/lp/nla_monotone_lemmas.cpp), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import { KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
4
3
  import { type NlaCore } from "./nla-core";
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_order_lemmas.h, src/math/lp/nla_order_lemmas.cpp), MIT license,
2
- // see z3-license.txt.
3
1
  import { Rational } from "../rational";
4
2
  import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
5
3
  import { LarTerm } from "./lar-term";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_patcher.{h,cpp}, src/util/mpz.cpp is_perfect_square), MIT license, see z3-license.txt.
2
1
  import { Rational } from "../rational";
3
2
  import type { Impq } from "./numeric-pair";
4
3
  import type { NlaCore } from "./nla-core";
@@ -0,0 +1,220 @@
1
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
2
+ import { Anum } from "../nlsat/algebraic";
3
+ import { Rational } from "../rational";
4
+ import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
5
+ import { NULL_LPVAR } from "./lar-solver";
6
+ import { LarTerm } from "./lar-term";
7
+ import { type NlaCore } from "./nla-core";
8
+ import { LemmaBuilder, mkIneq } from "./nla-types";
9
+
10
+ const THREE = Rational.of(3n);
11
+ const MAX_UNSIGNED = 0xffffffffn;
12
+
13
+ const isUnsigned = (value: Rational) =>
14
+ value.isInt() && value.num >= 0n && value.num <= MAX_UNSIGNED;
15
+
16
+ // x != 0 => x^0 = 1
17
+ const xExp0 = (core: NlaCore, result: number, base: number, exponent: number) => {
18
+ const lemma = new LemmaBuilder(core);
19
+ lemma.addIneq(mkIneq(base, KIND_EQ, 0));
20
+ lemma.addIneq(mkIneq(exponent, KIND_NE, 0));
21
+ lemma.addIneq(mkIneq(result, KIND_EQ, 1));
22
+ return L_FALSE;
23
+ };
24
+
25
+ // y != 0 => 0^y = 0
26
+ const zeroExpY = (core: NlaCore, result: number, base: number, exponent: number) => {
27
+ const lemma = new LemmaBuilder(core);
28
+ lemma.addIneq(mkIneq(base, KIND_NE, 0));
29
+ lemma.addIneq(mkIneq(exponent, KIND_EQ, 0));
30
+ lemma.addIneq(mkIneq(result, KIND_EQ, 0));
31
+ return L_FALSE;
32
+ };
33
+
34
+ // x > 0 => x^y > 0
35
+ const xGt0 = (core: NlaCore, result: number, base: number) => {
36
+ const lemma = new LemmaBuilder(core);
37
+ lemma.addIneq(mkIneq(base, KIND_LE, 0));
38
+ lemma.addIneq(mkIneq(result, KIND_GT, 0));
39
+ return L_FALSE;
40
+ };
41
+
42
+ // x > 1, y < 0 => x^y < 1
43
+ const yLt1 = (core: NlaCore, result: number, base: number, exponent: number) => {
44
+ const lemma = new LemmaBuilder(core);
45
+ lemma.addIneq(mkIneq(base, KIND_LE, 1));
46
+ lemma.addIneq(mkIneq(exponent, KIND_GE, 0));
47
+ lemma.addIneq(mkIneq(result, KIND_LT, 1));
48
+ return L_FALSE;
49
+ };
50
+
51
+ // x > 1, y > 0 => x^y > 1
52
+ const yGt1 = (core: NlaCore, result: number, base: number, exponent: number) => {
53
+ const lemma = new LemmaBuilder(core);
54
+ lemma.addIneq(mkIneq(base, KIND_LE, 1));
55
+ lemma.addIneq(mkIneq(exponent, KIND_LE, 0));
56
+ lemma.addIneq(mkIneq(result, KIND_GT, 1));
57
+ return L_FALSE;
58
+ };
59
+
60
+ // x >= 3, y > 0 => x^y > ln(x)y + 1
61
+ const xGe3 = (core: NlaCore, result: number, base: number, exponent: number) => {
62
+ const lemma = new LemmaBuilder(core);
63
+ lemma.addIneq(mkIneq(base, KIND_LT, THREE));
64
+ lemma.addIneq(mkIneq(exponent, KIND_LE, 0));
65
+ lemma.addIneq(
66
+ mkIneq(
67
+ new LarTerm([
68
+ [result, Rational.one],
69
+ [exponent, Rational.minusOne],
70
+ ]),
71
+ KIND_GT,
72
+ 1,
73
+ ),
74
+ );
75
+ return L_FALSE;
76
+ };
77
+
78
+ export const checkPower = (core: NlaCore, result: number, base: number, exponent: number) => {
79
+ if (base === NULL_LPVAR || exponent === NULL_LPVAR || result === NULL_LPVAR) return L_UNDEF;
80
+ const lra = core.lra;
81
+ const am = core.nra.am;
82
+ const values = core.isUsingNraModel
83
+ ? [base, exponent, result].map((lpVar) => core.nra.value(lpVar))
84
+ : undefined;
85
+ if (
86
+ values === undefined &&
87
+ [base, exponent, result].some((lpVar) => !lra.getValue(lpVar).y.isZero())
88
+ )
89
+ return L_UNDEF;
90
+ const rationals =
91
+ values === undefined
92
+ ? [core.val(base), core.val(exponent), core.val(result)]
93
+ : values.every((value) => am.isRational(value))
94
+ ? values.map((value) => am.toRational(value))
95
+ : undefined;
96
+ if (rationals !== undefined) {
97
+ const baseValue = rationals[0];
98
+ const exponentValue = rationals[1];
99
+ const resultValue = rationals[2];
100
+ if (!baseValue.isZero() && exponentValue.isZero() && !resultValue.equals(Rational.one))
101
+ return xExp0(core, result, base, exponent);
102
+ if (baseValue.isZero() && !exponentValue.isZero() && !resultValue.isZero())
103
+ return zeroExpY(core, result, base, exponent);
104
+ if (baseValue.isPositive() && !resultValue.isPositive()) return xGt0(core, result, base);
105
+ if (
106
+ baseValue.compare(Rational.one) > 0 &&
107
+ exponentValue.isNegative() &&
108
+ resultValue.compare(Rational.one) >= 0
109
+ )
110
+ return yLt1(core, result, base, exponent);
111
+ if (
112
+ baseValue.compare(Rational.one) > 0 &&
113
+ exponentValue.isPositive() &&
114
+ resultValue.compare(Rational.one) <= 0
115
+ )
116
+ return yGt1(core, result, base, exponent);
117
+ if (
118
+ baseValue.compare(THREE) >= 0 &&
119
+ exponentValue.isPositive() &&
120
+ resultValue.compare(exponentValue.add(Rational.one)) <= 0
121
+ )
122
+ return xGe3(core, result, base, exponent);
123
+ if (baseValue.isPositive() && isUnsigned(exponentValue)) {
124
+ const powerValue = baseValue.pow(Number(exponentValue.num));
125
+ const comparison = resultValue.compare(powerValue);
126
+ if (comparison === 0) return L_TRUE;
127
+ if (core.random() % 2 === 0) {
128
+ const lemma = new LemmaBuilder(core);
129
+ lemma.addIneq(mkIneq(base, KIND_NE, baseValue));
130
+ lemma.addIneq(mkIneq(exponent, KIND_NE, exponentValue));
131
+ lemma.addIneq(mkIneq(result, KIND_EQ, powerValue));
132
+ return L_FALSE;
133
+ }
134
+ const isIncreasing = baseValue.compare(Rational.one) >= 0;
135
+ if (exponentValue.isPositive() && comparison < 0) {
136
+ const lemma = new LemmaBuilder(core);
137
+ lemma.addIneq(mkIneq(base, KIND_LT, baseValue));
138
+ lemma.addIneq(mkIneq(exponent, isIncreasing ? KIND_LT : KIND_GT, exponentValue));
139
+ if (!isIncreasing) lemma.addIneq(mkIneq(exponent, KIND_LT, 0));
140
+ lemma.addIneq(mkIneq(result, KIND_GE, powerValue));
141
+ return L_FALSE;
142
+ }
143
+ if (comparison > 0) {
144
+ const lemma = new LemmaBuilder(core);
145
+ lemma.addIneq(mkIneq(base, KIND_LE, 0));
146
+ lemma.addIneq(mkIneq(base, KIND_GT, baseValue));
147
+ lemma.addIneq(mkIneq(exponent, isIncreasing ? KIND_GT : KIND_LT, exponentValue));
148
+ if (isIncreasing) lemma.addIneq(mkIneq(exponent, KIND_LT, 0));
149
+ lemma.addIneq(mkIneq(result, KIND_LE, powerValue));
150
+ return L_FALSE;
151
+ }
152
+ }
153
+ if (baseValue.isPositive() && exponentValue.isPositive() && !exponentValue.isInt()) {
154
+ const num = exponentValue.num;
155
+ const den = exponentValue.den;
156
+ if (
157
+ num <= MAX_UNSIGNED &&
158
+ den <= MAX_UNSIGNED &&
159
+ resultValue.pow(Number(den)).equals(baseValue.pow(Number(num)))
160
+ )
161
+ return L_TRUE;
162
+ }
163
+ return L_UNDEF;
164
+ }
165
+ if (values === undefined) return L_UNDEF;
166
+ const baseValue = values[0];
167
+ const exponentValue = values[1];
168
+ const resultValue = values[2];
169
+ const zero = new Anum(Rational.zero);
170
+ const one = new Anum(Rational.one);
171
+ if (
172
+ am.compare(baseValue, zero) !== 0 &&
173
+ am.compare(exponentValue, zero) === 0 &&
174
+ am.compare(resultValue, one) !== 0
175
+ )
176
+ return xExp0(core, result, base, exponent);
177
+ if (
178
+ am.compare(baseValue, zero) === 0 &&
179
+ am.compare(exponentValue, zero) !== 0 &&
180
+ am.compare(resultValue, zero) !== 0
181
+ )
182
+ return zeroExpY(core, result, base, exponent);
183
+ if (am.compare(baseValue, zero) > 0 && am.compare(resultValue, zero) <= 0)
184
+ return xGt0(core, result, base);
185
+ if (
186
+ am.compare(baseValue, one) > 0 &&
187
+ am.compare(exponentValue, zero) < 0 &&
188
+ am.compare(resultValue, one) >= 0
189
+ )
190
+ return yLt1(core, result, base, exponent);
191
+ if (
192
+ am.compare(baseValue, one) > 0 &&
193
+ am.compare(exponentValue, zero) > 0 &&
194
+ am.compare(resultValue, one) <= 0
195
+ )
196
+ return yGt1(core, result, base, exponent);
197
+ if (
198
+ am.compare(baseValue, new Anum(THREE)) >= 0 &&
199
+ am.compare(exponentValue, zero) > 0 &&
200
+ am.compare(resultValue, am.add(exponentValue, one)) <= 0
201
+ )
202
+ return xGe3(core, result, base, exponent);
203
+ if (
204
+ am.compare(baseValue, zero) > 0 &&
205
+ am.compare(exponentValue, zero) > 0 &&
206
+ am.isRational(exponentValue)
207
+ ) {
208
+ const exponentRational = am.toRational(exponentValue);
209
+ if (
210
+ exponentRational.num <= MAX_UNSIGNED &&
211
+ exponentRational.den <= MAX_UNSIGNED &&
212
+ am.compare(
213
+ am.power(resultValue, Number(exponentRational.den)),
214
+ am.power(baseValue, Number(exponentRational.num)),
215
+ ) === 0
216
+ )
217
+ return L_TRUE;
218
+ }
219
+ return L_UNDEF;
220
+ };
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_tangent_lemmas.h, src/math/lp/nla_tangent_lemmas.cpp), MIT
2
- // license, see z3-license.txt.
3
1
  import { Rational } from "../rational";
4
2
  import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
5
3
  import { LarTerm } from "./lar-term";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_throttle.h, src/math/lp/nla_throttle.cpp), MIT license, see z3-license.txt.
2
1
  import type { Rational } from "../rational";
3
2
  import type { LarSolver } from "./lar-solver";
4
3
  import type { LpStats } from "./lp-settings";