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

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 (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  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 +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -1,13 +1,29 @@
1
- // Ported from Z3 (src/ast/rewriter/arith_rewriter.cpp), MIT license, see z3-license.txt.
2
1
  import {
2
+ FAMILY_ARITH,
3
+ KIND_APP,
4
+ OP_ACOS,
5
+ OP_ACOSH,
3
6
  OP_ADD,
7
+ OP_ASIN,
8
+ OP_ASINH,
9
+ OP_ATAN,
10
+ OP_ATANH,
11
+ OP_COS,
12
+ OP_COSH,
13
+ OP_DIV,
4
14
  OP_GE,
15
+ OP_PI,
16
+ OP_POWER,
17
+ OP_SIN,
18
+ OP_SINH,
19
+ OP_TAN,
5
20
  OP_IDIV,
6
21
  OP_ITE,
7
22
  OP_LE,
8
23
  OP_LT,
9
24
  OP_MOD,
10
25
  OP_MUL,
26
+ OP_SEQ_LENGTH,
11
27
  OP_SUB,
12
28
  OP_TO_INT,
13
29
  OP_TO_REAL,
@@ -20,19 +36,38 @@ import { getEuclideanDiv, getEuclideanMod, getGcd, Rational } from "./rational";
20
36
  import { type ArithRewriterOptions, PolyRewriter } from "./poly-rewriter";
21
37
  import type { Rewrite } from "./rewriter-tpl";
22
38
  import { shrink } from "./array";
39
+ import { Anum } from "./nlsat/algebraic";
23
40
 
24
41
  export const KERNEL_ARITH_OPTIONS: ArithRewriterOptions = {
25
42
  isSom: true,
26
43
  isSortSums: true,
44
+ isArithLhs: false,
27
45
  isArithIneqLhs: true,
28
46
  isGcdRounding: true,
47
+ isAnumSimp: true,
48
+ isExpandPower: false,
49
+ isExpandTan: false,
50
+ maxDegree: 64,
29
51
  };
30
52
 
31
53
  export const TACTIC_ARITH_OPTIONS: ArithRewriterOptions = {
32
54
  isSom: false,
33
55
  isSortSums: false,
56
+ isArithLhs: false,
34
57
  isArithIneqLhs: false,
35
58
  isGcdRounding: false,
59
+ isAnumSimp: true,
60
+ isExpandPower: false,
61
+ isExpandTan: false,
62
+ maxDegree: 64,
63
+ };
64
+
65
+ const HALF = Rational.of(1n, 2n);
66
+ const TWO = Rational.of(2n);
67
+
68
+ const getHalfTurns = (k: Rational) => {
69
+ const floor = k.floor();
70
+ return Rational.of(getEuclideanMod(floor.num, 2n)).add(k).sub(floor);
36
71
  };
37
72
 
38
73
  const getCeilDiv = (dividend: bigint, divisor: bigint) => -getEuclideanDiv(-dividend, divisor);
@@ -57,6 +92,7 @@ const getInverse = (kind: number) =>
57
92
 
58
93
  export class ArithRewriter extends PolyRewriter {
59
94
  private factors: number[] = [];
95
+ isEq2Ineq = false;
60
96
 
61
97
  mkLe(left: number, right: number) {
62
98
  return this.mkLeGeEq(left, right, KIND_LE);
@@ -75,7 +111,17 @@ export class ArithRewriter extends PolyRewriter {
75
111
  }
76
112
 
77
113
  mkEq(left: number, right: number) {
78
- if (!this.isArithTerm(left) && !this.isArithTerm(right)) return undefined;
114
+ const manager = this.manager;
115
+ if (this.isEq2Ineq)
116
+ return this.reduce(
117
+ manager.mkAnd([
118
+ manager.mkApp(OP_LE, [left, right], SORT_BOOL),
119
+ manager.mkApp(OP_GE, [left, right], SORT_BOOL),
120
+ ]),
121
+ 2,
122
+ );
123
+ if (!this.options.isArithLhs && !this.isArithTerm(left) && !this.isArithTerm(right))
124
+ return undefined;
79
125
  return this.mkLeGeEq(left, right, KIND_EQ);
80
126
  }
81
127
 
@@ -219,6 +265,31 @@ export class ArithRewriter extends PolyRewriter {
219
265
  );
220
266
  }
221
267
 
268
+ mkRem(left: number, right: number) {
269
+ const manager = this.manager;
270
+ this.currSort = SORT_INT;
271
+ const dividend = manager.getNumeral(left);
272
+ const divisor = manager.getNumeral(right);
273
+ if (dividend !== undefined && divisor !== undefined && divisor !== 0n) {
274
+ const remainder = getEuclideanMod(dividend, divisor);
275
+ return manager.mkNumeral(divisor < 0n ? -remainder : remainder);
276
+ }
277
+ if (divisor === 1n) return manager.mkNumeral(0n);
278
+ if (divisor !== undefined && divisor !== 0n) {
279
+ if (this.isAdd(left) || this.isMul(left)) return undefined;
280
+ return divisor < 0n
281
+ ? this.reduce(manager.mkApp(OP_UMINUS, [this.mkModApp(left, right)], SORT_INT), 2)
282
+ : this.reduce(this.mkModApp(left, right), 1);
283
+ }
284
+ if (!this.options.isElimRem) return undefined;
285
+ const mod = this.mkModApp(left, right);
286
+ const isNonnegative = manager.mkApp(OP_GE, [right, manager.mkNumeral(0n)], SORT_BOOL);
287
+ return this.reduce(
288
+ this.mkIntIte(isNonnegative, mod, manager.mkApp(OP_UMINUS, [mod], SORT_INT)),
289
+ 3,
290
+ );
291
+ }
292
+
222
293
  mkMod(left: number, right: number) {
223
294
  const manager = this.manager;
224
295
  this.currSort = SORT_INT;
@@ -349,8 +420,467 @@ export class ArithRewriter extends PolyRewriter {
349
420
  );
350
421
  }
351
422
 
423
+ override mkAddCore(args: number[]) {
424
+ if (!this.isAnumSimpTarget(args)) return super.mkAddCore(args);
425
+ const folded = this.foldAnums(args, true);
426
+ if (typeof folded === "number") return folded;
427
+ return super.mkAddCore(folded) ?? this.manager.mkApp(OP_ADD, folded, SORT_REAL);
428
+ }
429
+
430
+ override mkMul(args: number[]) {
431
+ if (!this.isAnumSimpTarget(args)) return super.mkMul(args);
432
+ const folded = this.foldAnums(args, false);
433
+ if (typeof folded === "number") return folded;
434
+ return super.mkMul(folded) ?? this.manager.mkApp(OP_MUL, folded, SORT_REAL);
435
+ }
436
+
437
+ private isSimpAlgebraic(expr: number) {
438
+ const manager = this.manager;
439
+ return (
440
+ manager.isAlgebraicNumeral(expr) &&
441
+ manager.am.degree(manager.getAlgebraicValue(expr)) <= this.options.maxDegree
442
+ );
443
+ }
444
+
445
+ private isAnumSimpTarget(args: number[]) {
446
+ if (!this.options.isAnumSimp) return false;
447
+ let numIrrational = 0;
448
+ let numRational = 0;
449
+ for (const arg of args) {
450
+ if (this.manager.isNumeral(arg)) {
451
+ numRational++;
452
+ if (numIrrational > 0) return true;
453
+ }
454
+ if (this.isSimpAlgebraic(arg)) {
455
+ numIrrational++;
456
+ if (numIrrational > 1 || numRational > 0) return true;
457
+ }
458
+ }
459
+ return false;
460
+ }
461
+
462
+ private foldAnums(args: number[], isAdd: boolean) {
463
+ const manager = this.manager;
464
+ const am = manager.am;
465
+ const identity = isAdd ? Rational.zero : Rational.one;
466
+ const combine = (first: Anum, second: Anum) =>
467
+ isAdd ? am.add(first, second) : am.mul(first, second);
468
+ let result = new Anum(identity);
469
+ const newArgs: number[] = [];
470
+ for (const arg of args) {
471
+ const degree = am.degree(result);
472
+ if (degree > 1 && degree > this.options.maxDegree) {
473
+ newArgs.push(manager.mkAlgebraicNumeral(result));
474
+ result = new Anum(identity);
475
+ }
476
+ if (manager.isNumeral(arg)) result = combine(result, new Anum(this.getValue(arg)));
477
+ else if (this.isSimpAlgebraic(arg)) result = combine(result, manager.getAlgebraicValue(arg));
478
+ else newArgs.push(arg);
479
+ }
480
+ if (newArgs.length === 0) return manager.mkAlgebraicNumeral(result);
481
+ newArgs.push(manager.mkAlgebraicNumeral(result));
482
+ return newArgs;
483
+ }
484
+
485
+ private getAlgebraicValue(expr: number): Anum | undefined {
486
+ const manager = this.manager;
487
+ const am = manager.am;
488
+ if (manager.isNumeral(expr)) return new Anum(this.getValue(expr));
489
+ if (manager.isAlgebraicNumeral(expr)) return am.copy(manager.getAlgebraicValue(expr));
490
+ const op = manager.getOp(expr);
491
+ if ((op !== OP_ADD && op !== OP_MUL) || manager.getNumArgs(expr) !== 2) return undefined;
492
+ const first = this.getAlgebraicValue(manager.getArg(expr, 0));
493
+ const second = first && this.getAlgebraicValue(manager.getArg(expr, 1));
494
+ if (first === undefined || second === undefined) return undefined;
495
+ return op === OP_ADD ? am.add(first, second) : am.mul(first, second);
496
+ }
497
+
498
+ private mkAnumDiv(left: number, right: number) {
499
+ const manager = this.manager;
500
+ const am = manager.am;
501
+ const isLeftAlgebraic = manager.isAlgebraicNumeral(left);
502
+ const isRightAlgebraic = manager.isAlgebraicNumeral(right);
503
+ if (isLeftAlgebraic && manager.isNumeral(right)) {
504
+ if (this.getValue(right).isZero()) return undefined;
505
+ return manager.mkAlgebraicNumeral(
506
+ am.div(manager.getAlgebraicValue(left), new Anum(this.getValue(right))),
507
+ );
508
+ }
509
+ if (isLeftAlgebraic && isRightAlgebraic) {
510
+ if (!this.isSimpAlgebraic(left) || !this.isSimpAlgebraic(right)) return undefined;
511
+ return manager.mkAlgebraicNumeral(
512
+ am.div(manager.getAlgebraicValue(left), manager.getAlgebraicValue(right)),
513
+ );
514
+ }
515
+ return manager.mkAlgebraicNumeral(
516
+ am.div(new Anum(this.getValue(left)), manager.getAlgebraicValue(right)),
517
+ );
518
+ }
519
+
520
+ private ensureReal(expr: number) {
521
+ const manager = this.manager;
522
+ return manager.isInt(expr) ? manager.mkApp(OP_TO_REAL, [expr], SORT_REAL) : expr;
523
+ }
524
+
525
+ private mkPowerApp(base: number, exponent: number) {
526
+ return this.manager.mkApp(OP_POWER, [base, exponent], SORT_REAL);
527
+ }
528
+
529
+ mkPower(base: number, exponent: number): number | Rewrite | undefined {
530
+ const manager = this.manager;
531
+ const maxDegree = this.options.maxDegree;
532
+ const x = manager.isNumeral(base) ? this.getValue(base) : undefined;
533
+ const y = manager.isNumeral(exponent) ? this.getValue(exponent) : undefined;
534
+ const isSmall = (value: Rational) =>
535
+ value.isInt() && value.num >= 0n && value.num <= BigInt(maxDegree);
536
+ if (x?.equals(Rational.one)) return manager.mkRealNumeral(x);
537
+ if (y?.equals(Rational.one)) return this.reduce(this.ensureReal(base), 1);
538
+ if (x !== undefined && y !== undefined) {
539
+ if (x.isZero() && y.isZero()) return undefined;
540
+ if (y.isZero()) return manager.mkRealNumeral(Rational.one);
541
+ if (x.isZero()) return manager.mkRealNumeral(x);
542
+ if (isSmall(y)) return manager.mkRealNumeral(x.pow(Number(y.num)));
543
+ if (isSmall(y.neg())) return manager.mkRealNumeral(Rational.one.div(x).pow(Number(-y.num)));
544
+ if (y.equals(Rational.minusOne)) return manager.mkRealNumeral(Rational.one.div(x));
545
+ }
546
+ if (manager.getOp(base) === OP_POWER && y !== undefined && y.isInt() && !y.isZero()) {
547
+ const innerExponent = manager.getArg(base, 1);
548
+ const inner = manager.isNumeral(innerExponent) ? this.getValue(innerExponent) : undefined;
549
+ if (inner !== undefined && inner.isInt() && inner.isPositive())
550
+ return this.reduce(
551
+ this.mkPowerApp(
552
+ this.ensureReal(manager.getArg(base, 0)),
553
+ manager.mkRealNumeral(y.mul(inner)),
554
+ ),
555
+ 2,
556
+ );
557
+ }
558
+ const mkZeroIte = (otherwise: number) =>
559
+ manager.mkApp(
560
+ OP_ITE,
561
+ [
562
+ manager.mkEq(base, manager.mkNumeralOfSort(Rational.zero, manager.sorts[base])),
563
+ manager.mkRealNumeral(Rational.zero),
564
+ otherwise,
565
+ ],
566
+ SORT_REAL,
567
+ );
568
+ if (y?.equals(Rational.minusOne)) {
569
+ const one = manager.mkRealNumeral(Rational.one);
570
+ const quotient = manager.mkApp(OP_DIV, [one, this.ensureReal(base)], SORT_REAL);
571
+ return this.reduce(mkZeroIte(quotient), 2);
572
+ }
573
+ if (y?.isNegative()) {
574
+ const one = manager.mkRealNumeral(Rational.one);
575
+ const quotient = manager.mkApp(OP_DIV, [one, this.ensureReal(base)], SORT_REAL);
576
+ return this.reduce(mkZeroIte(this.mkPowerApp(quotient, manager.mkRealNumeral(y.neg()))), 3);
577
+ }
578
+ if (y !== undefined && !y.isInt() && y.num !== 1n) {
579
+ const root = this.mkPowerApp(
580
+ this.ensureReal(base),
581
+ manager.mkRealNumeral(Rational.of(1n, y.den)),
582
+ );
583
+ return this.reduce(this.mkPowerApp(root, manager.mkRealNumeral(Rational.of(y.num))), 3);
584
+ }
585
+ const isArithBase =
586
+ manager.kinds[base] === KIND_APP &&
587
+ manager.funcDecls[manager.decls[base]].family === FAMILY_ARITH;
588
+ if (
589
+ (this.options.isExpandPower || (this.options.isSom && isArithBase)) &&
590
+ y !== undefined &&
591
+ isSmall(y) &&
592
+ y.num > 1n
593
+ ) {
594
+ const factors = Array.from({ length: Number(y.num) }, () => base);
595
+ return this.reduce(this.ensureReal(manager.mkApp(OP_MUL, factors, manager.sorts[base])), 2);
596
+ }
597
+ if (y === undefined || y.isZero()) return undefined;
598
+ const isIrrationalBase = manager.isAlgebraicNumeral(base);
599
+ if (x === undefined && !isIrrationalBase) return undefined;
600
+ const isNegativeExponent = y.isNegative();
601
+ const numerator = isNegativeExponent ? -y.num : y.num;
602
+ if (numerator > BigInt(maxDegree) || y.den > BigInt(maxDegree)) return undefined;
603
+ const am = manager.am;
604
+ const finish = (value: Anum) => {
605
+ if (isNegativeExponent) am.inv(value);
606
+ return manager.mkAlgebraicNumeral(value);
607
+ };
608
+ if (x !== undefined) {
609
+ const power = x.pow(Number(numerator));
610
+ if (power.isNegative() && y.den % 2n === 0n) return undefined;
611
+ const exact = power.root(Number(y.den));
612
+ if (exact !== undefined)
613
+ return manager.mkRealNumeral(isNegativeExponent ? Rational.one.div(exact) : exact);
614
+ if (!this.options.isAnumSimp) return undefined;
615
+ return finish(am.root(new Anum(power), Number(y.den)));
616
+ }
617
+ const value = manager.getAlgebraicValue(base);
618
+ if (!this.options.isAnumSimp || am.degree(value) > maxDegree) return undefined;
619
+ return finish(am.root(am.power(value, Number(numerator)), Number(y.den)));
620
+ }
621
+
622
+ private isPi(expr: number) {
623
+ return this.manager.getOp(expr) === OP_PI;
624
+ }
625
+
626
+ private isBinary(expr: number, op: number) {
627
+ const manager = this.manager;
628
+ return manager.getOp(expr) === op && manager.getNumArgs(expr) === 2;
629
+ }
630
+
631
+ private getPiMultiple(expr: number) {
632
+ const manager = this.manager;
633
+ if (this.isPi(expr)) return Rational.one;
634
+ if (!this.isBinary(expr, OP_MUL) || !this.isPi(manager.getArg(expr, 1))) return undefined;
635
+ const coefficient = manager.getArg(expr, 0);
636
+ return manager.isNumeral(coefficient) ? this.getValue(coefficient) : undefined;
637
+ }
638
+
639
+ private getPiOffset(expr: number) {
640
+ const manager = this.manager;
641
+ if (manager.getOp(expr) !== OP_ADD) return undefined;
642
+ for (let index = 0; index < manager.getNumArgs(expr); index++) {
643
+ const term = manager.getArg(expr, index);
644
+ const k = this.getPiMultiple(term);
645
+ if (k !== undefined) return { k, term };
646
+ }
647
+ return undefined;
648
+ }
649
+
650
+ private isPiTimesToReal(first: number, second: number) {
651
+ const manager = this.manager;
652
+ return (
653
+ (this.isPi(first) && manager.getOp(second) === OP_TO_REAL) ||
654
+ (manager.getOp(first) === OP_TO_REAL && this.isPi(second))
655
+ );
656
+ }
657
+
658
+ private isTwoPiInteger(expr: number) {
659
+ const manager = this.manager;
660
+ if (!this.isBinary(expr, OP_MUL)) return false;
661
+ const coefficient = manager.getArg(expr, 0);
662
+ const product = manager.getArg(expr, 1);
663
+ if (!manager.isNumeral(coefficient)) return false;
664
+ const k = this.getValue(coefficient);
665
+ return (
666
+ k.isInt() &&
667
+ getEuclideanMod(k.num, 2n) === 0n &&
668
+ this.isBinary(product, OP_MUL) &&
669
+ this.isPiTimesToReal(manager.getArg(product, 0), manager.getArg(product, 1))
670
+ );
671
+ }
672
+
673
+ private isPiInteger(expr: number) {
674
+ const manager = this.manager;
675
+ if (!this.isBinary(expr, OP_MUL)) return false;
676
+ const first = manager.getArg(expr, 0);
677
+ const second = manager.getArg(expr, 1);
678
+ if (!manager.isNumeral(first)) return this.isPiTimesToReal(first, second);
679
+ if (!this.getValue(first).isInt() || !this.isBinary(second, OP_MUL)) return false;
680
+ return this.isPiTimesToReal(manager.getArg(second, 0), manager.getArg(second, 1));
681
+ }
682
+
683
+ private findSummand(expr: number, isMatching: (term: number) => boolean) {
684
+ const manager = this.manager;
685
+ if (manager.getOp(expr) !== OP_ADD) return undefined;
686
+ for (let index = 0; index < manager.getNumArgs(expr); index++)
687
+ if (isMatching(manager.getArg(expr, index))) return manager.getArg(expr, index);
688
+ return undefined;
689
+ }
690
+
691
+ private mkReal(value: Rational) {
692
+ return this.manager.mkRealNumeral(value);
693
+ }
694
+
695
+ private mkRealApp(op: number, args: number[]) {
696
+ return this.manager.mkApp(op, args, SORT_REAL);
697
+ }
698
+
699
+ private mkSqrt(value: Rational) {
700
+ return this.mkPowerApp(this.mkReal(value), this.mkReal(HALF));
701
+ }
702
+
703
+ private mkSinValue(k: Rational) {
704
+ const turns = getHalfTurns(k);
705
+ const isNegative = turns.compare(Rational.one) >= 0;
706
+ const kPrime = isNegative ? turns.sub(Rational.one) : turns;
707
+ const mkSigned = (expr: number) => (isNegative ? this.mkRealApp(OP_UMINUS, [expr]) : expr);
708
+ const is = (num: bigint, den: bigint) => kPrime.equals(Rational.of(num, den));
709
+ if (kPrime.isZero() || kPrime.equals(Rational.one)) return this.mkReal(Rational.zero);
710
+ if (is(1n, 2n)) return this.mkReal(isNegative ? Rational.minusOne : Rational.one);
711
+ if (is(1n, 6n) || is(5n, 6n)) return this.mkReal(Rational.of(isNegative ? -1n : 1n, 2n));
712
+ if (is(1n, 4n) || is(3n, 4n)) return mkSigned(this.mkSqrt(HALF));
713
+ if (is(1n, 3n) || is(2n, 3n))
714
+ return mkSigned(this.mkRealApp(OP_DIV, [this.mkSqrt(Rational.of(3n)), this.mkReal(TWO)]));
715
+ const isLow = is(1n, 12n) || is(11n, 12n);
716
+ if (isLow || is(5n, 12n) || is(7n, 12n)) {
717
+ const six = this.mkSqrt(Rational.of(6n));
718
+ const two = this.mkSqrt(TWO);
719
+ const sum = this.mkRealApp(isLow ? OP_SUB : OP_ADD, [six, two]);
720
+ return mkSigned(this.mkRealApp(OP_DIV, [sum, this.mkReal(Rational.of(4n))]));
721
+ }
722
+ return undefined;
723
+ }
724
+
725
+ private mkWithoutTerm(op: number, arg: number, term: number, isNegated: boolean) {
726
+ const app = this.mkRealApp(op, [this.mkRealApp(OP_SUB, [arg, term])]);
727
+ return isNegated ? this.reduce(this.mkRealApp(OP_UMINUS, [app]), 3) : this.reduce(app, 2);
728
+ }
729
+
730
+ private mkSinCos(arg: number, isSin: boolean): number | Rewrite | undefined {
731
+ const manager = this.manager;
732
+ const op = manager.getOp(arg);
733
+ const inverse = manager.getNumArgs(arg) === 1 ? manager.getArg(arg, 0) : -1;
734
+ if (op === (isSin ? OP_ASIN : OP_ACOS)) return inverse;
735
+ if (isSin && op === OP_ACOS) {
736
+ const square = this.mkRealApp(OP_MUL, [inverse, inverse]);
737
+ const difference = this.mkRealApp(OP_SUB, [this.mkReal(Rational.one), square]);
738
+ return this.reduce(this.mkPowerApp(difference, this.mkReal(HALF)), Infinity);
739
+ }
740
+ if (manager.isNumeral(arg) && this.getValue(arg).isZero())
741
+ return isSin ? arg : this.mkReal(Rational.one);
742
+ const multiple = this.getPiMultiple(arg);
743
+ const value =
744
+ multiple === undefined ? undefined : this.mkSinValue(isSin ? multiple : multiple.add(HALF));
745
+ if (value !== undefined) return this.reduce(value, Infinity);
746
+ const offset = this.getPiOffset(arg);
747
+ if (offset !== undefined) {
748
+ const turns = getHalfTurns(offset.k);
749
+ const quarter = turns.isZero()
750
+ ? 0
751
+ : turns.equals(HALF)
752
+ ? 1
753
+ : turns.equals(Rational.one)
754
+ ? 2
755
+ : turns.equals(Rational.of(3n, 2n))
756
+ ? 3
757
+ : -1;
758
+ if (quarter !== -1) {
759
+ // sin(x + q pi/2) is sin, cos, -sin, -cos, and cos(x + q pi/2) is cos, -sin, -cos, sin.
760
+ const shifted = isSin ? quarter : quarter + 1;
761
+ return this.mkWithoutTerm(
762
+ shifted % 2 === 0 ? OP_SIN : OP_COS,
763
+ arg,
764
+ offset.term,
765
+ shifted % 4 >= 2,
766
+ );
767
+ }
768
+ }
769
+ const term = this.findSummand(arg, (summand) => this.isTwoPiInteger(summand));
770
+ if (term !== undefined) return this.mkWithoutTerm(isSin ? OP_SIN : OP_COS, arg, term, false);
771
+ return undefined;
772
+ }
773
+
774
+ mkSin(arg: number) {
775
+ return this.mkSinCos(arg, true);
776
+ }
777
+
778
+ mkCos(arg: number) {
779
+ return this.mkSinCos(arg, false);
780
+ }
781
+
782
+ mkTan(arg: number): number | Rewrite | undefined {
783
+ const manager = this.manager;
784
+ if (manager.getOp(arg) === OP_ATAN) return manager.getArg(arg, 0);
785
+ if (manager.isNumeral(arg) && this.getValue(arg).isZero()) return arg;
786
+ const expanded = this.mkTanCore(arg);
787
+ if (expanded !== undefined || !this.options.isExpandTan) return expanded;
788
+ return this.reduce(
789
+ this.mkRealApp(OP_DIV, [this.mkRealApp(OP_SIN, [arg]), this.mkRealApp(OP_COS, [arg])]),
790
+ 2,
791
+ );
792
+ }
793
+
794
+ private mkTanCore(arg: number) {
795
+ const multiple = this.getPiMultiple(arg);
796
+ if (multiple !== undefined) {
797
+ const sine = this.mkSinValue(multiple);
798
+ if (sine === undefined) return undefined;
799
+ if (this.isZero(sine)) return sine;
800
+ const cosine = this.mkSinValue(multiple.add(HALF));
801
+ if (cosine === undefined || this.isZero(cosine)) return undefined;
802
+ return this.reduce(this.mkRealApp(OP_DIV, [sine, cosine]), Infinity);
803
+ }
804
+ const offset = this.getPiOffset(arg);
805
+ if (offset !== undefined && offset.k.isInt())
806
+ return this.mkWithoutTerm(OP_TAN, arg, offset.term, false);
807
+ const term = this.findSummand(arg, (summand) => this.isPiInteger(summand));
808
+ if (term !== undefined) return this.mkWithoutTerm(OP_TAN, arg, term, false);
809
+ return undefined;
810
+ }
811
+
812
+ private mkPiMultiple(num: bigint, den: bigint) {
813
+ return this.reduce(
814
+ this.mkRealApp(OP_MUL, [this.mkReal(Rational.of(num, den)), this.manager.piExpr]),
815
+ 2,
816
+ );
817
+ }
818
+
819
+ // Like Z3, asin(-x) = -asin(x) even outside [-1, 1].
820
+ private mkNegated(op: number, arg: number) {
821
+ return this.reduce(this.mkRealApp(OP_UMINUS, [this.mkRealApp(op, [arg])]), 2);
822
+ }
823
+
824
+ mkAsin(arg: number) {
825
+ const manager = this.manager;
826
+ if (manager.isNumeral(arg)) {
827
+ const k = this.getValue(arg);
828
+ if (k.isZero()) return arg;
829
+ if (k.compare(Rational.minusOne) < 0) return this.mkNegated(OP_ASIN, this.mkReal(k.neg()));
830
+ if (k.compare(Rational.one) > 0) return undefined;
831
+ const sign = k.isNegative() ? -1n : 1n;
832
+ const magnitude = k.abs();
833
+ if (magnitude.equals(Rational.one)) return this.mkPiMultiple(sign, 2n);
834
+ if (magnitude.equals(HALF)) return this.mkPiMultiple(sign, 6n);
835
+ }
836
+ const negated = manager.getTimesMinusOneArg(arg);
837
+ return negated === undefined ? undefined : this.mkNegated(OP_ASIN, negated);
838
+ }
839
+
840
+ mkAcos(arg: number) {
841
+ const manager = this.manager;
842
+ if (!manager.isNumeral(arg)) return undefined;
843
+ const k = this.getValue(arg);
844
+ if (k.isZero()) return this.mkPiMultiple(1n, 2n);
845
+ if (k.equals(Rational.one)) return this.mkReal(Rational.zero);
846
+ if (k.equals(Rational.minusOne)) return manager.piExpr;
847
+ if (k.equals(HALF)) return this.mkPiMultiple(1n, 3n);
848
+ if (k.equals(HALF.neg())) return this.mkPiMultiple(2n, 3n);
849
+ return undefined;
850
+ }
851
+
852
+ mkAtan(arg: number) {
853
+ const manager = this.manager;
854
+ if (manager.isNumeral(arg)) {
855
+ const k = this.getValue(arg);
856
+ if (k.isZero()) return arg;
857
+ if (k.equals(Rational.one)) return this.mkPiMultiple(1n, 4n);
858
+ if (k.equals(Rational.minusOne)) return this.mkPiMultiple(-1n, 4n);
859
+ if (k.compare(Rational.minusOne) < 0) return this.mkNegated(OP_ATAN, this.mkReal(k.neg()));
860
+ return undefined;
861
+ }
862
+ const negated = manager.getTimesMinusOneArg(arg);
863
+ return negated === undefined ? undefined : this.mkNegated(OP_ATAN, negated);
864
+ }
865
+
866
+ mkHyperbolic(op: number, arg: number) {
867
+ const manager = this.manager;
868
+ const inverse = op === OP_SINH ? OP_ASINH : op === OP_COSH ? OP_ACOSH : OP_ATANH;
869
+ if (manager.getOp(arg) === inverse) return manager.getArg(arg, 0);
870
+ const negated = manager.getTimesMinusOneArg(arg);
871
+ if (negated === undefined) return undefined;
872
+ return op === OP_COSH ? this.mkRealApp(OP_COSH, [negated]) : this.mkNegated(op, negated);
873
+ }
874
+
352
875
  mkDiv(left: number, right: number) {
353
876
  const manager = this.manager;
877
+ if (
878
+ this.options.isAnumSimp &&
879
+ ((manager.isAlgebraicNumeral(left) &&
880
+ (manager.isNumeral(right) || manager.isAlgebraicNumeral(right))) ||
881
+ (manager.isAlgebraicNumeral(right) && manager.isNumeral(left)))
882
+ )
883
+ return this.mkAnumDiv(left, right);
354
884
  this.currSort = manager.sorts[left];
355
885
  if (!manager.isNumeral(right) || this.getValue(right).isZero()) return undefined;
356
886
  const divisor = this.getValue(right);
@@ -377,12 +907,10 @@ export class ArithRewriter extends PolyRewriter {
377
907
  else if (manager.getOp(child) === OP_TO_REAL) intArgs.push(manager.getArg(child, 0));
378
908
  else realArgs.push(child);
379
909
  }
380
- const mkSum = (args: number[], sort: number) =>
381
- args.length === 1 ? args[0] : manager.mkApp(op, args, sort);
382
- if (realArgs.length === 0) return this.reduce(mkSum(intArgs, SORT_INT), 1);
910
+ if (realArgs.length === 0) return this.reduce(manager.mkApp(op, intArgs, SORT_INT), 1);
383
911
  if (intArgs.length === 0 || op !== OP_ADD) return undefined;
384
- const intSum = mkSum(intArgs, SORT_INT);
385
- const realSum = mkSum(realArgs, SORT_REAL);
912
+ const intSum = manager.mkApp(OP_ADD, intArgs, SORT_INT);
913
+ const realSum = manager.mkApp(OP_ADD, realArgs, SORT_REAL);
386
914
  return this.reduce(
387
915
  manager.mkApp(OP_ADD, [intSum, manager.mkApp(OP_TO_INT, [realSum], SORT_INT)], SORT_INT),
388
916
  3,
@@ -448,6 +976,7 @@ export class ArithRewriter extends PolyRewriter {
448
976
  }
449
977
 
450
978
  private isNonNegative(expr: number) {
979
+ if (this.isNonNegativeFactor(expr)) return true;
451
980
  if (!this.isMul(expr)) return false;
452
981
  const factors = this.factors;
453
982
  shrink(factors, 0);
@@ -455,6 +984,7 @@ export class ArithRewriter extends PolyRewriter {
455
984
  let isNegative = false;
456
985
  let numFactors = 0;
457
986
  for (const arg of factors) {
987
+ if (this.isNonNegativeFactor(arg)) continue;
458
988
  if (!this.manager.isNumeral(arg)) factors[numFactors++] = arg;
459
989
  else if (this.getValue(arg).isNegative()) isNegative = !isNegative;
460
990
  }
@@ -478,6 +1008,21 @@ export class ArithRewriter extends PolyRewriter {
478
1008
  return this.isSuccessor(firstOdd, secondOdd) || this.isSuccessor(secondOdd, firstOdd);
479
1009
  }
480
1010
 
1011
+ private isNonNegativeFactor(expr: number) {
1012
+ const manager = this.manager;
1013
+ const op = manager.getOp(expr);
1014
+ if (op === OP_SEQ_LENGTH) return true;
1015
+ if (op !== OP_POWER) return false;
1016
+ const base = manager.getArg(expr, 0);
1017
+ const exponent = manager.getArg(expr, 1);
1018
+ if (manager.isNumeral(exponent) && manager.isInt(exponent)) {
1019
+ const value = this.getValue(exponent);
1020
+ if (value.isInt() && value.num >= 0n && value.num < 2n ** 32n && value.num % 2n === 0n)
1021
+ return true;
1022
+ }
1023
+ return manager.isNumeral(base) && this.getValue(base).isPositive();
1024
+ }
1025
+
481
1026
  private isSuccessor(base: number, sum: number) {
482
1027
  if (!this.isAdd(sum)) return false;
483
1028
  let offset = Rational.zero;
@@ -699,13 +1244,30 @@ export class ArithRewriter extends PolyRewriter {
699
1244
  ): number | Rewrite | undefined {
700
1245
  const manager = this.manager;
701
1246
  this.currSort = manager.sorts[originalLeft];
1247
+ if (
1248
+ (this.isZero(originalLeft) && this.isReducePowerTarget(originalRight, kind === KIND_EQ)) ||
1249
+ (this.isZero(originalRight) && this.isReducePowerTarget(originalLeft, kind === KIND_EQ))
1250
+ )
1251
+ return this.reduce(
1252
+ this.mkAtom(
1253
+ this.reducePower(originalLeft, kind === KIND_EQ),
1254
+ this.reducePower(originalRight, kind === KIND_EQ),
1255
+ kind,
1256
+ ),
1257
+ 1,
1258
+ );
702
1259
  const setSide = (index: number, expr: number) => {
703
1260
  manager.incRef(expr);
704
1261
  if (index < sides.length) manager.decRef(sides[index]);
705
1262
  sides[index] = expr;
706
1263
  };
707
1264
  const cancelled = manager.withTemporaries(
708
- () => this.cancelMonomials(originalLeft, originalRight, this.options.isArithIneqLhs),
1265
+ () =>
1266
+ this.cancelMonomials(
1267
+ originalLeft,
1268
+ originalRight,
1269
+ this.options.isArithIneqLhs || this.options.isArithLhs,
1270
+ ),
709
1271
  (result) => (result === undefined ? [] : [result.lhs, result.rhs]),
710
1272
  );
711
1273
  if (cancelled !== undefined) sides.push(cancelled.lhs, cancelled.rhs);
@@ -716,6 +1278,14 @@ export class ArithRewriter extends PolyRewriter {
716
1278
  return this.isHolding(this.getValue(left), this.getValue(right), kind)
717
1279
  ? manager.trueExpr
718
1280
  : manager.falseExpr;
1281
+ const leftValue = this.options.isAnumSimp ? this.getAlgebraicValue(left) : undefined;
1282
+ const rightValue = leftValue && this.getAlgebraicValue(right);
1283
+ if (leftValue !== undefined && rightValue !== undefined) {
1284
+ const comparison = manager.am.compare(leftValue, rightValue);
1285
+ const isHolding =
1286
+ kind === KIND_LE ? comparison <= 0 : kind === KIND_GE ? comparison >= 0 : comparison === 0;
1287
+ return isHolding ? manager.trueExpr : manager.falseExpr;
1288
+ }
719
1289
  const separated = this.getSeparated(left, right, kind);
720
1290
  if (separated !== undefined) return separated;
721
1291
  const bound = this.getBound(left, right, kind) ?? this.getBound(right, left, getInverse(kind));
@@ -774,6 +1344,17 @@ export class ArithRewriter extends PolyRewriter {
774
1344
  );
775
1345
  }
776
1346
  }
1347
+ if (manager.getOp(left) === OP_ITE && manager.getRefCount(left) === 1) {
1348
+ const thenAtom = this.mkAtom(manager.getArg(left, 1), right, kind);
1349
+ return this.reduce(
1350
+ manager.mkApp(
1351
+ OP_ITE,
1352
+ [manager.getArg(left, 0), thenAtom, this.mkAtom(manager.getArg(left, 2), right, kind)],
1353
+ SORT_BOOL,
1354
+ ),
1355
+ 2,
1356
+ );
1357
+ }
777
1358
  const isToIntRight = manager.getOp(right) === OP_TO_INT && manager.isNumeral(left);
778
1359
  const toIntArg =
779
1360
  manager.getOp(isToIntRight ? right : left) === OP_TO_INT
@@ -793,7 +1374,7 @@ export class ArithRewriter extends PolyRewriter {
793
1374
  return this.reduce(manager.mkAnd([mkUpper(), lower]), 3);
794
1375
  }
795
1376
  const negated =
796
- this.options.isArithIneqLhs && this.manager.isNumeral(right)
1377
+ (this.options.isArithLhs || this.options.isArithIneqLhs) && this.manager.isNumeral(right)
797
1378
  ? this.getNegatedPolynomial(left)
798
1379
  : undefined;
799
1380
  if (negated !== undefined) {
@@ -807,6 +1388,40 @@ export class ArithRewriter extends PolyRewriter {
807
1388
  return this.factorLeGeEq(left, right, kind);
808
1389
  }
809
1390
 
1391
+ private getReducedPowerBase(expr: number, isEq: boolean) {
1392
+ const manager = this.manager;
1393
+ if (manager.getOp(expr) !== OP_POWER) return undefined;
1394
+ const exponent = manager.getArg(expr, 1);
1395
+ if (!manager.isNumeral(exponent)) return undefined;
1396
+ const k = this.getValue(exponent);
1397
+ return k.isInt() && k.compare(Rational.of(isEq ? 1n : 2n)) > 0 ? k : undefined;
1398
+ }
1399
+
1400
+ private getFactors(expr: number) {
1401
+ return this.isMul(expr) ? this.manager.getArgs(expr) : [expr];
1402
+ }
1403
+
1404
+ private isReducePowerTarget(expr: number, isEq: boolean) {
1405
+ return this.getFactors(expr).some(
1406
+ (factor) => this.getReducedPowerBase(factor, isEq) !== undefined,
1407
+ );
1408
+ }
1409
+
1410
+ // x^k = 0 has the roots of x, and x^k <= 0 those of x or of x^2 by the parity of k.
1411
+ private reducePower(expr: number, isEq: boolean) {
1412
+ const manager = this.manager;
1413
+ if (this.isZero(expr)) return expr;
1414
+ const factors = this.getFactors(expr).map((factor) => {
1415
+ const k = this.getReducedPowerBase(factor, isEq);
1416
+ if (k === undefined) return factor;
1417
+ const base = manager.getArg(factor, 0);
1418
+ return isEq || getEuclideanMod(k.num, 2n) === 1n
1419
+ ? this.ensureReal(base)
1420
+ : this.mkPowerApp(this.ensureReal(base), manager.mkRealNumeral(TWO));
1421
+ });
1422
+ return factors.length === 1 ? factors[0] : manager.mkApp(OP_MUL, factors, SORT_REAL);
1423
+ }
1424
+
810
1425
  private factorLeGeEq(left: number, right: number, kind: number) {
811
1426
  if (!this.isZero(right)) return undefined;
812
1427
  const factor = this.findNlFactor(left);