tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

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 (631) hide show
  1. package/README.md +8 -0
  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 +121 -12
  8. package/dist/index.d.ts +121 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,7 +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. Horner
3
- // lemmas: a tableau row is a sum that equals zero. Each cross-nested form of the row that
4
- // intervals proves nonzero yields a conflict.
5
1
  import { Rational } from "../rational";
6
2
  import { CrossNested } from "./cross-nested";
7
3
  import { type Dependency, mkJoin } from "./dependency";
@@ -12,7 +8,6 @@ import type { RowCell } from "./static-matrix";
12
8
 
13
9
  export class Horner {
14
10
  private readonly nexCreator = new NexCreator();
15
- // The joined bounds of the fixed variables that the row's sum replaced by their values.
16
11
  private fixedDep: Dependency = null;
17
12
 
18
13
  constructor(private readonly core: NlaCore) {}
@@ -38,7 +33,6 @@ export class Horner {
38
33
  return false;
39
34
  }
40
35
 
41
- // row_is_interesting: whether two monomials of the row share a variable.
42
36
  private rowIsInteresting(row: RowCell[]) {
43
37
  if (row.length > NLA_PARAMS.hornerRowLengthLimit) return false;
44
38
  const core = this.core;
@@ -60,7 +54,7 @@ export class Horner {
60
54
  const core = this.core;
61
55
  core.activeVarSet.clear();
62
56
  this.fixedDep = null;
63
- const summands = row.map((cell) => this.nexvar(cell.coeff, cell.column));
57
+ const summands = row.map((cell) => this.mkNexVar(cell.coeff, cell.column));
64
58
  const fixedDep = this.fixedDep;
65
59
  this.setActiveVarsWeights();
66
60
  const expr = this.nexCreator.simplify(this.nexCreator.mkSum(summands));
@@ -76,21 +70,17 @@ export class Horner {
76
70
  return crossNested.done();
77
71
  }
78
72
 
79
- // set_active_vars_weights: without the weights the comparisons of nex_creator are wrong.
80
73
  private setActiveVarsWeights() {
81
74
  this.nexCreator.setNumberOfVars(this.core.lra.getColumnCount());
82
75
  for (const lpVar of this.core.activeVarSet.elems)
83
76
  this.nexCreator.setVarWeight(lpVar, this.core.getVarWeight(lpVar));
84
77
  }
85
78
 
86
- // add_deps_of_fixed.
87
79
  private addDepsOfFixed(lpVar: number) {
88
80
  this.fixedDep = mkJoin(this.fixedDep, this.core.lra.getBoundWitnesses(lpVar));
89
81
  }
90
82
 
91
- // nexvar: coeff times the column, a product for a monic, where hornerSubsFixed replaces fixed
92
- // variables by their values (1) or only those fixed to zero (2).
93
- private nexvar(coeff: Rational, lpVar: number): Nex {
83
+ private mkNexVar(coeff: Rational, lpVar: number): Nex {
94
84
  const core = this.core;
95
85
  const creator = this.nexCreator;
96
86
  const subsFixed: number = NLA_PARAMS.hornerSubsFixed;
@@ -1,7 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_intervals.h, src/math/lp/nla_intervals.cpp), MIT license, see
2
- // z3-license.txt. Evaluates a nex expression over the bounds of its variables. When the interval
3
- // excludes zero, the expression cannot vanish, so the bounds behind the interval and the
4
- // dependencies of the row conflict with the row's equation, and the conflict becomes a lemma.
5
1
  import { Rational } from "../rational";
6
2
  import {
7
3
  type DepInterval,
@@ -38,7 +34,6 @@ const mkExplanation = (constraints: number[]) => {
38
34
  export class Intervals {
39
35
  constructor(private readonly core: NlaCore) {}
40
36
 
41
- // check_nex: whether the expression's interval excludes zero, in which case a lemma explains it.
42
37
  checkNex(expr: Nex, initialDeps: Dependency) {
43
38
  const report: ReportConflict = (explanation) =>
44
39
  new LemmaBuilder(this.core).addExplanation(explanation);
@@ -74,8 +69,6 @@ export class Intervals {
74
69
  return hasInf;
75
70
  }
76
71
 
77
- // expression_to_normalized_term: the sum a*t + b, where t is the linear part divided by the
78
- // coefficient of its smallest variable, which is a.
79
72
  private expressionToNormalizedTerm(sum: NexSum) {
80
73
  const pairs: [Rational, number][] = [];
81
74
  let constant = Rational.zero;
@@ -134,8 +127,6 @@ export class Intervals {
134
127
  if (mode === "with-deps") interval.upperDep = upperDep;
135
128
  }
136
129
 
137
- // interval_from_term: the interval of a linear sum from the bounds of the term column that
138
- // equals it, or from an equivalence that fixes it.
139
130
  private intervalFromTerm(sum: NexSum, interval: DepInterval, mode: DepsMode) {
140
131
  const normalized = this.expressionToNormalizedTerm(sum);
141
132
  const explanation = new Explanation();
@@ -176,12 +167,11 @@ export class Intervals {
176
167
  return true;
177
168
  }
178
169
 
179
- // conflict_u_l: whether first's upper bound is below second's lower bound. Like Z3, equal
180
- // bounds conflict when either upper bound is open.
181
170
  private conflictUpperLower(first: DepInterval, second: DepInterval) {
182
171
  if (first.isUpperInf || second.isLowerInf) return false;
183
172
  const comparison = first.upper.compare(second.lower);
184
173
  if (comparison !== 0) return comparison < 0;
174
+ // Like Z3, equal bounds conflict when either upper bound is open.
185
175
  return first.isUpperOpen || second.isUpperOpen;
186
176
  }
187
177
 
@@ -242,7 +232,6 @@ export class Intervals {
242
232
  set(interval, result, mode);
243
233
  }
244
234
 
245
- // interval_of_expr: false when a sum met a conflict, which report received.
246
235
  private intervalOfExpr(
247
236
  expr: Nex,
248
237
  exponent: number,
@@ -1,12 +1,7 @@
1
- // Ported from Z3 (src/math/lp/monomial_bounds.{h,cpp}, src/util/mpq.h root), MIT license, see
2
- // z3-license.txt. Bounds of monomials from the intervals of their factors and back, the
3
- // linearization of monomials with at most one non-fixed factor, and the optimization of the bounds
4
- // of nonlinear variables over the tableau. The shared-factor and binomial-sign lemmas, off by
5
- // default (arith.nl.monomial_sandwich, arith.nl.monomial_binomial_sign), are not ported.
6
1
  import { getLcm, Rational } from "../rational";
7
2
  import { type ConstraintKind, KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
8
3
  import {
9
- DepInterval,
4
+ type DepInterval,
10
5
  div,
11
6
  mkDepInterval,
12
7
  mul,
@@ -16,7 +11,7 @@ import {
16
11
  setValue,
17
12
  } from "./dep-intervals";
18
13
  import { LP_INFEASIBLE } from "./core-solver";
19
- import { Dependency, linearize, mkJoin } from "./dependency";
14
+ import { type Dependency, linearize, mkJoin } from "./dependency";
20
15
  import { Explanation } from "./explanation";
21
16
  import { NULL_LPVAR } from "./lar-solver";
22
17
  import { Impq } from "./numeric-pair";
@@ -40,8 +35,7 @@ interface ImprovedBound {
40
35
  const getAbs = (value: Impq) =>
41
36
  value.x.isNegative() || (value.x.isZero() && value.y.isNegative()) ? value.neg() : value;
42
37
 
43
- // normalize_gain: rounds a value down to a multiple of an integral divisor, -1 meaning none.
44
- const roundDown = (value: Impq, divisor: Rational) => {
38
+ const normalizeGain = (value: Impq, divisor: Rational) => {
45
39
  if (divisor.equals(Rational.one)) return new Impq(value.floor());
46
40
  if (divisor.equals(Rational.minusOne)) return value;
47
41
  return new Impq(value.div(divisor).floor().mul(divisor));
@@ -50,8 +44,6 @@ const roundDown = (value: Impq, divisor: Rational) => {
50
44
  export class MonomialBounds {
51
45
  constructor(private core: NlaCore) {}
52
46
 
53
- // generate_lemmas: with the sandwich and binomial-sign lemmas off, the conflict of an infeasible
54
- // lp solver, once some monic needs refinement.
55
47
  generateLemmas() {
56
48
  if (this.core.toRefine.size > 0) this.addLemma();
57
49
  }
@@ -87,7 +79,6 @@ export class MonomialBounds {
87
79
  } else interval.isUpperInf = true;
88
80
  }
89
81
 
90
- // tighten_lp: the bounds of the factors from the monic's interval, and of the monic from theirs.
91
82
  private tightenLp(monic: Monic) {
92
83
  const analysis = this.analyzeMonomial(monic);
93
84
  const isPropagatingUp = analysis.numFree === 0;
@@ -145,7 +136,6 @@ export class MonomialBounds {
145
136
  );
146
137
  }
147
138
 
148
- // analyze_monomial: the number of free variables of odd degree, and the last of them.
149
139
  private analyzeMonomial(monic: Monic) {
150
140
  let numFree = 0;
151
141
  let freeVar = -1;
@@ -176,7 +166,6 @@ export class MonomialBounds {
176
166
  return isPropagated;
177
167
  }
178
168
 
179
- // add_lemma: a conflict lemma when the lp solver is infeasible.
180
169
  private addLemma() {
181
170
  const lra = this.core.lra;
182
171
  if (lra.status !== LP_INFEASIBLE) return false;
@@ -195,21 +184,16 @@ export class MonomialBounds {
195
184
  }
196
185
 
197
186
  private linearize(monic: Monic, nonFixed: number, fixedToZero: number) {
198
- let isPropagated: boolean;
199
- if (fixedToZero !== -1) isPropagated = this.propagateFixedToZero(monic, fixedToZero);
200
- else {
201
- const product = this.getFixedVarProduct(monic, nonFixed);
202
- isPropagated =
203
- nonFixed === -1
204
- ? this.propagateFixed(monic, product)
205
- : this.propagateNonfixed(monic, product, nonFixed);
206
- }
187
+ const isPropagated =
188
+ fixedToZero !== -1
189
+ ? this.propagateFixedToZero(monic, fixedToZero)
190
+ : nonFixed === -1
191
+ ? this.propagateFixed(monic, this.getFixedVarProduct(monic, nonFixed))
192
+ : this.propagateNonfixed(monic, this.getFixedVarProduct(monic, nonFixed), nonFixed);
207
193
  if (isPropagated) this.core.stats.nlaPropagateEq++;
208
194
  return isPropagated;
209
195
  }
210
196
 
211
- // propagate_violated_linear_monomials: the defining rows of violated monomials with at most one
212
- // non-fixed factor, except for small fixed products, which branching enumerates.
213
197
  propagateViolatedLinearMonomials() {
214
198
  const core = this.core;
215
199
  if (!NLA_PARAMS.linearizeViolatedMonomials || !core.lra.isFeasible()) return false;
@@ -220,7 +204,7 @@ export class MonomialBounds {
220
204
  if (linear === undefined) continue;
221
205
  if (linear.fixedToZero === -1 && linear.nonFixed !== -1) {
222
206
  const product = this.getFixedVarProduct(monic, linear.nonFixed);
223
- if (product.isInt() && getBitSize(product) <= 16) continue;
207
+ if (product.isInt() && getNumeratorBitSize(product) <= 16) continue;
224
208
  }
225
209
  if (this.linearize(monic, linear.nonFixed, linear.fixedToZero)) isPropagated = true;
226
210
  if (core.lra.status === LP_INFEASIBLE) break;
@@ -261,7 +245,6 @@ export class MonomialBounds {
261
245
  return true;
262
246
  }
263
247
 
264
- // propagate_nonfixed: the row m - k * w = 0.
265
248
  private propagateNonfixed(monic: Monic, coeff: Rational, nonFixed: number) {
266
249
  const core = this.core;
267
250
  if (core.val(monic.variable).equals(coeff.mul(core.val(nonFixed)))) return false;
@@ -298,7 +281,6 @@ export class MonomialBounds {
298
281
  return dep;
299
282
  }
300
283
 
301
- // is_linear: the one non-fixed factor, or a factor fixed to zero, unless two are non-fixed.
302
284
  private getLinear(monic: Monic) {
303
285
  const core = this.core;
304
286
  let nonFixed = -1;
@@ -311,7 +293,6 @@ export class MonomialBounds {
311
293
  return { nonFixed, fixedToZero: -1 };
312
294
  }
313
295
 
314
- // fixed_var_product: from the lower bounds, since a value may lie outside its bounds.
315
296
  private getFixedVarProduct(monic: Monic, nonFixed: number) {
316
297
  let product = Rational.one;
317
298
  for (const lpVar of monic.vars)
@@ -319,7 +300,6 @@ export class MonomialBounds {
319
300
  return product;
320
301
  }
321
302
 
322
- // range is an interval that v^p lies in: v's upper bound from it.
323
303
  private tightenLpUpperBound(range: DepInterval, lpVar: number, exponent: number) {
324
304
  const core = this.core;
325
305
  const isImprovingUpper = (candidate: Rational) =>
@@ -392,7 +372,6 @@ export class MonomialBounds {
392
372
  return isTightened;
393
373
  }
394
374
 
395
- // propagate_lp_bound: a bound on v, integral when v is.
396
375
  private propagateLpBound(lpVar: number, kind: ConstraintKind, value: Rational, dep: Dependency) {
397
376
  const lra = this.core.lra;
398
377
  const update = (updateKind: ConstraintKind, bound: Rational) =>
@@ -419,9 +398,6 @@ export class MonomialBounds {
419
398
  return isNewBound;
420
399
  }
421
400
 
422
- // max_min: a bounded-effort primal simplex walk that maximizes or minimizes a column, keeping
423
- // integer columns integral, as theory_arith::max_min does.
424
-
425
401
  private isSafeGain(gain: Gain) {
426
402
  return gain.isUnbounded || new Impq(gain.minGain).compare(gain.maxGain) <= 0;
427
403
  }
@@ -462,12 +438,12 @@ export class MonomialBounds {
462
438
  gain.minGain = gain.minGain.isNegative()
463
439
  ? coeffDen
464
440
  : Rational.of(getLcm(gain.minGain.num, coeffDen.num));
465
- if (!gain.isUnbounded) gain.maxGain = roundDown(gain.maxGain, gain.minGain);
441
+ if (!gain.isUnbounded) gain.maxGain = normalizeGain(gain.maxGain, gain.minGain);
466
442
  }
467
443
  if (isBasicInt && !gain.isUnbounded && !gain.maxGain.isInt())
468
- gain.maxGain = roundDown(new Impq(gain.maxGain.floor()), gain.minGain);
444
+ gain.maxGain = normalizeGain(new Impq(gain.maxGain.floor()), gain.minGain);
469
445
  if (!isBounded) return false;
470
- if (isBasicInt) maxIncrease = roundDown(new Impq(maxIncrease.floor()), gain.minGain);
446
+ if (isBasicInt) maxIncrease = normalizeGain(new Impq(maxIncrease.floor()), gain.minGain);
471
447
  if (gain.isUnbounded) {
472
448
  gain.isUnbounded = false;
473
449
  gain.maxGain = maxIncrease;
@@ -588,7 +564,7 @@ export class MonomialBounds {
588
564
  if (bestEfforts !== 0 || !core.x[target].y.isZero()) return undefined;
589
565
  return core.x[target].x;
590
566
  }
591
- const gain: Gain = best;
567
+ const gain = best;
592
568
  if (gain.minGain.isPositive() && !gain.minGain.equals(Rational.one)) bestEfforts++;
593
569
  if (leaving === -1) {
594
570
  const hasBlockingBound = isIncreasing
@@ -616,7 +592,6 @@ export class MonomialBounds {
616
592
  return undefined;
617
593
  }
618
594
 
619
- // mm_dep_from_row: the witnesses of the bounds that bound the column through its row.
620
595
  private getDepFromRow(target: number, isMaximizing: boolean) {
621
596
  const lra = this.core.lra;
622
597
  const core = lra.core;
@@ -656,8 +631,6 @@ export class MonomialBounds {
656
631
  return { bound, dep };
657
632
  }
658
633
 
659
- // optimize_nl_bounds: tightens the bounds of the variables of monomials by optimizing each over
660
- // the tableau, then applies them together and makes the tableau feasible again.
661
634
  optimizeNlBounds() {
662
635
  const core = this.core;
663
636
  const lra = core.lra;
@@ -709,7 +682,7 @@ export class MonomialBounds {
709
682
  }
710
683
  }
711
684
 
712
- const getBitSize = (value: Rational) => {
685
+ const getNumeratorBitSize = (value: Rational) => {
713
686
  const magnitude = value.num < 0n ? -value.num : value.num;
714
687
  return magnitude === 0n ? 1 : magnitude.toString(2).length;
715
688
  };
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_monotone_lemmas.h, src/math/lp/nla_monotone_lemmas.cpp), MIT
2
- // license, see z3-license.txt. The monotonicity lemmas of nla: the absolute value of a monomial is
3
- // at most, or at least, the product of its factors' absolute values when they are.
4
1
  import { Rational } from "../rational";
5
2
  import { KIND_GE, KIND_GT, KIND_LE, KIND_LT } from "./constraints";
6
3
  import { type NlaCore } from "./nla-core";
@@ -22,7 +19,7 @@ export class Monotone {
22
19
  private monotonicityLemmaOnMonic(monic: Monic) {
23
20
  const core = this.core;
24
21
  if (core.monHasZero(monic.vars) || core.hasBigNum(monic)) return;
25
- const productValue = core.productValue(monic).abs();
22
+ const productValue = core.mulVal(monic).abs();
26
23
  const monicValue = core.varVal(monic).abs();
27
24
  const isLt = monicValue.compare(productValue) < 0;
28
25
  if (core.throttle.insertMonotone(THROTTLE_MONOTONE_LEMMA, monic.variable, isLt)) return;
@@ -30,7 +27,6 @@ export class Monotone {
30
27
  else if (monicValue.compare(productValue) > 0) this.monotonicityLemmaGt(monic);
31
28
  }
32
29
 
33
- // /\_i |m[i]| <= |val(m[i])| => |m| <= |product_i val(m[i])|
34
30
  private monotonicityLemmaGt(monic: Monic) {
35
31
  const core = this.core;
36
32
  const lemma = new LemmaBuilder(core);
@@ -44,7 +40,6 @@ export class Monotone {
44
40
  lemma.addIneq(mkIneq(monic.variable, product.isNegative() ? KIND_GE : KIND_LE, product));
45
41
  }
46
42
 
47
- // /\_i |m[i]| >= |val(m[i])| => |m| >= |product_i val(m[i])|
48
43
  private monotonicityLemmaLt(monic: Monic) {
49
44
  const core = this.core;
50
45
  const lemma = new LemmaBuilder(core);
@@ -1,6 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_order_lemmas.h, src/math/lp/nla_order_lemmas.cpp), MIT
2
- // license, see z3-license.txt. The order lemmas of nla: a > b and c > 0 imply ac > bc, over the
3
- // binary factorizations of the monomials to refine, and the sign lemmas of binomials.
4
1
  import { Rational } from "../rational";
5
2
  import { KIND_EQ, KIND_GE, KIND_GT, KIND_LE, KIND_LT, KIND_NE } from "./constraints";
6
3
  import { LarTerm } from "./lar-term";
@@ -34,7 +31,6 @@ export class Order {
34
31
  }
35
32
  }
36
33
 
37
- // Either variable of the binomial plays the role of c.
38
34
  private orderLemmaOnBinomial(ac: Monic) {
39
35
  const core = this.core;
40
36
  const isGt = core.varVal(ac).compare(core.mulVal(ac)) > 0;
@@ -44,7 +40,6 @@ export class Order {
44
40
  }
45
41
  }
46
42
 
47
- // y <= 0 or x < a or xy >= ay, and the like for the sign of val(xy) - val(x) * val(y).
48
43
  private orderLemmaOnBinomialSign(xy: Monic, x: number, y: number, sign: number) {
49
44
  if (!NLA_PARAMS.orderBinomialSign) return;
50
45
  const core = this.core;
@@ -69,7 +64,6 @@ export class Order {
69
64
  );
70
65
  }
71
66
 
72
- // The monics bd with d equivalent to ac[k].
73
67
  private orderLemmaOnFactorBinomialExplore(ac: Monic, k: number) {
74
68
  const core = this.core;
75
69
  for (const bd of core.emons.getProductsOf(ac.vars[k])) {
@@ -85,7 +79,6 @@ export class Order {
85
79
  if (b !== undefined) this.orderLemmaOnBinomialAcBd(ac, k, bd, b, d.variable);
86
80
  }
87
81
 
88
- // ac >= bd && |c| = |d| => ac/|c| >= bd/|d|
89
82
  private orderLemmaOnBinomialAcBd(ac: Monic, k: number, bd: Monic, b: Factor, d: number) {
90
83
  const core = this.core;
91
84
  const a = ac.vars[1 - k];
@@ -102,7 +95,6 @@ export class Order {
102
95
  this.generateMonOl(ac, a, cSign, c, bd, b, dSign, d, KIND_GT);
103
96
  }
104
97
 
105
- // ac > bd => ac/|c| > bd/|d| => a*c_sign > b*d_sign, whose last inequality does not hold.
106
98
  private generateMonOl(
107
99
  ac: Monic,
108
100
  a: number,
@@ -158,7 +150,6 @@ export class Order {
158
150
  lemma.explainVar(d);
159
151
  }
160
152
 
161
- // ac_f[k] plays the role of c.
162
153
  private orderLemmaOnAcAndBc(ac: Monic, acFactorization: Factorization, k: number, bd: Monic) {
163
154
  const factors = acFactorization.factors;
164
155
  const b = this.core.divide(bd, factors[k]);
@@ -167,7 +158,6 @@ export class Order {
167
158
  );
168
159
  }
169
160
 
170
- // m = ab: a monic n = cd with |b| = |d| gives m R n & |b| = |d| => ab/|b| R cd/|d|.
171
161
  private orderLemmaOnFactorization(monic: Monic, ab: Factorization) {
172
162
  const core = this.core;
173
163
  let isNegated = false;
@@ -227,7 +217,6 @@ export class Order {
227
217
  this.explainOl(lemma, ac, a, bc, b, c);
228
218
  }
229
219
 
230
- // c > 0 and ac >= bc => a >= b, and the like for the other signs and relations.
231
220
  private generateOl(ac: Monic, a: Factor, c: Factor, bc: Monic, b: Factor) {
232
221
  const core = this.core;
233
222
  const lemma = new LemmaBuilder(core);
@@ -263,7 +252,6 @@ export class Order {
263
252
  lemma.explainFactor(c);
264
253
  }
265
254
 
266
- // ac = a*c and bc = b*c: ac >= bc implies ac/|c| >= bc/|c|.
267
255
  private orderLemmaOnAcAndBcAndFactors(ac: Monic, a: Factor, c: Factor, bc: Monic, b: Factor) {
268
256
  const core = this.core;
269
257
  const cSign = Rational.fromNumber(getRatSign(core.valFactor(c)));
@@ -282,7 +270,6 @@ export class Order {
282
270
  return false;
283
271
  }
284
272
 
285
- // sign * m = ab: b != val(b) or sign*m <= a*val(b), or >= when not gt.
286
273
  private orderLemmaOnAb(
287
274
  lemma: LemmaBuilder,
288
275
  monic: Monic,
@@ -1,12 +1,8 @@
1
- // Ported from Z3 (src/math/lp/nla_patcher.{h,cpp}, src/util/mpz.cpp is_perfect_square), MIT
2
- // license, see z3-license.txt. Moves the values of monic variables, or of one of their factors, to
3
- // agree with the products, without breaking monics that are already correct.
4
1
  import { Rational } from "../rational";
5
2
  import type { Impq } from "./numeric-pair";
6
3
  import type { NlaCore } from "./nla-core";
7
4
  import type { Monic } from "./nla-emonics";
8
5
 
9
- // in_power: whether the variable at an index occurs next to an equal one.
10
6
  const isInPower = (vars: number[], index: number) => {
11
7
  const lpVar = vars[index];
12
8
  return (
@@ -42,7 +38,7 @@ export class Patcher {
42
38
  const core = this.core;
43
39
  const update = (monic: Monic) => {
44
40
  if (core.varVal(monic).equals(core.mulVal(monic))) core.eraseFromToRefine(monic.variable);
45
- else core.insertToRefine(monic.variable);
41
+ else core.toRefine.add(monic.variable);
46
42
  };
47
43
  for (const monic of core.emons.getUseList(lpVar)) update(monic);
48
44
  if (core.isMonicVar(lpVar)) update(core.emon(lpVar));
@@ -82,8 +78,8 @@ export class Patcher {
82
78
  const root = product.root(2);
83
79
  if (root === undefined) return;
84
80
  this.patchedVar = monic.vars[0];
85
- if (!this.varBreaksCorrectMonic(this.patchedVar))
86
- if (this.tryToPatch(root) || this.tryToPatch(root.neg())) return;
81
+ if (!this.varBreaksCorrectMonic(this.patchedVar) && !this.tryToPatch(root))
82
+ this.tryToPatch(root.neg());
87
83
  return;
88
84
  }
89
85
  if (product.isZero()) return;
@@ -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
+ };