tla-ts 0.0.10-dev.8aec06f77 → 0.0.10-dev.8be00045c

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 (509) hide show
  1. package/dist/deciders.cjs +37 -36
  2. package/dist/deciders.js +55 -54
  3. package/dist/index.cjs +1 -1
  4. package/dist/index.d.cts +4 -1
  5. package/dist/index.d.ts +4 -1
  6. package/dist/index.js +1 -1
  7. package/dist/parallel-worker.cjs +1 -1
  8. package/dist/parallel-worker.js +1 -1
  9. package/dist/prove.cjs +146 -58
  10. package/dist/prove.js +143 -55
  11. package/dist/run.cjs +43 -43
  12. package/dist/run.js +45 -45
  13. package/dist/transfer.cjs +29 -26
  14. package/dist/transfer.js +43 -40
  15. package/dist/worker.cjs +1 -1
  16. package/dist/worker.js +1 -1
  17. package/package.json +1 -1
  18. package/src/ast.ts +3 -3
  19. package/src/bags.ts +46 -28
  20. package/src/check-trace.ts +2 -16
  21. package/src/check.ts +336 -88
  22. package/src/cli/runtime-invariants.ts +20 -56
  23. package/src/cli/tlapm.ts +261 -68
  24. package/src/cli/tlc-arguments.ts +2 -2
  25. package/src/cli/tlc-output.ts +4 -5
  26. package/src/cli/tlc-usage.ts +0 -1
  27. package/src/cli/tlc.ts +26 -7
  28. package/src/dependencies.ts +23 -2
  29. package/src/dfid.ts +9 -2
  30. package/src/environment.ts +27 -5
  31. package/src/errors.ts +1 -1
  32. package/src/evaluate.ts +9 -3
  33. package/src/exit-codes.ts +5 -2
  34. package/src/instances.ts +1 -1
  35. package/src/levels.ts +134 -86
  36. package/src/liveness-checker.ts +572 -204
  37. package/src/liveness.ts +47 -32
  38. package/src/obligations/action.ts +0 -2
  39. package/src/obligations/anonymize.ts +2 -6
  40. package/src/obligations/equality.ts +0 -2
  41. package/src/obligations/expression.ts +0 -2
  42. package/src/obligations/format.ts +0 -2
  43. package/src/obligations/generate.ts +0 -2
  44. package/src/obligations/index.ts +5 -3
  45. package/src/obligations/levels.ts +0 -2
  46. package/src/obligations/module.ts +0 -2
  47. package/src/obligations/normalize.ts +0 -2
  48. package/src/obligations/operators.ts +0 -2
  49. package/src/obligations/pragma.ts +2 -2
  50. package/src/obligations/printer.ts +0 -2
  51. package/src/obligations/proof.ts +0 -2
  52. package/src/obligations/regroup.ts +0 -2
  53. package/src/obligations/simplify.ts +0 -2
  54. package/src/obligations/subexpression.ts +0 -2
  55. package/src/obligations/substitution.ts +0 -2
  56. package/src/obligations/temporal.ts +0 -2
  57. package/src/obligations/tuples.ts +0 -2
  58. package/src/parallel-worker.ts +8 -2
  59. package/src/parallel.ts +7 -2
  60. package/src/parser.ts +224 -82
  61. package/src/pretty-print.ts +1 -1
  62. package/src/prover/deciders.ts +1 -8
  63. package/src/prover/isabelle/encode.ts +0 -2
  64. package/src/prover/isabelle/isar/attrib.ts +86 -49
  65. package/src/prover/isabelle/isar/context.ts +25 -26
  66. package/src/prover/isabelle/isar/induct.ts +2 -9
  67. package/src/prover/isabelle/isar/method.ts +5 -9
  68. package/src/prover/isabelle/isar/proof.ts +33 -18
  69. package/src/prover/isabelle/isar/rule-cases.ts +14 -22
  70. package/src/prover/isabelle/isar/theory.ts +16 -17
  71. package/src/prover/isabelle/isar/toplevel.ts +46 -56
  72. package/src/prover/isabelle/isar/type-check.ts +0 -2
  73. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  74. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  75. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  76. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  77. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  78. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  79. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  80. package/src/prover/isabelle/provers/classical.ts +1 -3
  81. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  82. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  83. package/src/prover/isabelle/pure/consts.ts +0 -2
  84. package/src/prover/isabelle/pure/conv.ts +0 -2
  85. package/src/prover/isabelle/pure/drule.ts +0 -2
  86. package/src/prover/isabelle/pure/envir.ts +0 -2
  87. package/src/prover/isabelle/pure/goal.ts +0 -2
  88. package/src/prover/isabelle/pure/logic.ts +0 -2
  89. package/src/prover/isabelle/pure/name.ts +0 -2
  90. package/src/prover/isabelle/pure/net.ts +0 -2
  91. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  92. package/src/prover/isabelle/pure/pattern.ts +0 -2
  93. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  94. package/src/prover/isabelle/pure/rewriter.ts +0 -2
  95. package/src/prover/isabelle/pure/search.ts +0 -2
  96. package/src/prover/isabelle/pure/seq.ts +0 -2
  97. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  98. package/src/prover/isabelle/pure/table.ts +0 -2
  99. package/src/prover/isabelle/pure/tactic.ts +0 -2
  100. package/src/prover/isabelle/pure/tactical.ts +0 -2
  101. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  102. package/src/prover/isabelle/pure/term.ts +0 -2
  103. package/src/prover/isabelle/pure/thm.ts +0 -2
  104. package/src/prover/isabelle/pure/type.ts +0 -2
  105. package/src/prover/isabelle/pure/unify.ts +0 -2
  106. package/src/prover/isabelle/pure/variable.ts +0 -2
  107. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  108. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  109. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  110. package/src/prover/ocaml.ts +4 -1
  111. package/src/prover/prep/action.ts +1 -0
  112. package/src/prover/prep/methods.ts +50 -3
  113. package/src/prover/prep/normalize.ts +4 -1
  114. package/src/prover/prove.ts +58 -32
  115. package/src/prover/ptl/decide.ts +43 -63
  116. package/src/prover/smt/data.ts +51 -45
  117. package/src/prover/smt/encode.ts +1 -2
  118. package/src/prover/smt/rewrite.ts +3 -7
  119. package/src/prover/smt/simplify.ts +1 -1
  120. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  121. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  122. package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
  123. package/src/prover/smt/solver/act-cache.ts +0 -1
  124. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  125. package/src/prover/smt/solver/aig-tactic.ts +25 -16
  126. package/src/prover/smt/solver/aig.ts +2 -3
  127. package/src/prover/smt/solver/arith-rewriter.ts +3 -6
  128. package/src/prover/smt/solver/arith-terms.ts +0 -2
  129. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  130. package/src/prover/smt/solver/array-rewriter.ts +0 -1
  131. package/src/prover/smt/solver/asserted-formulas.ts +9 -3
  132. package/src/prover/smt/solver/ast-lt.ts +1 -2
  133. package/src/prover/smt/solver/ast-util.ts +3 -3
  134. package/src/prover/smt/solver/ast.ts +112 -156
  135. package/src/prover/smt/solver/auf-solver.ts +0 -1
  136. package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
  137. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  138. package/src/prover/smt/solver/bound-manager.ts +39 -29
  139. package/src/prover/smt/solver/bound-simplifier.ts +0 -2
  140. package/src/prover/smt/solver/bv-bound-chk.ts +2 -10
  141. package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
  142. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  143. package/src/prover/smt/solver/bv-rewriter.ts +15 -19
  144. package/src/prover/smt/solver/bv1-blast.ts +1 -11
  145. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  146. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  147. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  148. package/src/prover/smt/solver/card2bv.ts +1 -4
  149. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  150. package/src/prover/smt/solver/cg-table.ts +19 -16
  151. package/src/prover/smt/solver/check-logic.ts +6 -2
  152. package/src/prover/smt/solver/clause.ts +0 -1
  153. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
  154. package/src/prover/smt/solver/conflict-resolution.ts +0 -1
  155. package/src/prover/smt/solver/context.ts +41 -14
  156. package/src/prover/smt/solver/ctx-simplify.ts +1 -3
  157. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  158. package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
  159. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  160. package/src/prover/smt/solver/demodulator.ts +2 -5
  161. package/src/prover/smt/solver/dependent-expr-state.ts +16 -3
  162. package/src/prover/smt/solver/der.ts +0 -1
  163. package/src/prover/smt/solver/diff-neq.ts +1 -3
  164. package/src/prover/smt/solver/distribute-forall.ts +1 -11
  165. package/src/prover/smt/solver/dom-simplify.ts +1 -3
  166. package/src/prover/smt/solver/dt2bv-tactic.ts +2 -9
  167. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  168. package/src/prover/smt/solver/e-matching.ts +6 -7
  169. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  170. package/src/prover/smt/solver/elim-uncnstr.ts +7 -23
  171. package/src/prover/smt/solver/enode.ts +15 -2
  172. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  173. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  174. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -3
  175. package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
  176. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  177. package/src/prover/smt/solver/euf/array-internalize.ts +20 -11
  178. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  179. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  180. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -3
  181. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  182. package/src/prover/smt/solver/euf/dt-solver.ts +19 -21
  183. package/src/prover/smt/solver/euf/egraph.ts +68 -43
  184. package/src/prover/smt/solver/euf/euf-solver.ts +36 -23
  185. package/src/prover/smt/solver/euf/fpa-solver.ts +37 -53
  186. package/src/prover/smt/solver/euf/mam.ts +7 -55
  187. package/src/prover/smt/solver/euf/q-ematch.ts +21 -97
  188. package/src/prover/smt/solver/euf/q-mbi.ts +4 -4
  189. package/src/prover/smt/solver/euf/q-model-fixer.ts +1 -4
  190. package/src/prover/smt/solver/euf/q-solver.ts +2 -2
  191. package/src/prover/smt/solver/euf/th-solver.ts +1 -10
  192. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  193. package/src/prover/smt/solver/expr-ref.ts +0 -1
  194. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  195. package/src/prover/smt/solver/expr2polynomial.ts +204 -80
  196. package/src/prover/smt/solver/factor.ts +37 -26
  197. package/src/prover/smt/solver/fd-solver.ts +3 -5
  198. package/src/prover/smt/solver/fingerprints.ts +0 -1
  199. package/src/prover/smt/solver/fix-dl-var.ts +1 -3
  200. package/src/prover/smt/solver/flat-literals.ts +0 -1
  201. package/src/prover/smt/solver/fm-tactic.ts +19 -14
  202. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  203. package/src/prover/smt/solver/fpa-rewriter.ts +2 -2
  204. package/src/prover/smt/solver/fpa2bv-converter.ts +13 -8
  205. package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
  206. package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
  207. package/src/prover/smt/solver/goal.ts +3 -2
  208. package/src/prover/smt/solver/goal2nlsat.ts +57 -32
  209. package/src/prover/smt/solver/guard-set.ts +0 -1
  210. package/src/prover/smt/solver/hash.ts +0 -1
  211. package/src/prover/smt/solver/hashtable.ts +0 -1
  212. package/src/prover/smt/solver/inf-eps.ts +1 -2
  213. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  214. package/src/prover/smt/solver/internalizer.ts +41 -3
  215. package/src/prover/smt/solver/lackr.ts +0 -2
  216. package/src/prover/smt/solver/lbool.ts +0 -1
  217. package/src/prover/smt/solver/lia2card.ts +0 -1
  218. package/src/prover/smt/solver/lia2pb.ts +18 -5
  219. package/src/prover/smt/solver/literal.ts +0 -1
  220. package/src/prover/smt/solver/logic-tactics.ts +0 -4
  221. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  222. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  223. package/src/prover/smt/solver/lp/containers.ts +7 -2
  224. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  225. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  226. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  227. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  228. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  229. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  230. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  231. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  232. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  233. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  234. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  235. package/src/prover/smt/solver/lp/lar-solver.ts +1 -2
  236. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  237. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  238. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  239. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  240. package/src/prover/smt/solver/lp/nex.ts +2 -2
  241. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  242. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  243. package/src/prover/smt/solver/lp/nla-core.ts +26 -7
  244. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  245. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  246. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  247. package/src/prover/smt/solver/lp/nla-grobner.ts +158 -82
  248. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  249. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  250. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  251. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  252. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  253. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  254. package/src/prover/smt/solver/lp/nla-powers.ts +144 -108
  255. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  256. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  257. package/src/prover/smt/solver/lp/nla-transcendentals.ts +50 -19
  258. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  259. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  260. package/src/prover/smt/solver/lp/nra-solver.ts +138 -97
  261. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  262. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  263. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  264. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  265. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  266. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  267. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  268. package/src/prover/smt/solver/lp/union-find.ts +1 -2
  269. package/src/prover/smt/solver/macro-finder.ts +1 -4
  270. package/src/prover/smt/solver/mam-compiler.ts +14 -15
  271. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  272. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +1 -13
  273. package/src/prover/smt/solver/max-cliques.ts +0 -2
  274. package/src/prover/smt/solver/maxcore.ts +5 -14
  275. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
  276. package/src/prover/smt/solver/maxlex.ts +0 -8
  277. package/src/prover/smt/solver/maxsmt-base.ts +7 -1
  278. package/src/prover/smt/solver/maxsmt.ts +0 -1
  279. package/src/prover/smt/solver/mbp/mbp-arith.ts +2 -12
  280. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  281. package/src/prover/smt/solver/mbp/mbp-plugin.ts +9 -2
  282. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  283. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +1 -10
  284. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
  285. package/src/prover/smt/solver/model-based-opt.ts +1 -2
  286. package/src/prover/smt/solver/model-checker.ts +0 -1
  287. package/src/prover/smt/solver/model-evaluator.ts +9 -6
  288. package/src/prover/smt/solver/model-finder.ts +0 -1
  289. package/src/prover/smt/solver/model-generator.ts +3 -2
  290. package/src/prover/smt/solver/model-macro-solver.ts +3 -4
  291. package/src/prover/smt/solver/model-printer.ts +0 -1
  292. package/src/prover/smt/solver/mpf.ts +2 -5
  293. package/src/prover/smt/solver/mus.ts +1 -3
  294. package/src/prover/smt/solver/muz/dl-context.ts +67 -9
  295. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  296. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +68 -22
  297. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +7 -3
  298. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
  299. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +39 -11
  300. package/src/prover/smt/solver/muz/dl-mk-slice.ts +78 -16
  301. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +9 -4
  302. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
  303. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -4
  304. package/src/prover/smt/solver/muz/dl-rule.ts +95 -33
  305. package/src/prover/smt/solver/muz/hnf.ts +6 -6
  306. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  307. package/src/prover/smt/solver/muz/horn-tactic.ts +15 -6
  308. package/src/prover/smt/solver/muz/rule-properties.ts +194 -37
  309. package/src/prover/smt/solver/muz/spacer-context.ts +104 -89
  310. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +15 -3
  311. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  312. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
  313. package/src/prover/smt/solver/muz/spacer-pdr.ts +4 -4
  314. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +3 -9
  315. package/src/prover/smt/solver/muz/spacer-util.ts +2 -3
  316. package/src/prover/smt/solver/muz/substitution.ts +88 -39
  317. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  318. package/src/prover/smt/solver/nlqsat.ts +4 -4
  319. package/src/prover/smt/solver/nlsat/algebraic.ts +194 -93
  320. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  321. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  322. package/src/prover/smt/solver/nlsat/explain.ts +379 -217
  323. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  324. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  325. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  326. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  327. package/src/prover/smt/solver/nlsat/solver.ts +112 -99
  328. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  329. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -19
  330. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  331. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  332. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  333. package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
  334. package/src/prover/smt/solver/nnf.ts +0 -1
  335. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  336. package/src/prover/smt/solver/occf.ts +0 -1
  337. package/src/prover/smt/solver/opt-context.ts +15 -10
  338. package/src/prover/smt/solver/opt-nlsat.ts +97 -77
  339. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  340. package/src/prover/smt/solver/opt-preprocess.ts +0 -1
  341. package/src/prover/smt/solver/opt-solver.ts +22 -11
  342. package/src/prover/smt/solver/opt-value.ts +0 -1
  343. package/src/prover/smt/solver/optsmt.ts +13 -12
  344. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  345. package/src/prover/smt/solver/pattern-inference.ts +2 -3
  346. package/src/prover/smt/solver/pb-rewriter.ts +14 -20
  347. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  348. package/src/prover/smt/solver/poly-rewriter.ts +2 -3
  349. package/src/prover/smt/solver/probes.ts +4 -7
  350. package/src/prover/smt/solver/propagate-values.ts +4 -1
  351. package/src/prover/smt/solver/proto-model.ts +6 -7
  352. package/src/prover/smt/solver/pull-quant.ts +0 -1
  353. package/src/prover/smt/solver/purify-arith.ts +50 -16
  354. package/src/prover/smt/solver/qe-arith-plugin.ts +4 -7
  355. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  356. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  357. package/src/prover/smt/solver/qe-lite.ts +0 -1
  358. package/src/prover/smt/solver/qe-mbp.ts +13 -24
  359. package/src/prover/smt/solver/qe.ts +48 -57
  360. package/src/prover/smt/solver/qel.ts +0 -1
  361. package/src/prover/smt/solver/qi-queue.ts +0 -1
  362. package/src/prover/smt/solver/qsat.ts +70 -91
  363. package/src/prover/smt/solver/quant-hoist.ts +0 -1
  364. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  365. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  366. package/src/prover/smt/solver/quantifier-manager.ts +14 -10
  367. package/src/prover/smt/solver/quasi-macros.ts +9 -20
  368. package/src/prover/smt/solver/random-gen.ts +0 -1
  369. package/src/prover/smt/solver/rational.ts +17 -1
  370. package/src/prover/smt/solver/recfun-decl-plugin.ts +35 -21
  371. package/src/prover/smt/solver/recfun-rewriter.ts +1 -2
  372. package/src/prover/smt/solver/reduce-args.ts +0 -1
  373. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  374. package/src/prover/smt/solver/ref-vector.ts +0 -1
  375. package/src/prover/smt/solver/relevancy.ts +0 -1
  376. package/src/prover/smt/solver/rewriter-tpl.ts +6 -3
  377. package/src/prover/smt/solver/rewriter.ts +1 -2
  378. package/src/prover/smt/solver/rlimit.ts +13 -1
  379. package/src/prover/smt/solver/sat/asymm-branch.ts +59 -48
  380. package/src/prover/smt/solver/sat/big.ts +0 -1
  381. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -8
  382. package/src/prover/smt/solver/sat/clause.ts +1 -6
  383. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  384. package/src/prover/smt/solver/sat/config.ts +4 -7
  385. package/src/prover/smt/solver/sat/consequences.ts +1 -2
  386. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  387. package/src/prover/smt/solver/sat/goal2sat.ts +1 -3
  388. package/src/prover/smt/solver/sat/inc-sat-solver.ts +4 -13
  389. package/src/prover/smt/solver/sat/model-converter.ts +2 -18
  390. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  391. package/src/prover/smt/solver/sat/pb-solver.ts +50 -26
  392. package/src/prover/smt/solver/sat/probing.ts +22 -21
  393. package/src/prover/smt/solver/sat/sat-tactic.ts +2 -2
  394. package/src/prover/smt/solver/sat/sat2goal.ts +9 -12
  395. package/src/prover/smt/solver/sat/scc.ts +0 -1
  396. package/src/prover/smt/solver/sat/simplifier.ts +16 -60
  397. package/src/prover/smt/solver/sat/solver.ts +45 -68
  398. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  399. package/src/prover/smt/solver/sat/watch-list.ts +7 -3
  400. package/src/prover/smt/solver/search-tree.ts +0 -1
  401. package/src/prover/smt/solver/seq-axioms.ts +20 -36
  402. package/src/prover/smt/solver/seq-decl-plugin.ts +7 -8
  403. package/src/prover/smt/solver/seq-derive.ts +9 -15
  404. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  405. package/src/prover/smt/solver/seq-eq-solver.ts +9 -10
  406. package/src/prover/smt/solver/seq-factory.ts +0 -1
  407. package/src/prover/smt/solver/seq-monadic.ts +7 -7
  408. package/src/prover/smt/solver/seq-range-predicate.ts +14 -3
  409. package/src/prover/smt/solver/seq-re-rewriter.ts +3 -12
  410. package/src/prover/smt/solver/seq-re-util.ts +2 -5
  411. package/src/prover/smt/solver/seq-regex-bisim.ts +2 -3
  412. package/src/prover/smt/solver/seq-regex-live.ts +6 -8
  413. package/src/prover/smt/solver/seq-rewriter.ts +31 -34
  414. package/src/prover/smt/solver/seq-skolem.ts +0 -24
  415. package/src/prover/smt/solver/seq-subset.ts +0 -1
  416. package/src/prover/smt/solver/seq-view-witness.ts +4 -6
  417. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  418. package/src/prover/smt/solver/smt-kernel.ts +8 -3
  419. package/src/prover/smt/solver/smt-logics.ts +0 -1
  420. package/src/prover/smt/solver/smt-setup.ts +18 -14
  421. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  422. package/src/prover/smt/solver/smtlib-parser.ts +1187 -592
  423. package/src/prover/smt/solver/smtlib-script.ts +957 -750
  424. package/src/prover/smt/solver/solve-eqs.ts +11 -19
  425. package/src/prover/smt/solver/solver.ts +1 -2
  426. package/src/prover/smt/solver/static-features.ts +0 -2
  427. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  428. package/src/prover/smt/solver/tactic.ts +77 -18
  429. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  430. package/src/prover/smt/solver/theory-array.ts +25 -60
  431. package/src/prover/smt/solver/theory-bv.ts +15 -54
  432. package/src/prover/smt/solver/theory-char.ts +0 -1
  433. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  434. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  435. package/src/prover/smt/solver/theory-fpa.ts +46 -79
  436. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  437. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  438. package/src/prover/smt/solver/theory-lra-final-check.ts +0 -2
  439. package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
  440. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  441. package/src/prover/smt/solver/theory-lra-propagate.ts +0 -3
  442. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  443. package/src/prover/smt/solver/theory-lra.ts +0 -2
  444. package/src/prover/smt/solver/theory-pb.ts +12 -11
  445. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  446. package/src/prover/smt/solver/theory-recfun.ts +2 -3
  447. package/src/prover/smt/solver/theory-seq-regex.ts +3 -7
  448. package/src/prover/smt/solver/theory-seq-solve.ts +6 -8
  449. package/src/prover/smt/solver/theory-seq-state.ts +8 -26
  450. package/src/prover/smt/solver/theory-seq.ts +32 -55
  451. package/src/prover/smt/solver/theory.ts +16 -2
  452. package/src/prover/smt/solver/tseitin-cnf.ts +3 -5
  453. package/src/prover/smt/solver/var-subst.ts +2 -3
  454. package/src/prover/smt/table.ts +3 -2
  455. package/src/prover/zenon/decide.ts +9 -13
  456. package/src/prover/zenon/encode.ts +0 -2
  457. package/src/prover/zenon/eqrel.ts +0 -2
  458. package/src/prover/zenon/equality-rules.ts +24 -2
  459. package/src/prover/zenon/expr.ts +21 -2
  460. package/src/prover/zenon/index-table.ts +7 -4
  461. package/src/prover/zenon/isar-case.ts +1 -3
  462. package/src/prover/zenon/isar.ts +2 -4
  463. package/src/prover/zenon/llproof.ts +0 -2
  464. package/src/prover/zenon/mltoll.ts +0 -2
  465. package/src/prover/zenon/node.ts +12 -13
  466. package/src/prover/zenon/parse.ts +0 -2
  467. package/src/prover/zenon/phrase.ts +1 -3
  468. package/src/prover/zenon/proof.ts +0 -2
  469. package/src/prover/zenon/propositional-rules.ts +0 -2
  470. package/src/prover/zenon/rules.ts +2 -3
  471. package/src/prover/zenon/search.ts +0 -2
  472. package/src/prover/zenon/tla/functions.ts +0 -2
  473. package/src/prover/zenon/tla/llproof.ts +0 -2
  474. package/src/prover/zenon/tla/records.ts +0 -2
  475. package/src/prover/zenon/tla/rewrites.ts +0 -2
  476. package/src/prover/zenon/tla/sets.ts +1 -3
  477. package/src/prover/zenon/tla/terms.ts +0 -2
  478. package/src/prover/zenon/tla/tla.ts +0 -2
  479. package/src/resolve.ts +264 -77
  480. package/src/runtime.ts +6 -0
  481. package/src/sany/generation.ts +1 -13
  482. package/src/sany/generator-definitions.ts +2 -1
  483. package/src/sany/generator-expressions.ts +30 -27
  484. package/src/sany/generator-proofs.ts +1 -1
  485. package/src/sany/generator.ts +2 -1
  486. package/src/sany/levels.ts +0 -2
  487. package/src/sany/linter.ts +0 -2
  488. package/src/sany/nodes.ts +1 -1
  489. package/src/sany/selectors.ts +6 -5
  490. package/src/search.ts +198 -45
  491. package/src/simulate.ts +3 -0
  492. package/src/standard-definitions.ts +4 -0
  493. package/src/state-graph.ts +0 -2
  494. package/src/subexpressions.ts +165 -78
  495. package/src/successors.ts +1 -1
  496. package/src/symmetry.ts +2 -2
  497. package/src/tableau.ts +2 -2
  498. package/src/tlc/fingerprint.ts +81 -9
  499. package/src/tlc/jar-data.ts +12 -0
  500. package/src/tlc/order.ts +14 -3
  501. package/src/tlc/summary.ts +29 -14
  502. package/src/tlc/tlcext-operators.ts +61 -16
  503. package/src/tlc/trace-spec.ts +2 -3
  504. package/src/typed-tier.ts +6541 -0
  505. package/src/typescript/types.ts +2 -2
  506. package/src/values.ts +1 -1
  507. package/src/prover/smt/solver/seq-regex-witness.ts +0 -100
  508. package/src/prover/smt/solver/z3-license.txt +0 -10
  509. package/src/prover/zenon/LICENSE +0 -32
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_powers.cpp), MIT license, see z3-license.txt.
2
1
  import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
