tla-ts 0.0.9 → 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 +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -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 +3 -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 +1156 -888
  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 +330 -659
  41. package/src/cli/typescript.ts +23 -0
  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 +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  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 +137 -22
  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 -322
  64. package/src/liveness.ts +230 -133
  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 +36 -60
  88. package/src/parallel.ts +64 -73
  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 +135 -40
  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 +299 -108
  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 +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  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
@@ -0,0 +1,310 @@
1
+ // Z3 evaluates with the platform's libm, and V8's Math functions can differ from it in the last
2
+ // bit.
3
+ import {
4
+ OP_ACOS,
5
+ OP_ACOSH,
6
+ OP_ASIN,
7
+ OP_ASINH,
8
+ OP_ATAN,
9
+ OP_ATANH,
10
+ OP_COS,
11
+ OP_COSH,
12
+ OP_EXP,
13
+ OP_LOG,
14
+ OP_SIN,
15
+ OP_SINH,
16
+ OP_TAN,
17
+ OP_TANH,
18
+ } from "../ast";
19
+ import { Rational } from "../rational";
20
+
21
+ export type TranscendentalOp =
22
+ | "sin"
23
+ | "cos"
24
+ | "tan"
25
+ | "asin"
26
+ | "acos"
27
+ | "atan"
28
+ | "sinh"
29
+ | "cosh"
30
+ | "tanh"
31
+ | "asinh"
32
+ | "acosh"
33
+ | "atanh"
34
+ | "exp"
35
+ | "log";
36
+
37
+ export const TRANSCENDENTAL_OPS = new Map<number, TranscendentalOp>([
38
+ [OP_SIN, "sin"],
39
+ [OP_COS, "cos"],
40
+ [OP_TAN, "tan"],
41
+ [OP_SINH, "sinh"],
42
+ [OP_COSH, "cosh"],
43
+ [OP_TANH, "tanh"],
44
+ [OP_ASIN, "asin"],
45
+ [OP_ACOS, "acos"],
46
+ [OP_ATAN, "atan"],
47
+ [OP_ASINH, "asinh"],
48
+ [OP_ACOSH, "acosh"],
49
+ [OP_ATANH, "atanh"],
50
+ [OP_EXP, "exp"],
51
+ [OP_LOG, "log"],
52
+ ]);
53
+
54
+ const EVALUATORS: Record<TranscendentalOp, (value: number) => number> = {
55
+ sin: Math.sin,
56
+ cos: Math.cos,
57
+ tan: Math.tan,
58
+ asin: Math.asin,
59
+ acos: Math.acos,
60
+ atan: Math.atan,
61
+ sinh: Math.sinh,
62
+ cosh: Math.cosh,
63
+ tanh: Math.tanh,
64
+ asinh: Math.asinh,
65
+ acosh: Math.acosh,
66
+ atanh: Math.atanh,
67
+ exp: Math.exp,
68
+ log: Math.log,
69
+ };
70
+
71
+ // pi/2 and pi rounded outward by more than a double's rounding error.
72
+ export const PI_2_UPPER = Rational.fromDouble(1.5707963267948968);
73
+ export const PI_UPPER = Rational.fromDouble(3.1415926535897936);
74
+
75
+ // A rational bracket of pi, tight to about 1e-14.
76
+ export const PI_LOWER_BRACKET = Rational.of(314159265358979n, 10n ** 14n);
77
+ export const PI_UPPER_BRACKET = Rational.of(314159265358980n, 10n ** 14n);
78
+
79
+ const SAFETY = 64 * Number.EPSILON;
80
+ // Near a pole or the boundary of the domain, where the derivative blows up.
81
+ const BOUNDARY_SAFETY = 4096 * Number.EPSILON;
82
+
83
+ export const evalTranscendental = (op: TranscendentalOp, value: number) => EVALUATORS[op](value);
84
+
85
+ // A conservative bound on the round-off of evaluating op at value in double precision.
86
+ export const getErrorBound = (op: TranscendentalOp, value: number, result: number) => {
87
+ switch (op) {
88
+ case "sin":
89
+ case "cos":
90
+ case "atan":
91
+ case "tanh":
92
+ case "asinh":
93
+ return SAFETY * Math.max(1, Math.abs(value));
94
+ case "sinh":
95
+ case "cosh":
96
+ case "exp":
97
+ return SAFETY * Math.max(1, Math.abs(result));
98
+ default:
99
+ return BOUNDARY_SAFETY * Math.max(1, Math.abs(value), Math.abs(result));
100
+ }
101
+ };
102
+
103
+ const getNextAfter = (from: number, to: number) => {
104
+ if (from === to) return to;
105
+ if (from === 0) return to > 0 ? Number.MIN_VALUE : -Number.MIN_VALUE;
106
+ const view = new DataView(new ArrayBuffer(8));
107
+ view.setFloat64(0, from);
108
+ const bits = view.getBigUint64(0);
109
+ // The bits of a double grow with its magnitude.
110
+ const isGrowing = from > 0 ? from < to : from > to;
111
+ view.setBigUint64(0, isGrowing ? bits + 1n : bits - 1n);
112
+ return view.getFloat64(0);
113
+ };
114
+
115
+ // Whether some integer k puts phase + k * period in [low, high]. It can only err toward true.
116
+ const containsMultipleOf = (low: number, high: number, phase: number, period: number) =>
117
+ low <= high && phase + Math.ceil((low - phase) / period) * period <= high;
118
+
119
+ // An enclosure of op over [low, high] that accounts for an extremum of sin, cos or cosh inside
120
+ // it. Undefined when an endpoint or its value is not finite, or a pole of tan is strictly inside.
121
+ // Z3 does not check the endpoints, and converts an infinite one to a rational with undefined
122
+ // behavior.
123
+ export const getWideIntervalEval = (op: TranscendentalOp, low: number, high: number) => {
124
+ if (!(low <= high) || !Number.isFinite(low) || !Number.isFinite(high)) return undefined;
125
+ const lowValue = evalTranscendental(op, low);
126
+ const highValue = evalTranscendental(op, high);
127
+ if (!Number.isFinite(lowValue) || !Number.isFinite(highValue)) return undefined;
128
+ let lowest = Math.min(lowValue, highValue);
129
+ let highest = Math.max(lowValue, highValue);
130
+ const pi = Math.PI;
131
+ const twoPi = 2 * pi;
132
+ if (op === "sin") {
133
+ if (containsMultipleOf(low, high, pi / 2, twoPi)) highest = 1;
134
+ if (containsMultipleOf(low, high, -pi / 2, twoPi)) lowest = -1;
135
+ } else if (op === "cos") {
136
+ if (containsMultipleOf(low, high, 0, twoPi)) highest = 1;
137
+ if (containsMultipleOf(low, high, pi, twoPi)) lowest = -1;
138
+ } else if (op === "tan") {
139
+ if (containsMultipleOf(getNextAfter(low, high), getNextAfter(high, low), pi / 2, pi))
140
+ return undefined;
141
+ } else if (op === "cosh" && low <= 0 && 0 <= high) lowest = 1;
142
+ const slack = Math.max(getErrorBound(op, low, lowValue), getErrorBound(op, high, highValue));
143
+ return { low: lowest - slack, high: highest + slack };
144
+ };
145
+
146
+ const min = (first: Rational, second: Rational) => (second.compare(first) < 0 ? second : first);
147
+ const max = (first: Rational, second: Rational) => (first.compare(second) < 0 ? second : first);
148
+
149
+ // The partial sums of a series over a common denominator, since reducing every partial sum of
150
+ // dozens of terms costs a gcd of numbers thousands of bits long.
151
+ class Series {
152
+ private den: bigint;
153
+ private sum = 0n;
154
+ private term: bigint;
155
+
156
+ constructor(term: Rational) {
157
+ this.term = term.num;
158
+ this.den = term.den;
159
+ }
160
+
161
+ get value() {
162
+ return Rational.of(this.sum, this.den);
163
+ }
164
+
165
+ get lastTerm() {
166
+ return Rational.of(this.term, this.den);
167
+ }
168
+
169
+ // Adds sign * term / divisor.
170
+ add(sign = 1n, divisor = 1n) {
171
+ this.sum = this.sum * divisor + sign * this.term;
172
+ this.term *= divisor;
173
+ this.den *= divisor;
174
+ }
175
+
176
+ // Multiplies the term by num / den, where den > 0.
177
+ scale(num: bigint, den: bigint) {
178
+ this.term *= num;
179
+ this.sum *= den;
180
+ this.den *= den;
181
+ }
182
+ }
183
+
184
+ // Of the partial sums after each of numTerms terms, the bracket is the last two.
185
+ const getLastTwoSums = (series: Series, numTerms: number, step: (index: number) => void) => {
186
+ for (let index = 0; index < numTerms - 1; index++) step(index);
187
+ const previous = series.value;
188
+ step(numTerms - 1);
189
+ const last = series.value;
190
+ return { low: min(previous, last), high: max(previous, last) };
191
+ };
192
+
193
+ // The Maclaurin series of exp is alternating for x <= 0 once n + 1 >= |x|, so consecutive partial
194
+ // sums from there bracket it. For x > 0 a geometric series bounds the omitted tail.
195
+ export const getExpTaylorBracket = (value: Rational) => {
196
+ const numTerms = 40;
197
+ const series = new Series(Rational.one);
198
+ const step = (index: number) => {
199
+ series.add();
200
+ series.scale(value.num, value.den * BigInt(index + 1));
201
+ };
202
+ if (!value.isPositive() && value.compare(Rational.of(BigInt(-numTerms))) > 0)
203
+ return getLastTwoSums(series, numTerms, step);
204
+ if (value.isPositive() && value.compare(Rational.of(BigInt(numTerms + 1))) < 0) {
205
+ for (let index = 0; index < numTerms; index++) step(index);
206
+ const ratio = value.div(Rational.of(BigInt(numTerms + 1)));
207
+ const sum = series.value;
208
+ return { low: sum, high: sum.add(series.lastTerm.div(Rational.one.sub(ratio))) };
209
+ }
210
+ return undefined;
211
+ };
212
+
213
+ // The Mercator series of log(1 + u) alternates for u in [0, 1].
214
+ export const getLogTaylorBracket = (value: Rational) => {
215
+ if (value.compare(Rational.one) < 0 || value.compare(Rational.of(2n)) > 0) return undefined;
216
+ const offset = value.sub(Rational.one);
217
+ const series = new Series(offset);
218
+ return getLastTwoSums(series, 60, (index) => {
219
+ series.add(index % 2 === 0 ? 1n : -1n);
220
+ series.scale(offset.num * BigInt(index + 1), offset.den * BigInt(index + 2));
221
+ });
222
+ };
223
+
224
+ // The Maclaurin series of atan alternates for |x| <= 1.
225
+ export const getAtanTaylorBracket = (value: Rational) => {
226
+ if (value.compare(Rational.minusOne) < 0 || value.compare(Rational.one) > 0) return undefined;
227
+ const series = new Series(value);
228
+ const square = value.mul(value);
229
+ return getLastTwoSums(series, 40, (index) => {
230
+ series.add(1n, BigInt(2 * index + 1));
231
+ series.scale(-square.num, square.den);
232
+ });
233
+ };
234
+
235
+ // The terms (-1)^k x^(2k+b) / (2k+b)! of sin (b = 1) and cos (b = 0) shrink once x^2 <= (2k+b+1) *
236
+ // (2k+b+2), and then keep shrinking, so consecutive partial sums from there bracket the value.
237
+ // Undefined when that takes more than the term budget.
238
+ const getSinCosTaylorBracketAt = (value: Rational, basePower: number) => {
239
+ const numTerms = 60;
240
+ const square = value.mul(value);
241
+ const getGrowth = (index: number) => {
242
+ const power = BigInt(2 * index + basePower);
243
+ return (power + 1n) * (power + 2n);
244
+ };
245
+ let start = 0;
246
+ while (start < numTerms && square.compare(Rational.of(getGrowth(start))) > 0) start++;
247
+ if (start >= numTerms) return undefined;
248
+ const series = new Series(basePower === 0 ? Rational.one : value);
249
+ return getLastTwoSums(series, numTerms, (index) => {
250
+ series.add();
251
+ series.scale(-square.num, square.den * getGrowth(index));
252
+ });
253
+ };
254
+
255
+ // Whether phase + k * period may fall in [low, high] for some integer k, where phase and period are
256
+ // only known up to brackets. A maybe counts as yes, and so does a range too wide to scan.
257
+ const containsPeriodicPoint = (
258
+ low: Rational,
259
+ high: Rational,
260
+ phaseLow: Rational,
261
+ phaseHigh: Rational,
262
+ periodLow: Rational,
263
+ periodHigh: Rational,
264
+ ) => {
265
+ const first = low.sub(phaseHigh).div(periodLow).floor().sub(Rational.one);
266
+ const last = high.sub(phaseLow).div(periodLow).ceil().add(Rational.one);
267
+ if (last.sub(first).compare(Rational.of(1000n)) > 0) return true;
268
+ for (let index = first; index.compare(last) <= 0; index = index.add(Rational.one)) {
269
+ const candidates = [
270
+ phaseLow.add(index.mul(periodLow)),
271
+ phaseHigh.add(index.mul(periodHigh)),
272
+ phaseLow.add(index.mul(periodHigh)),
273
+ phaseHigh.add(index.mul(periodLow)),
274
+ ];
275
+ const positionLow = candidates.reduce(min);
276
+ const positionHigh = candidates.reduce(max);
277
+ if (positionLow.compare(high) <= 0 && positionHigh.compare(low) >= 0) return true;
278
+ }
279
+ return false;
280
+ };
281
+
282
+ // An exact enclosure of sin or cos over [low, high], clamped to the extremal value when a
283
+ // multiple of pi / 2 or pi may fall inside it.
284
+ export const getSinCosTaylorBracket = (op: "sin" | "cos", low: Rational, high: Rational) => {
285
+ const basePower = op === "sin" ? 1 : 0;
286
+ const lowBracket = getSinCosTaylorBracketAt(low, basePower);
287
+ const highBracket = lowBracket && getSinCosTaylorBracketAt(high, basePower);
288
+ if (lowBracket === undefined || highBracket === undefined) return undefined;
289
+ let result = {
290
+ low: min(lowBracket.low, highBracket.low),
291
+ high: max(lowBracket.high, highBracket.high),
292
+ };
293
+ const two = Rational.of(2n);
294
+ const periodLow = two.mul(PI_LOWER_BRACKET);
295
+ const periodHigh = two.mul(PI_UPPER_BRACKET);
296
+ const [maxPhaseLow, maxPhaseHigh, minPhaseLow, minPhaseHigh] =
297
+ op === "sin"
298
+ ? [
299
+ PI_LOWER_BRACKET.div(two),
300
+ PI_UPPER_BRACKET.div(two),
301
+ PI_UPPER_BRACKET.div(two).neg(),
302
+ PI_LOWER_BRACKET.div(two).neg(),
303
+ ]
304
+ : [Rational.zero, Rational.zero, PI_LOWER_BRACKET, PI_UPPER_BRACKET];
305
+ if (containsPeriodicPoint(low, high, maxPhaseLow, maxPhaseHigh, periodLow, periodHigh))
306
+ result = { ...result, high: max(result.high, Rational.one) };
307
+ if (containsPeriodicPoint(low, high, minPhaseLow, minPhaseHigh, periodLow, periodHigh))
308
+ result = { ...result, low: min(result.low, Rational.minusOne) };
309
+ return result;
310
+ };
@@ -0,0 +1,391 @@
1
+ import { getLcm, Rational } from "../rational";
2
+ import { Anum } from "./algebraic";
3
+ import { NULL_VAR, PolynomialRef } from "./polynomial";
4
+ import type { NlsatSolver } from "./solver";
5
+ import {
6
+ getAtanTaylorBracket,
7
+ getExpTaylorBracket,
8
+ getLogTaylorBracket,
9
+ getSinCosTaylorBracket,
10
+ getWideIntervalEval,
11
+ PI_2_UPPER,
12
+ PI_LOWER_BRACKET,
13
+ PI_UPPER,
14
+ PI_UPPER_BRACKET,
15
+ type TranscendentalOp,
16
+ } from "./transcendental-eval";
17
+
18
+ interface App {
19
+ op: TranscendentalOp;
20
+ arg: number;
21
+ val: number;
22
+ // Refinements in a row, each of which widens the box the next one excludes.
23
+ retries: number;
24
+ }
25
+
26
+ interface Atan2App {
27
+ y: number;
28
+ x: number;
29
+ val: number;
30
+ retries: number;
31
+ }
32
+
33
+ const TWO = Rational.of(2n);
34
+
35
+ // A box around the witness rather than the point alone, so that converging toward a point where
36
+ // the function touches an axiom takes logarithmically many rounds.
37
+ const getExclusionDelta = (scale: Rational, retries: number) =>
38
+ Rational.of(1n << BigInt(Math.min(retries, 30)), 1000000n).mul(scale);
39
+
40
+ export class NlsatTranscendentals {
41
+ private apps: App[] = [];
42
+ private atan2Apps: Atan2App[] = [];
43
+ private hasPi = false;
44
+
45
+ constructor(private solver: NlsatSolver) {}
46
+
47
+ get isEmpty() {
48
+ return this.apps.length === 0 && this.atan2Apps.length === 0;
49
+ }
50
+
51
+ private mkBoundLiteral(variable: number, kind: "LT" | "GT", bound: Rational) {
52
+ const p = new PolynomialRef(this.solver.pm);
53
+ p.set(this.solver.pm.mkLinear([bound.den], [variable], -bound.num));
54
+ const literal = this.solver.mkIneqLiteral(kind, [p.get()], [false]);
55
+ p.reset();
56
+ return literal;
57
+ }
58
+
59
+ // first * firstCoeff + second * secondCoeff kind bound.
60
+ private mkLinearLiteral(
61
+ first: number,
62
+ firstCoeff: Rational,
63
+ second: number,
64
+ secondCoeff: Rational,
65
+ kind: "LT" | "GT",
66
+ bound: Rational,
67
+ ) {
68
+ const den = Rational.of(getLcm(firstCoeff.den, getLcm(secondCoeff.den, bound.den)));
69
+ const p = new PolynomialRef(this.solver.pm);
70
+ p.set(
71
+ this.solver.pm.mkLinear(
72
+ [firstCoeff.mul(den).num, secondCoeff.mul(den).num],
73
+ [first, second],
74
+ bound.mul(den).neg().num,
75
+ ),
76
+ );
77
+ const literal = this.solver.mkIneqLiteral(kind, [p.get()], [false]);
78
+ p.reset();
79
+ return literal;
80
+ }
81
+
82
+ private mkClause(literals: readonly number[]) {
83
+ this.solver.mkExternalClause(literals, null);
84
+ }
85
+
86
+ private compare(anum: Anum, value: Rational) {
87
+ return this.solver.am.compare(anum, new Anum(value));
88
+ }
89
+
90
+ private isPos(anum: Anum) {
91
+ return !this.solver.am.isZero(anum) && !this.solver.am.isNeg(anum);
92
+ }
93
+
94
+ add(op: TranscendentalOp, arg: number, val: number) {
95
+ this.apps.push({ op, arg, val, retries: 0 });
96
+ this.addGlobalAxioms(op, arg, val);
97
+ this.addRangeAxioms(op, val);
98
+ this.addIdentityAxioms(op, arg, val);
99
+ }
100
+
101
+ addPi(val: number) {
102
+ if (val === NULL_VAR || this.hasPi) return;
103
+ this.hasPi = true;
104
+ const lower = this.mkBoundLiteral(val, "LT", PI_LOWER_BRACKET) ^ 1;
105
+ const upper = this.mkBoundLiteral(val, "GT", PI_UPPER_BRACKET) ^ 1;
106
+ this.mkClause([lower]);
107
+ this.mkClause([upper]);
108
+ }
109
+
110
+ addAtan2(y: number, x: number, val: number) {
111
+ if (y === NULL_VAR || x === NULL_VAR || val === NULL_VAR) return;
112
+ this.atan2Apps.push({ y, x, val, retries: 0 });
113
+ this.addBounds(val, PI_UPPER.neg(), PI_UPPER);
114
+ }
115
+
116
+ private addBounds(val: number, lower: Rational, upper: Rational) {
117
+ const belowUpper = this.mkBoundLiteral(val, "GT", upper) ^ 1;
118
+ const aboveLower = this.mkBoundLiteral(val, "LT", lower) ^ 1;
119
+ this.mkClause([belowUpper]);
120
+ this.mkClause([aboveLower]);
121
+ }
122
+
123
+ // The tangent lines exp(x) >= 1 + x and log(x) <= x - 1 hold on the whole domain.
124
+ private addGlobalAxioms(op: TranscendentalOp, arg: number, val: number) {
125
+ if (op === "exp") {
126
+ this.mkClause([
127
+ this.mkLinearLiteral(val, Rational.one, arg, Rational.minusOne, "LT", Rational.one) ^ 1,
128
+ ]);
129
+ this.mkClause([
130
+ this.mkBoundLiteral(arg, "LT", Rational.zero) ^ 1,
131
+ this.mkBoundLiteral(val, "LT", Rational.one),
132
+ ]);
133
+ } else if (op === "log")
134
+ this.mkClause([
135
+ this.mkBoundLiteral(arg, "GT", Rational.zero) ^ 1,
136
+ this.mkLinearLiteral(val, Rational.one, arg, Rational.minusOne, "GT", Rational.minusOne) ^
137
+ 1,
138
+ ]);
139
+ }
140
+
141
+ private addRangeAxioms(op: TranscendentalOp, val: number) {
142
+ if (op === "sin" || op === "cos") this.addBounds(val, Rational.minusOne, Rational.one);
143
+ else if (op === "tanh") {
144
+ const aboveLower = this.mkBoundLiteral(val, "GT", Rational.minusOne);
145
+ const belowUpper = this.mkBoundLiteral(val, "LT", Rational.one);
146
+ this.mkClause([aboveLower]);
147
+ this.mkClause([belowUpper]);
148
+ } else if (op === "cosh") this.mkClause([this.mkBoundLiteral(val, "LT", Rational.one) ^ 1]);
149
+ else if (op === "acosh") this.mkClause([this.mkBoundLiteral(val, "LT", Rational.zero) ^ 1]);
150
+ else if (op === "asin") this.addBounds(val, PI_2_UPPER.neg(), PI_2_UPPER);
151
+ else if (op === "acos") this.addBounds(val, Rational.zero, PI_UPPER);
152
+ }
153
+
154
+ // sin^2 + cos^2 = 1, cosh^2 - sinh^2 = 1 and cosh^2 (1 - tanh^2) = 1 for applications to the
155
+ // same argument.
156
+ private addIdentityAxioms(op: TranscendentalOp, arg: number, val: number) {
157
+ for (const other of this.apps.slice(0, -1)) {
158
+ if (other.arg !== arg) continue;
159
+ const pair = `${op} ${other.op}`;
160
+ if (pair === "sin cos") this.addIdentityAxiom("sin", val, other.val);
161
+ else if (pair === "cos sin") this.addIdentityAxiom("sin", other.val, val);
162
+ else if (pair === "sinh cosh") this.addIdentityAxiom("sinh", other.val, val);
163
+ else if (pair === "cosh sinh") this.addIdentityAxiom("sinh", val, other.val);
164
+ else if (pair === "tanh cosh") this.addIdentityAxiom("tanh", other.val, val);
165
+ else if (pair === "cosh tanh") this.addIdentityAxiom("tanh", val, other.val);
166
+ }
167
+ }
168
+
169
+ private addIdentityAxiom(kind: "sin" | "sinh" | "tanh", first: number, second: number) {
170
+ const pm = this.solver.pm;
171
+ const v1 = new PolynomialRef(pm);
172
+ const v2 = new PolynomialRef(pm);
173
+ const v1sq = new PolynomialRef(pm);
174
+ const v2sq = new PolynomialRef(pm);
175
+ const eq = new PolynomialRef(pm);
176
+ const product = new PolynomialRef(pm);
177
+ const difference = new PolynomialRef(pm);
178
+ v1.set(pm.mkVar(first));
179
+ v2.set(pm.mkVar(second));
180
+ v1sq.set(pm.mul(v1.get(), v1.get()));
181
+ v2sq.set(pm.mul(v2.get(), v2.get()));
182
+ if (kind === "tanh") product.set(pm.mul(v1sq.get(), v2sq.get()));
183
+ difference.set(
184
+ kind === "sin"
185
+ ? pm.add(v1sq.get(), v2sq.get())
186
+ : pm.sub(v1sq.get(), kind === "sinh" ? v2sq.get() : product.get()),
187
+ );
188
+ eq.set(pm.sub(difference.get(), pm.one));
189
+ difference.reset();
190
+ product.reset();
191
+ this.mkClause([this.solver.mkIneqLiteral("EQ", [eq.get()], [false])]);
192
+ eq.reset();
193
+ v2sq.reset();
194
+ v1sq.reset();
195
+ v2.reset();
196
+ v1.reset();
197
+ }
198
+
199
+ // Exact Taylor brackets: exp, log and atan are increasing where their series apply, and the
200
+ // bracket of sin and cos accounts for an extremum inside the box.
201
+ private getExactBracket(op: TranscendentalOp, low: Rational, high: Rational) {
202
+ if (op === "sin" || op === "cos") return getSinCosTaylorBracket(op, low, high);
203
+ const getBracket =
204
+ op === "exp"
205
+ ? getExpTaylorBracket
206
+ : op === "log"
207
+ ? getLogTaylorBracket
208
+ : op === "atan"
209
+ ? getAtanTaylorBracket
210
+ : undefined;
211
+ const lowBracket = getBracket?.(low);
212
+ const highBracket = lowBracket && getBracket?.(high);
213
+ if (lowBracket === undefined || highBracket === undefined) return undefined;
214
+ return { low: lowBracket.low, high: highBracket.high };
215
+ }
216
+
217
+ // Excludes the box [low, high] of arg unless val lies in [valLow, valHigh].
218
+ private excludeBox(app: App, low: Rational, high: Rational, valLow: Rational, valHigh: Rational) {
219
+ const value = this.solver.getValue(app.val);
220
+ if (this.compare(value, valLow) >= 0 && this.compare(value, valHigh) <= 0) {
221
+ app.retries = 0;
222
+ return false;
223
+ }
224
+ this.mkClause([
225
+ this.mkBoundLiteral(app.arg, "LT", low),
226
+ this.mkBoundLiteral(app.arg, "GT", high),
227
+ this.compare(value, valLow) < 0
228
+ ? this.mkBoundLiteral(app.val, "LT", valLow) ^ 1
229
+ : this.mkBoundLiteral(app.val, "GT", valHigh) ^ 1,
230
+ ]);
231
+ app.retries++;
232
+ return true;
233
+ }
234
+
235
+ private refineApp(app: App) {
236
+ const [low, high] = this.solver.am.getInterval(this.solver.getValue(app.arg), 64);
237
+ const middle = low.add(high).div(TWO).abs();
238
+ const delta = getExclusionDelta(
239
+ middle.compare(Rational.one) > 0 ? middle : Rational.one,
240
+ app.retries,
241
+ );
242
+ const wideLow = low.sub(delta);
243
+ const wideHigh = high.add(delta);
244
+ const exact = this.getExactBracket(app.op, wideLow, wideHigh);
245
+ if (exact !== undefined) return this.excludeBox(app, wideLow, wideHigh, exact.low, exact.high);
246
+ const wide = { low: wideLow.toDouble(), high: wideHigh.toDouble() };
247
+ const wideEnclosure = getWideIntervalEval(app.op, wide.low, wide.high);
248
+ const box = wideEnclosure === undefined ? { low: low.toDouble(), high: high.toDouble() } : wide;
249
+ const enclosure = wideEnclosure ?? getWideIntervalEval(app.op, box.low, box.high);
250
+ if (enclosure === undefined) return false;
251
+ return this.excludeBox(
252
+ app,
253
+ Rational.fromDouble(box.low),
254
+ Rational.fromDouble(box.high),
255
+ Rational.fromDouble(enclosure.low),
256
+ Rational.fromDouble(enclosure.high),
257
+ );
258
+ }
259
+
260
+ // atan2(y, x) has the sign of y, and lies in the range of the open quadrant of a box around (y,
261
+ // x). A box that crosses an axis may span the branch cut, so it is left alone.
262
+ private refineAtan2(app: Atan2App) {
263
+ const solver = this.solver;
264
+ const am = solver.am;
265
+ const yValue = solver.getValue(app.y);
266
+ const value = solver.getValue(app.val);
267
+ if (this.isPos(yValue) && !this.isPos(value)) {
268
+ this.mkClause([
269
+ this.mkBoundLiteral(app.y, "GT", Rational.zero) ^ 1,
270
+ this.mkBoundLiteral(app.val, "GT", Rational.zero),
271
+ ]);
272
+ return true;
273
+ }
274
+ if (am.isNeg(yValue) && !am.isNeg(value)) {
275
+ this.mkClause([
276
+ this.mkBoundLiteral(app.y, "LT", Rational.zero) ^ 1,
277
+ this.mkBoundLiteral(app.val, "LT", Rational.zero),
278
+ ]);
279
+ return true;
280
+ }
281
+ const [yLow, yHigh] = am.getInterval(yValue, 64);
282
+ const [xLow, xHigh] = am.getInterval(solver.getValue(app.x), 64);
283
+ const scale = [yLow.add(yHigh), xLow.add(xHigh)]
284
+ .map((sum) => sum.div(TWO).abs())
285
+ .reduce((first, second) => (first.compare(second) < 0 ? second : first), Rational.one);
286
+ const delta = getExclusionDelta(scale, app.retries);
287
+ const yWideLow = yLow.sub(delta);
288
+ const yWideHigh = yHigh.add(delta);
289
+ const xWideLow = xLow.sub(delta);
290
+ const xWideHigh = xHigh.add(delta);
291
+ const halfLow = PI_LOWER_BRACKET.div(TWO);
292
+ const halfHigh = PI_UPPER_BRACKET.div(TWO);
293
+ const range =
294
+ yWideLow.isPositive() && xWideLow.isPositive()
295
+ ? { lower: Rational.zero, upper: halfHigh }
296
+ : yWideLow.isPositive() && xWideHigh.isNegative()
297
+ ? { lower: halfLow, upper: PI_UPPER_BRACKET }
298
+ : yWideHigh.isNegative() && xWideHigh.isNegative()
299
+ ? { lower: PI_UPPER_BRACKET.neg(), upper: halfLow.neg() }
300
+ : yWideHigh.isNegative() && xWideLow.isPositive()
301
+ ? { lower: halfHigh.neg(), upper: Rational.zero }
302
+ : undefined;
303
+ if (range === undefined) return false;
304
+ const isBelow = this.compare(value, range.lower) < 0;
305
+ if (!isBelow && this.compare(value, range.upper) <= 0) return false;
306
+ this.mkClause([
307
+ this.mkBoundLiteral(app.y, "LT", yWideLow),
308
+ this.mkBoundLiteral(app.y, "GT", yWideHigh),
309
+ this.mkBoundLiteral(app.x, "LT", xWideLow),
310
+ this.mkBoundLiteral(app.x, "GT", xWideHigh),
311
+ isBelow
312
+ ? this.mkBoundLiteral(app.val, "LT", range.lower) ^ 1
313
+ : this.mkBoundLiteral(app.val, "GT", range.upper) ^ 1,
314
+ ]);
315
+ app.retries++;
316
+ return true;
317
+ }
318
+
319
+ // exp is increasing, and so is log on positive arguments.
320
+ private refineMonotonicityPair(first: App, second: App) {
321
+ const solver = this.solver;
322
+ const am = solver.am;
323
+ const firstArg = solver.getValue(first.arg);
324
+ const secondArg = solver.getValue(second.arg);
325
+ if (first.op === "log" && (!this.isPos(firstArg) || !this.isPos(secondArg))) return false;
326
+ const firstVal = solver.getValue(first.val);
327
+ const secondVal = solver.getValue(second.val);
328
+ const isFirstLess = am.compare(firstArg, secondArg) < 0 && am.compare(firstVal, secondVal) >= 0;
329
+ const isSecondLess =
330
+ !isFirstLess && am.compare(secondArg, firstArg) < 0 && am.compare(secondVal, firstVal) >= 0;
331
+ if (!isFirstLess && !isSecondLess) return false;
332
+ const kind = isFirstLess ? "LT" : "GT";
333
+ const domain =
334
+ first.op === "log"
335
+ ? [
336
+ this.mkBoundLiteral(first.arg, "GT", Rational.zero) ^ 1,
337
+ this.mkBoundLiteral(second.arg, "GT", Rational.zero) ^ 1,
338
+ ]
339
+ : [];
340
+ const args = this.mkLinearLiteral(
341
+ first.arg,
342
+ Rational.one,
343
+ second.arg,
344
+ Rational.minusOne,
345
+ kind,
346
+ Rational.zero,
347
+ );
348
+ const vals = this.mkLinearLiteral(
349
+ first.val,
350
+ Rational.one,
351
+ second.val,
352
+ Rational.minusOne,
353
+ kind,
354
+ Rational.zero,
355
+ );
356
+ this.mkClause([...domain, args ^ 1, vals]);
357
+ return true;
358
+ }
359
+
360
+ private refineMonotonicity() {
361
+ let isAdded = false;
362
+ for (const [index, first] of this.apps.entries()) {
363
+ if (first.op !== "exp" && first.op !== "log") continue;
364
+ for (const second of this.apps.slice(index + 1))
365
+ if (second.op === first.op && this.refineMonotonicityPair(first, second)) isAdded = true;
366
+ }
367
+ return isAdded;
368
+ }
369
+
370
+ // Called when the search finds a model: adds a clause for each application the model violates.
371
+ refine() {
372
+ let isAdded = false;
373
+ for (const app of this.apps) if (this.refineApp(app)) isAdded = true;
374
+ for (const app of this.atan2Apps) if (this.refineAtan2(app)) isAdded = true;
375
+ if (this.refineMonotonicity()) isAdded = true;
376
+ return isAdded;
377
+ }
378
+
379
+ // The variables live outside polynomials, so a reorder of the solver renames them here.
380
+ rename(permutation: readonly number[]) {
381
+ for (const app of this.apps) {
382
+ app.arg = permutation[app.arg];
383
+ app.val = permutation[app.val];
384
+ }
385
+ for (const app of this.atan2Apps) {
386
+ app.y = permutation[app.y];
387
+ app.x = permutation[app.x];
388
+ app.val = permutation[app.val];
389
+ }
390
+ }
391
+ }