tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

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 (586) 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 +37 -0
  8. package/dist/index.d.ts +37 -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 +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  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 +44 -41
  19. package/dist/transfer.js +44 -41
  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 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -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";
@@ -0,0 +1,324 @@
1
+ import { Rational } from "../rational";
2
+ import {
3
+ evalTranscendental,
4
+ getErrorBound,
5
+ PI_2_UPPER,
6
+ PI_UPPER,
7
+ type TranscendentalOp,
8
+ } from "../nlsat/transcendental-eval";
9
+ import { type ConstraintKind, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
10
+ import { NULL_LPVAR } from "./lar-solver";
11
+ import { LarTerm } from "./lar-term";
12
+ import type { NlaCore } from "./nla-core";
13
+ import { LemmaBuilder, mkIneq } from "./nla-types";
14
+
15
+ export interface TranscendentalApp {
16
+ readonly op: TranscendentalOp;
17
+ readonly arg: number;
18
+ readonly val: number;
19
+ }
20
+
21
+ export interface Atan2App {
22
+ readonly y: number;
23
+ readonly x: number;
24
+ readonly val: number;
25
+ }
26
+
27
+ // atan2 has a branch cut where it jumps by 2 pi, so its error bound is generous.
28
+ const getAtan2ErrorBound = (value: number) => 4096 * Number.EPSILON * Math.max(1, Math.abs(value));
29
+
30
+ // Z3's arith.nl.transcendental_tolerance.
31
+ const TOLERANCE = 0.0000001;
32
+
33
+ const mkTerm = (first: number, firstCoeff: number, second: number, secondCoeff: number) =>
34
+ new LarTerm([
35
+ [first, Rational.fromNumber(firstCoeff)],
36
+ [second, Rational.fromNumber(secondCoeff)],
37
+ ]);
38
+
39
+ // A cheap check of the applications of transcendental functions against the LP assignment. It adds
40
+ // exact range bounds and linear lemmas, and leaves the polynomial refinement to nlsat, which a
41
+ // value away from the function by more than round-off sends the problem to.
42
+ export class NlaTranscendentals {
43
+ readonly apps: TranscendentalApp[] = [];
44
+ readonly atan2Apps: Atan2App[] = [];
45
+ piVar = NULL_LPVAR;
46
+ numFailures = 0;
47
+
48
+ constructor(private core: NlaCore) {}
49
+
50
+ get isEmpty() {
51
+ return this.apps.length === 0 && this.atan2Apps.length === 0;
52
+ }
53
+
54
+ private addVarBound(column: number, kind: ConstraintKind, bound: Rational) {
55
+ const lra = this.core.lra;
56
+ lra.activate(lra.mkVarBound(column, kind, bound));
57
+ }
58
+
59
+ add(op: TranscendentalOp, arg: number, val: number) {
60
+ if (arg === NULL_LPVAR || val === NULL_LPVAR) return;
61
+ this.apps.push({ op, arg, val });
62
+ this.core.emons.trail.push(() => this.apps.pop());
63
+ this.addRangeAxioms(op, val);
64
+ }
65
+
66
+ addPi(val: number) {
67
+ if (val === NULL_LPVAR || this.piVar !== NULL_LPVAR) return;
68
+ this.core.emons.trail.push(() => {
69
+ this.piVar = NULL_LPVAR;
70
+ });
71
+ this.piVar = val;
72
+ this.addVarBound(val, KIND_GE, Rational.of(31415n, 10000n));
73
+ this.addVarBound(val, KIND_LE, Rational.of(31416n, 10000n));
74
+ }
75
+
76
+ addAtan2(y: number, x: number, val: number) {
77
+ if (y === NULL_LPVAR || x === NULL_LPVAR || val === NULL_LPVAR) return;
78
+ this.atan2Apps.push({ y, x, val });
79
+ this.core.emons.trail.push(() => this.atan2Apps.pop());
80
+ this.addVarBound(val, KIND_LE, PI_UPPER);
81
+ this.addVarBound(val, KIND_GE, PI_UPPER.neg());
82
+ }
83
+
84
+ private addRangeAxioms(op: TranscendentalOp, val: number) {
85
+ const addBounds = (
86
+ lowerKind: ConstraintKind,
87
+ lower: Rational,
88
+ upperKind: ConstraintKind,
89
+ upper: Rational,
90
+ ) => {
91
+ this.addVarBound(val, upperKind, upper);
92
+ this.addVarBound(val, lowerKind, lower);
93
+ };
94
+ if (op === "sin" || op === "cos") addBounds(KIND_GE, Rational.minusOne, KIND_LE, Rational.one);
95
+ else if (op === "tanh") addBounds(KIND_GT, Rational.minusOne, KIND_LT, Rational.one);
96
+ else if (op === "cosh") this.addVarBound(val, KIND_GE, Rational.one);
97
+ else if (op === "acosh") this.addVarBound(val, KIND_GE, Rational.zero);
98
+ else if (op === "asin") addBounds(KIND_GE, PI_2_UPPER.neg(), KIND_LE, PI_2_UPPER);
99
+ else if (op === "atan") addBounds(KIND_GT, PI_2_UPPER.neg(), KIND_LT, PI_2_UPPER);
100
+ else if (op === "acos") addBounds(KIND_GE, Rational.zero, KIND_LE, PI_UPPER);
101
+ else if (op === "exp") this.addVarBound(val, KIND_GT, Rational.zero);
102
+ }
103
+
104
+ // sin, tanh and atan vanish at 0 and are 1-Lipschitz, so they stay below x for x >= 0 and above
105
+ // it for x <= 0.
106
+ private checkLinearMajorant(app: TranscendentalApp) {
107
+ if (app.op !== "sin" && app.op !== "tanh" && app.op !== "atan") return false;
108
+ const arg = this.core.val(app.arg);
109
+ const val = this.core.val(app.val);
110
+ const difference = mkTerm(app.val, 1, app.arg, -1);
111
+ if (!arg.isNegative() && val.compare(arg) > 0) {
112
+ new LemmaBuilder(this.core)
113
+ .addIneq(mkIneq(app.arg, KIND_LT, 0))
114
+ .addIneq(mkIneq(difference, KIND_LE, 0));
115
+ return true;
116
+ }
117
+ if (!arg.isPositive() && val.compare(arg) < 0) {
118
+ new LemmaBuilder(this.core)
119
+ .addIneq(mkIneq(app.arg, KIND_GT, 0))
120
+ .addIneq(mkIneq(difference, KIND_GE, 0));
121
+ return true;
122
+ }
123
+ return false;
124
+ }
125
+
126
+ // sin is positive on (0, pi) and negative on (-pi, 0), and cos is positive on (-pi/2, pi/2) and
127
+ // negative on (pi/2, 3pi/2), stated in terms of the pi column rather than its bounds.
128
+ private checkSignOnPiRange(app: TranscendentalApp) {
129
+ if (this.piVar === NULL_LPVAR || (app.op !== "sin" && app.op !== "cos")) return false;
130
+ const core = this.core;
131
+ const arg = core.val(app.arg);
132
+ const val = core.val(app.val);
133
+ const pi = core.val(this.piVar);
134
+ if (app.op === "sin") {
135
+ if (arg.isPositive() && arg.compare(pi) < 0 && !val.isPositive()) {
136
+ new LemmaBuilder(this.core)
137
+ .addIneq(mkIneq(app.arg, KIND_LE, 0))
138
+ .addIneq(mkIneq(mkTerm(app.arg, 1, this.piVar, -1), KIND_GE, 0))
139
+ .addIneq(mkIneq(app.val, KIND_GT, 0));
140
+ return true;
141
+ }
142
+ if (arg.isNegative() && arg.compare(pi.neg()) > 0 && !val.isNegative()) {
143
+ new LemmaBuilder(this.core)
144
+ .addIneq(mkIneq(app.arg, KIND_GE, 0))
145
+ .addIneq(mkIneq(mkTerm(app.arg, 1, this.piVar, 1), KIND_LE, 0))
146
+ .addIneq(mkIneq(app.val, KIND_LT, 0));
147
+ return true;
148
+ }
149
+ return false;
150
+ }
151
+ const twice = arg.mul(Rational.of(2n));
152
+ if (twice.compare(pi.neg()) > 0 && twice.compare(pi) < 0 && !val.isPositive()) {
153
+ new LemmaBuilder(this.core)
154
+ .addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, 1), KIND_LE, 0))
155
+ .addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, -1), KIND_GE, 0))
156
+ .addIneq(mkIneq(app.val, KIND_GT, 0));
157
+ return true;
158
+ }
159
+ if (twice.compare(pi) > 0 && twice.compare(pi.mul(Rational.of(3n))) < 0 && !val.isNegative()) {
160
+ new LemmaBuilder(this.core)
161
+ .addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, -1), KIND_LE, 0))
162
+ .addIneq(mkIneq(mkTerm(app.arg, 2, this.piVar, -3), KIND_GE, 0))
163
+ .addIneq(mkIneq(app.val, KIND_LT, 0));
164
+ return true;
165
+ }
166
+ return false;
167
+ }
168
+
169
+ // exp(x) >= 1 + x everywhere.
170
+ private checkExpLowerBound(app: TranscendentalApp) {
171
+ if (app.op !== "exp") return false;
172
+ const arg = this.core.val(app.arg);
173
+ if (this.core.val(app.val).compare(arg.add(Rational.one)) >= 0) return false;
174
+ new LemmaBuilder(this.core).addIneq(mkIneq(mkTerm(app.val, 1, app.arg, -1), KIND_GE, 1));
175
+ return true;
176
+ }
177
+
178
+ // log(x) <= x - 1 for x > 0.
179
+ private checkLogUpperBound(app: TranscendentalApp) {
180
+ if (app.op !== "log") return false;
181
+ const arg = this.core.val(app.arg);
182
+ if (!arg.isPositive() || this.core.val(app.val).compare(arg.sub(Rational.one)) <= 0)
183
+ return false;
184
+ new LemmaBuilder(this.core)
185
+ .addIneq(mkIneq(app.arg, KIND_LE, 0))
186
+ .addIneq(mkIneq(mkTerm(app.val, 1, app.arg, -1), KIND_LE, -1));
187
+ return true;
188
+ }
189
+
190
+ // x1 < x2 implies exp(x1) < exp(x2).
191
+ private checkExpMonotonicity(app: TranscendentalApp) {
192
+ if (app.op !== "exp") return false;
193
+ const core = this.core;
194
+ const arg = core.val(app.arg);
195
+ const val = core.val(app.val);
196
+ for (const other of this.apps) {
197
+ if (other.op !== "exp" || other.arg === app.arg) continue;
198
+ const otherArg = core.val(other.arg);
199
+ const otherVal = core.val(other.val);
200
+ if (arg.compare(otherArg) < 0 && val.compare(otherVal) >= 0) {
201
+ new LemmaBuilder(core)
202
+ .addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_GE, 0))
203
+ .addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_LT, 0));
204
+ return true;
205
+ }
206
+ if (arg.compare(otherArg) > 0 && val.compare(otherVal) <= 0) {
207
+ new LemmaBuilder(core)
208
+ .addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_LE, 0))
209
+ .addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_GT, 0));
210
+ return true;
211
+ }
212
+ }
213
+ return false;
214
+ }
215
+
216
+ // 0 < x1 < x2 implies log(x1) < log(x2).
217
+ private checkLogMonotonicity(app: TranscendentalApp) {
218
+ if (app.op !== "log") return false;
219
+ const core = this.core;
220
+ const arg = core.val(app.arg);
221
+ if (!arg.isPositive()) return false;
222
+ const val = core.val(app.val);
223
+ for (const other of this.apps) {
224
+ if (other.op !== "log" || other.arg === app.arg) continue;
225
+ const otherArg = core.val(other.arg);
226
+ if (!otherArg.isPositive()) continue;
227
+ const otherVal = core.val(other.val);
228
+ if (arg.compare(otherArg) < 0 && val.compare(otherVal) >= 0) {
229
+ new LemmaBuilder(core)
230
+ .addIneq(mkIneq(app.arg, KIND_LE, 0))
231
+ .addIneq(mkIneq(other.arg, KIND_LE, 0))
232
+ .addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_GE, 0))
233
+ .addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_LT, 0));
234
+ return true;
235
+ }
236
+ if (arg.compare(otherArg) > 0 && val.compare(otherVal) <= 0) {
237
+ new LemmaBuilder(core)
238
+ .addIneq(mkIneq(app.arg, KIND_LE, 0))
239
+ .addIneq(mkIneq(other.arg, KIND_LE, 0))
240
+ .addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), KIND_LE, 0))
241
+ .addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), KIND_GT, 0));
242
+ return true;
243
+ }
244
+ }
245
+ return false;
246
+ }
247
+
248
+ // A value away from the function by more than round-off is a failure, which only nlsat can
249
+ // settle. A value outside the domain is left to the rest of the solver.
250
+ private checkApp(app: TranscendentalApp) {
251
+ if (
252
+ this.checkLinearMajorant(app) ||
253
+ this.checkSignOnPiRange(app) ||
254
+ this.checkExpLowerBound(app) ||
255
+ this.checkExpMonotonicity(app) ||
256
+ this.checkLogUpperBound(app) ||
257
+ this.checkLogMonotonicity(app)
258
+ )
259
+ return true;
260
+ const arg = this.core.val(app.arg).toDouble();
261
+ const result = evalTranscendental(app.op, arg);
262
+ if (!Number.isFinite(result)) return false;
263
+ const distance = Math.abs(this.core.val(app.val).toDouble() - result);
264
+ if (distance > getErrorBound(app.op, arg, result)) this.numFailures++;
265
+ return false;
266
+ }
267
+
268
+ // sign(atan2(y, x)) = sign(y) for y != 0. Past that, a value away from atan2 by more than the
269
+ // tolerance splits on x.
270
+ private checkAtan2(app: Atan2App) {
271
+ const core = this.core;
272
+ const y = core.val(app.y);
273
+ const x = core.val(app.x);
274
+ const val = core.val(app.val);
275
+ if (y.isPositive() && !val.isPositive()) {
276
+ new LemmaBuilder(this.core)
277
+ .addIneq(mkIneq(app.y, KIND_LE, 0))
278
+ .addIneq(mkIneq(app.val, KIND_GT, 0));
279
+ return true;
280
+ }
281
+ if (y.isNegative() && !val.isNegative()) {
282
+ new LemmaBuilder(this.core)
283
+ .addIneq(mkIneq(app.y, KIND_GE, 0))
284
+ .addIneq(mkIneq(app.val, KIND_LT, 0));
285
+ return true;
286
+ }
287
+ const result = Math.atan2(y.toDouble(), x.toDouble());
288
+ if (!Number.isFinite(result)) return false;
289
+ const distance = Math.abs(val.toDouble() - result);
290
+ const error = getAtan2ErrorBound(result);
291
+ if (distance <= error) return false;
292
+ this.numFailures++;
293
+ if (distance <= error + TOLERANCE) return false;
294
+ core.literals.push(mkIneq(app.x, KIND_LE, x));
295
+ return true;
296
+ }
297
+
298
+ check() {
299
+ if (this.isEmpty || this.core.isUsingNraModel) return;
300
+ for (const app of this.apps) if (this.checkApp(app)) return;
301
+ for (const app of this.atan2Apps) if (this.checkAtan2(app)) return;
302
+ }
303
+
304
+ isNraModelValid() {
305
+ const core = this.core;
306
+ if (!core.isUsingNraModel) return false;
307
+ const getMiddle = (lpVar: number) => {
308
+ const [low, high] = core.nra.am.getInterval(core.nra.value(lpVar), 64);
309
+ return low.add(high).div(Rational.of(2n)).toDouble();
310
+ };
311
+ for (const app of this.apps) {
312
+ const arg = getMiddle(app.arg);
313
+ const result = evalTranscendental(app.op, arg);
314
+ if (!Number.isFinite(result)) continue;
315
+ if (Math.abs(getMiddle(app.val) - result) > getErrorBound(app.op, arg, result)) return false;
316
+ }
317
+ for (const app of this.atan2Apps) {
318
+ const result = Math.atan2(getMiddle(app.y), getMiddle(app.x));
319
+ if (!Number.isFinite(result)) continue;
320
+ if (Math.abs(getMiddle(app.val) - result) > getAtan2ErrorBound(result)) return false;
321
+ }
322
+ return true;
323
+ }
324
+ }
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_types.h, src/math/lp/nla_defs.h, src/math/lp/nla_common.h, and
2
- // lemma_builder of src/math/lp/nla_core.cpp), MIT 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 { Explanation } from "./explanation";
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/var_eqs.h, src/math/lp/nla_defs.h), MIT license, see z3-license.txt.
2
1
  import type { Dependency } from "./dependency";
3
2
  import type { Explanation } from "./explanation";
4
3
  import { TrailStack, UnionFind, type UnionFindHandler } from "./union-find";