3
2
  import { Anum } from "../nlsat/algebraic";
4
3
  import { Rational } from "../rational";
@@ -14,71 +13,70 @@ const MAX_UNSIGNED = 0xffffffffn;
14
13
  const isUnsigned = (value: Rational) =>
15
14
  value.isInt() && value.num >= 0n && value.num <= MAX_UNSIGNED;
16
15
 
17
- interface Ordered<Value> {
18
- compare(first: Value, second: Value): number;
19
- of(value: Rational): Value;
20
- add(first: Value, second: Value): Value;
21
- }
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
+ };
22
77
 
23
78
  export const checkPower = (core: NlaCore, result: number, base: number, exponent: number) => {
24
79
  if (base === NULL_LPVAR || exponent === NULL_LPVAR || result === NULL_LPVAR) return L_UNDEF;
25
- const addLemma = (...ineqs: Parameters<typeof mkIneq>[]) => {
26
- const lemma = new LemmaBuilder(core);
27
- for (const ineq of ineqs) lemma.addIneq(mkIneq(...ineq));
28
- return L_FALSE;
29
- };
30
- const checkAxioms = <Value>(
31
- ordered: Ordered<Value>,
32
- baseValue: Value,
33
- exponentValue: Value,
34
- resultValue: Value,
35
- ) => {
36
- const sign = (value: Value, bound: Rational) => ordered.compare(value, ordered.of(bound));
37
- if (
38
- sign(baseValue, Rational.zero) !== 0 &&
39
- sign(exponentValue, Rational.zero) === 0 &&
40
- sign(resultValue, Rational.one) !== 0
41
- )
42
- return addLemma([base, KIND_EQ, 0], [exponent, KIND_NE, 0], [result, KIND_EQ, 1]);
43
- if (
44
- sign(baseValue, Rational.zero) === 0 &&
45
- sign(exponentValue, Rational.zero) !== 0 &&
46
- sign(resultValue, Rational.zero) !== 0
47
- )
48
- return addLemma([base, KIND_NE, 0], [exponent, KIND_EQ, 0], [result, KIND_EQ, 0]);
49
- if (sign(baseValue, Rational.zero) > 0 && sign(resultValue, Rational.zero) <= 0)
50
- return addLemma([base, KIND_LE, 0], [result, KIND_GT, 0]);
51
- if (
52
- sign(baseValue, Rational.one) > 0 &&
53
- sign(exponentValue, Rational.zero) < 0 &&
54
- sign(resultValue, Rational.one) >= 0
55
- )
56
- return addLemma([base, KIND_LE, 1], [exponent, KIND_GE, 0], [result, KIND_LT, 1]);
57
- if (
58
- sign(baseValue, Rational.one) > 0 &&
59
- sign(exponentValue, Rational.zero) > 0 &&
60
- sign(resultValue, Rational.one) <= 0
61
- )
62
- return addLemma([base, KIND_LE, 1], [exponent, KIND_LE, 0], [result, KIND_GT, 1]);
63
- if (
64
- sign(baseValue, THREE) >= 0 &&
65
- sign(exponentValue, Rational.zero) > 0 &&
66
- ordered.compare(resultValue, ordered.add(exponentValue, ordered.of(Rational.one))) <= 0
67
- )
68
- return addLemma(
69
- [base, KIND_LT, THREE],
70
- [exponent, KIND_LE, 0],
71
- [
72
- new LarTerm([
73
- [result, Rational.one],
74
- [exponent, Rational.minusOne],
75
- ]),
76
- KIND_GT,
77
- 1,
78
- ],
79
- );
80
- return undefined;
81
- };
82
80
  const lra = core.lra;
83
81
  const am = core.nra.am;
84
82
  const values = core.isUsingNraModel
@@ -99,43 +97,58 @@ export const checkPower = (core: NlaCore, result: number, base: number, exponent
99
97
  const baseValue = rationals[0];
100
98
  const exponentValue = rationals[1];
101
99
  const resultValue = rationals[2];
102
- const axiom = checkAxioms(
103
- {
104
- compare: (first: Rational, second: Rational) => first.compare(second),
105
- of: (value) => value,
106
- add: (first, second) => first.add(second),
107
- },
108
- baseValue,
109
- exponentValue,
110
- resultValue,
111
- );
112
- if (axiom !== undefined) return axiom;
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);
113
123
  if (baseValue.isPositive() && isUnsigned(exponentValue)) {
114
124
  const powerValue = baseValue.pow(Number(exponentValue.num));
115
125
  const comparison = resultValue.compare(powerValue);
116
126
  if (comparison === 0) return L_TRUE;
117
- if (core.random() % 2 === 0)
118
- return addLemma(
119
- [base, KIND_NE, baseValue],
120
- [exponent, KIND_NE, exponentValue],
121
- [result, KIND_EQ, powerValue],
122
- );
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
+ }
123
134
  const isIncreasing = baseValue.compare(Rational.one) >= 0;
124
- if (exponentValue.isPositive() && comparison < 0)
125
- return addLemma(
126
- [base, KIND_LT, baseValue],
127
- [exponent, isIncreasing ? KIND_LT : KIND_GT, exponentValue],
128
- ...(isIncreasing ? [] : [[exponent, KIND_LT, 0] as Parameters<typeof mkIneq>]),
129
- [result, KIND_GE, powerValue],
130
- );
131
- if (comparison > 0)
132
- return addLemma(
133
- [base, KIND_LE, 0],
134
- [base, KIND_GT, baseValue],
135
- [exponent, isIncreasing ? KIND_GT : KIND_LT, exponentValue],
136
- ...(isIncreasing ? [[exponent, KIND_LT, 0] as Parameters<typeof mkIneq>] : []),
137
- [result, KIND_LE, powerValue],
138
- );
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
+ }
139
152
  }
140
153
  if (baseValue.isPositive() && exponentValue.isPositive() && !exponentValue.isInt()) {
141
154
  const num = exponentValue.num;
@@ -153,20 +166,43 @@ export const checkPower = (core: NlaCore, result: number, base: number, exponent
153
166
  const baseValue = values[0];
154
167
  const exponentValue = values[1];
155
168
  const resultValue = values[2];
156
- const axiom = checkAxioms(
157
- {
158
- compare: (first: Anum, second: Anum) => am.compare(first, second),
159
- of: (value) => new Anum(value),
160
- add: (first, second) => am.add(first, second),
161
- },
162
- baseValue,
163
- exponentValue,
164
- resultValue,
165
- );
166
- if (axiom !== undefined) return axiom;
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);
167
203
  if (
168
- am.compare(baseValue, new Anum(Rational.zero)) > 0 &&
169
- am.compare(exponentValue, new Anum(Rational.zero)) > 0 &&
204
+ am.compare(baseValue, zero) > 0 &&
205
+ am.compare(exponentValue, zero) > 0 &&
170
206
  am.isRational(exponentValue)
171
207
  ) {
172
208
  const exponentRational = am.toRational(exponentValue);
@@ -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";
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/math/lp/nla_transcendentals.h, src/math/lp/nla_transcendentals.cpp), MIT
2
- // license, see z3-license.txt.
3
1
  import { Rational } from "../rational";
4
2
  import {
5
3
  evalTranscendental,
@@ -189,27 +187,60 @@ export class NlaTranscendentals {
189
187
  return true;
190
188
  }
191
189
 
192
- // exp is increasing, and so is log on positive arguments.
193
- private checkMonotonicity(app: TranscendentalApp) {
194
- if (app.op !== "exp" && app.op !== "log") return false;
190
+ // x1 < x2 implies exp(x1) < exp(x2).
191
+ private checkExpMonotonicity(app: TranscendentalApp) {
192
+ if (app.op !== "exp") return false;
195
193
  const core = this.core;
196
194
  const arg = core.val(app.arg);
197
- if (app.op === "log" && !arg.isPositive()) return false;
198
195
  const val = core.val(app.val);
199
196
  for (const other of this.apps) {
200
- if (other.op !== app.op || other.arg === app.arg) continue;
197
+ if (other.op !== "exp" || other.arg === app.arg) continue;
201
198
  const otherArg = core.val(other.arg);
202
- if (app.op === "log" && !otherArg.isPositive()) continue;
203
199
  const otherVal = core.val(other.val);
204
- const isLess = arg.compare(otherArg) < 0 && val.compare(otherVal) >= 0;
205
- if (!isLess && !(arg.compare(otherArg) > 0 && val.compare(otherVal) <= 0)) continue;
206
- const lemma = new LemmaBuilder(core);
207
- if (app.op === "log")
208
- lemma.addIneq(mkIneq(app.arg, KIND_LE, 0)).addIneq(mkIneq(other.arg, KIND_LE, 0));
209
- lemma
210
- .addIneq(mkIneq(mkTerm(app.arg, 1, other.arg, -1), isLess ? KIND_GE : KIND_LE, 0))
211
- .addIneq(mkIneq(mkTerm(app.val, 1, other.val, -1), isLess ? KIND_LT : KIND_GT, 0));
212
- return true;
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
+ }
213
244
  }
214
245
  return false;
215
246
  }
@@ -221,9 +252,9 @@ export class NlaTranscendentals {
221
252
  this.checkLinearMajorant(app) ||
222
253
  this.checkSignOnPiRange(app) ||
223
254
  this.checkExpLowerBound(app) ||
224
- (app.op === "exp" && this.checkMonotonicity(app)) ||
255
+ this.checkExpMonotonicity(app) ||
225
256
  this.checkLogUpperBound(app) ||
226
- (app.op === "log" && this.checkMonotonicity(app))
257
+ this.checkLogMonotonicity(app)
227
258
  )
228
259
  return true;
229
260
  const arg = this.core.val(app.arg).toDouble();
@@ -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";