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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -44
  15. package/dist/run.js +45 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +45 -42
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +578 -757
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +27 -62
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +246 -240
  35. package/src/cli/tlc-output.ts +686 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +59 -707
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +73 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +34 -107
  47. package/src/exit-codes.ts +3 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +634 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +55 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  310. package/src/prover/smt/solver/lp/pdd.ts +725 -289
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +17 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +244 -53
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +36 -50
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +70 -29
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -1,52 +0,0 @@
1
- // Ported from Isabelle2025's Pure/Isar/expression.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
- import { typargsOf } from "../pure/consts";
4
- import type { Term } from "../pure/term";
5
- import type { TlaLogic } from "../tla/logic";
6
- import { parseProp, parseType } from "./inner-syntax";
7
- import type { TheoryText } from "./theory";
8
- import { checkProps, type PropToCheck } from "./type-check";
9
-
10
- export interface Statement {
11
- readonly assumptions: readonly Term[];
12
- readonly conclusion: Term;
13
- }
14
-
15
- export const readStatement = (logic: TlaLogic, theory: TheoryText): Statement => {
16
- const theoryConsts = theory.consts.map((constant) => ({
17
- base: constant.name,
18
- name: `${theory.name}.${constant.name}`,
19
- type: parseType(constant.type),
20
- }));
21
- const scope = {
22
- consts: new Map([
23
- ...logic.consts,
24
- ...theoryConsts.map(
25
- (constant) =>
26
- [
27
- constant.name,
28
- { type: constant.type, typargs: typargsOf(constant.type), abbreviation: undefined },
29
- ] as const,
30
- ),
31
- ]),
32
- constNames: new Map([
33
- ...logic.constNames,
34
- ...theoryConsts.map((constant) => [constant.base, constant.name] as const),
35
- ]),
36
- };
37
- const props = theory.elements.reduce<{ fixed: ReadonlySet<string>; props: PropToCheck[] }>(
38
- (state, element) =>
39
- element.kind === "fixes"
40
- ? { fixed: new Set([...state.fixed, ...element.names]), props: state.props }
41
- : {
42
- fixed: state.fixed,
43
- props: [...state.props, { ast: parseProp(element.prop), fixed: state.fixed }],
44
- },
45
- { fixed: new Set(), props: [] },
46
- );
47
- const checked = checkProps(scope, [
48
- ...props.props,
49
- { ast: parseProp(theory.shows), fixed: props.fixed },
50
- ]);
51
- return { assumptions: checked.slice(0, -1), conclusion: checked[checked.length - 1] };
52
- };
@@ -1,10 +0,0 @@
1
- Z3
2
- Copyright (c) Microsoft Corporation
3
- All rights reserved.
4
- MIT License
5
-
6
- Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
7
-
8
- The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
9
-
10
- THE SOFTWARE IS PROVIDED *AS IS*, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
@@ -1,510 +0,0 @@
1
- // tlapm's library/TLAPS.tla, verbatim, so that proofs citing pragmas such as SMT load without
2
- // tlapm installed. tlapm's license follows.
3
- //
4
- // Copyright (c) 2008 INRIA and Microsoft Corporation
5
- // Copyright (c) 2023 Linux Foundation
6
- //
7
- // Redistribution and use in source and binary forms, with or without
8
- // modification, are permitted provided that the following conditions are
9
- // met:
10
- //
11
- // * Redistributions of source code must retain the above copyright
12
- // notice, this list of conditions and the following disclaimer.
13
- //
14
- // * Redistributions in binary form must reproduce the above copyright
15
- // notice, this list of conditions and the following disclaimer in
16
- // the documentation and/or other materials provided with the
17
- // distribution.
18
- //
19
- // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20
- // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21
- // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22
- // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23
- // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24
- // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25
- // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26
- // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27
- // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28
- // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29
- // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30
- export const TLAPS_MODULE = `------------------------------- MODULE TLAPS --------------------------------
31
-
32
- (* Backend pragmas. *)
33
-
34
-
35
- (***************************************************************************)
36
- (* Each of these pragmas can be cited with a BY or a USE. The pragma that *)
37
- (* is added to the context of an obligation most recently is the one whose *)
38
- (* effects are triggered. *)
39
- (***************************************************************************)
40
-
41
- (***************************************************************************)
42
- (* The following pragmas should be used only as a last resource. They are *)
43
- (* dependent upon the particular backend provers, and are unlikely to have *)
44
- (* any effect if the set of backend provers changes. Moreover, they are *)
45
- (* meaningless to a reader of the proof. *)
46
- (***************************************************************************)
47
-
48
-
49
- (**************************************************************************)
50
- (* Backend pragma: use the SMT solver for arithmetic. *)
51
- (* *)
52
- (* This method exists under this name for historical reasons. *)
53
- (**************************************************************************)
54
-
55
- SimpleArithmetic == TRUE (*{ by (prover:"smt3") }*)
56
-
57
-
58
- (**************************************************************************)
59
- (* Backend pragma: SMT solver *)
60
- (* *)
61
- (* This method translates the proof obligation to SMTLIB2. The supported *)
62
- (* fragment includes first-order logic, set theory, functions and *)
63
- (* records. *)
64
- (* SMT calls the smt-solver with the default timeout of 5 seconds *)
65
- (* while SMTT(n) calls the smt-solver with a timeout of n seconds. *)
66
- (* *)
67
- (* SMTT also accepts a string argument of the form "rN" to bound the *)
68
- (* underlying Z3 solver by a deterministic \`rlimit\` budget instead of a *)
69
- (* wall-clock timeout, e.g. SMTT("r5"). N is a multiple of a fixed base *)
70
- (* resource count, so a small readable budget like "r5" is meaningful. *)
71
- (* Unlike a wall-clock timeout, an \`rlimit\` budget does not depend on CPU *)
72
- (* speed or load, so the proof's pass/fail outcome reproduces on any *)
73
- (* machine and every rerun (for a fixed Z3 build); how long it takes to *)
74
- (* consume the budget still varies by machine. This is Z3-specific. *)
75
- (**************************************************************************)
76
-
77
- SMT == TRUE (*{ by (prover:"smt3") }*)
78
- SMTT(X) == TRUE (*{ by (prover:"smt3"; timeout:@) }*)
79
-
80
-
81
- (**************************************************************************)
82
- (* Backend pragma: CVC4 SMT solver *)
83
- (* *)
84
- (* These methods translate the proof obligation to SMTLIB2 and call CVC4. *)
85
- (**************************************************************************)
86
-
87
- (* The CVC3* methods are here for backward compatibility. They call CVC4. *)
88
- CVC3 == TRUE (*{ by (prover: "cvc33") }*)
89
- CVC3T(X) == TRUE (*{ by (prover:"cvc33"; timeout:@) }*)
90
-
91
- CVC4 == TRUE (*{ by (prover: "cvc33") }*)
92
- CVC4T(X) == TRUE (*{ by (prover:"cvc33"; timeout:@) }*)
93
-
94
-
95
- (**************************************************************************)
96
- (* Backend pragma: Yices SMT solver *)
97
- (* *)
98
- (* This method translates the proof obligation to Yices native language. *)
99
- (**************************************************************************)
100
-
101
- Yices == TRUE (*{ by (prover: "yices3") }*)
102
- YicesT(X) == TRUE (*{ by (prover:"yices3"; timeout:@) }*)
103
-
104
- (**************************************************************************)
105
- (* Backend pragma: veriT SMT solver *)
106
- (* *)
107
- (* This method translates the proof obligation to SMTLIB2 and calls veriT.*)
108
- (**************************************************************************)
109
-
110
- veriT == TRUE (*{ by (prover: "verit") }*)
111
- veriTT(X) == TRUE (*{ by (prover:"verit"; timeout:@) }*)
112
-
113
- (**************************************************************************)
114
- (* Backend pragma: Zipperposition solver *)
115
- (* *)
116
- (* This method translates the proof obligation to TPTP and *)
117
- (* calls Zipperposition. *)
118
- (**************************************************************************)
119
-
120
- Zipper == TRUE (*{ by (prover: "zipper") }*)
121
- ZipperT(X) == TRUE (*{ by (prover:"zipper"; timeout:@) }*)
122
-
123
- (**************************************************************************)
124
- (* Backend pragma: Z3 SMT solver *)
125
- (* *)
126
- (* This method translates the proof obligation to SMTLIB2 and calls Z3. *)
127
- (* Z3 is used by default but you can also explicitly call it. *)
128
- (* Z3T(n) bounds Z3 by a wall-clock timeout of n seconds, while Z3T("rN") *)
129
- (* bounds it by a deterministic \`rlimit\` budget of N base units, which *)
130
- (* reproduces the same outcome on any machine (see SMTT). *)
131
- (**************************************************************************)
132
-
133
- Z3 == TRUE (*{ by (prover: "z33") }*)
134
- Z3T(X) == TRUE (*{ by (prover:"z33"; timeout:@) }*)
135
-
136
- (**************************************************************************)
137
- (* Backend pragma: SPASS superposition prover *)
138
- (* *)
139
- (* This method translates the proof obligation to the DFG format language *)
140
- (* supported by the ATP SPASS. The translation is based on the SMT one. *)
141
- (**************************************************************************)
142
-
143
- Spass == TRUE (*{ by (prover: "spass") }*)
144
- SpassT(X) == TRUE (*{ by (prover:"spass"; timeout:@) }*)
145
-
146
- (**************************************************************************)
147
- (* Backend pragma: The PTL propositional linear time temporal logic *)
148
- (* prover. It currently is the LS4 backend. *)
149
- (* *)
150
- (* This method translates the negetation of the proof obligation to *)
151
- (* Seperated Normal Form (TRP++ format) and checks for unsatisfiability *)
152
- (**************************************************************************)
153
-
154
- LS4 == TRUE (*{ by (prover: "ls4") }*)
155
- LS4T(X) == TRUE (*{ by (prover: "ls4"; timeout:@) }*)
156
- PTL == TRUE (*{ by (prover: "ls4") }*)
157
-
158
- (**************************************************************************)
159
- (* Backend pragma: Zenon with different timeouts (default is 10 seconds) *)
160
- (* *)
161
- (**************************************************************************)
162
-
163
- Zenon == TRUE (*{ by (prover:"zenon") }*)
164
- ZenonT(X) == TRUE (*{ by (prover:"zenon"; timeout:@) }*)
165
-
166
- (********************************************************************)
167
- (* Backend pragma: Isabelle with different timeouts and tactics *)
168
- (* (default is 30 seconds/auto) *)
169
- (********************************************************************)
170
-
171
- Isa == TRUE (*{ by (prover:"isabelle") }*)
172
- IsaT(X) == TRUE (*{ by (prover:"isabelle"; timeout:@) }*)
173
- IsaM(X) == TRUE (*{ by (prover:"isabelle"; tactic:@) }*)
174
- IsaMT(X,Y) == TRUE (*{ by (prover:"isabelle"; tactic:@; timeout:@) }*)
175
-
176
- (***************************************************************************)
177
- (* The following theorem expresses the (useful implication of the) law of *)
178
- (* set extensionality, which can be written as *)
179
- (* *)
180
- (* THEOREM \\A S, T : (S = T) <=> (\\A x : (x \\in S) <=> (x \\in T)) *)
181
- (* *)
182
- (* Theorem SetExtensionality is sometimes required by the SMT backend for *)
183
- (* reasoning about sets. It is usually counterproductive to include *)
184
- (* theorem SetExtensionality in a BY clause for the Zenon or Isabelle *)
185
- (* backends. Instead, use the pragma IsaWithSetExtensionality to instruct *)
186
- (* the Isabelle backend to use the rule of set extensionality. *)
187
- (***************************************************************************)
188
- IsaWithSetExtensionality == TRUE
189
- (*{ by (prover:"isabelle"; tactic:"(auto intro: setEqualI)")}*)
190
-
191
- THEOREM SetExtensionality == \\A S,T : (\\A x : x \\in S <=> x \\in T) => S = T
192
- OBVIOUS
193
-
194
- (***************************************************************************)
195
- (* The following theorem is needed to deduce NotInSetS \\notin SetS from *)
196
- (* the definition *)
197
- (* *)
198
- (* NotInSetS == CHOOSE v : v \\notin SetS *)
199
- (***************************************************************************)
200
- THEOREM NoSetContainsEverything == \\A S : \\E x : x \\notin S
201
- OBVIOUS (*{by (isabelle "(auto intro: inIrrefl)")}*)
202
- -----------------------------------------------------------------------------
203
-
204
-
205
-
206
- (********************************************************************)
207
- (********************************************************************)
208
- (********************************************************************)
209
-
210
-
211
- (********************************************************************)
212
- (* Old versions of Zenon and Isabelle pragmas below *)
213
- (* (kept for compatibility) *)
214
- (********************************************************************)
215
-
216
-
217
- (**************************************************************************)
218
- (* Backend pragma: Zenon with different timeouts (default is 10 seconds) *)
219
- (* *)
220
- (**************************************************************************)
221
-
222
- SlowZenon == TRUE (*{ by (prover:"zenon"; timeout:20) }*)
223
- SlowerZenon == TRUE (*{ by (prover:"zenon"; timeout:40) }*)
224
- VerySlowZenon == TRUE (*{ by (prover:"zenon"; timeout:80) }*)
225
- SlowestZenon == TRUE (*{ by (prover:"zenon"; timeout:160) }*)
226
-
227
-
228
-
229
- (********************************************************************)
230
- (* Backend pragma: Isabelle's automatic search ("auto") *)
231
- (* *)
232
- (* This pragma bypasses Zenon. It is useful in situations involving *)
233
- (* essentially simplification and equational reasoning. *)
234
- (* Default imeout for all isabelle tactics is 30 seconds. *)
235
- (********************************************************************)
236
- Auto == TRUE (*{ by (prover:"isabelle"; tactic:"auto") }*)
237
- SlowAuto == TRUE (*{ by (prover:"isabelle"; tactic:"auto"; timeout:120) }*)
238
- SlowerAuto == TRUE (*{ by (prover:"isabelle"; tactic:"auto"; timeout:480) }*)
239
- SlowestAuto == TRUE (*{ by (prover:"isabelle"; tactic:"auto"; timeout:960) }*)
240
-
241
- (********************************************************************)
242
- (* Backend pragma: Isabelle's "force" tactic *)
243
- (* *)
244
- (* This pragma bypasses Zenon. It is useful in situations involving *)
245
- (* quantifier reasoning. *)
246
- (********************************************************************)
247
- Force == TRUE (*{ by (prover:"isabelle"; tactic:"force") }*)
248
- SlowForce == TRUE (*{ by (prover:"isabelle"; tactic:"force"; timeout:120) }*)
249
- SlowerForce == TRUE (*{ by (prover:"isabelle"; tactic:"force"; timeout:480) }*)
250
- SlowestForce == TRUE (*{ by (prover:"isabelle"; tactic:"force"; timeout:960) }*)
251
-
252
- (***********************************************************************)
253
- (* Backend pragma: Isabelle's "simplification" tactics *)
254
- (* *)
255
- (* These tactics simplify the goal before running one of the automated *)
256
- (* tactics. They are often necessary for obligations involving record *)
257
- (* or tuple projections. Use the SimplfyAndSolve tactic unless you're *)
258
- (* sure you can get away with just Simplification *)
259
- (***********************************************************************)
260
- SimplifyAndSolve == TRUE
261
- (*{ by (prover:"isabelle"; tactic:"clarsimp auto?") }*)
262
- SlowSimplifyAndSolve == TRUE
263
- (*{ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:120) }*)
264
- SlowerSimplifyAndSolve == TRUE
265
- (*{ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:480) }*)
266
- SlowestSimplifyAndSolve == TRUE
267
- (*{ by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:960) }*)
268
-
269
- Simplification == TRUE (*{ by (prover:"isabelle"; tactic:"clarsimp") }*)
270
- SlowSimplification == TRUE
271
- (*{ by (prover:"isabelle"; tactic:"clarsimp"; timeout:120) }*)
272
- SlowerSimplification == TRUE
273
- (*{ by (prover:"isabelle"; tactic:"clarsimp"; timeout:480) }*)
274
- SlowestSimplification == TRUE
275
- (*{ by (prover:"isabelle"; tactic:"clarsimp"; timeout:960) }*)
276
-
277
- (**************************************************************************)
278
- (* Backend pragma: Isabelle's tableau prover ("blast") *)
279
- (* *)
280
- (* This pragma bypasses Zenon and uses Isabelle's built-in theorem *)
281
- (* prover, Blast. It is almost never better than Zenon by itself, but *)
282
- (* becomes very useful in combination with the Auto pragma above. The *)
283
- (* AutoBlast pragma first attempts Auto and then uses Blast to prove what *)
284
- (* Auto could not prove. (There is currently no way to use Zenon on the *)
285
- (* results left over from Auto.) *)
286
- (**************************************************************************)
287
- Blast == TRUE (*{ by (prover:"isabelle"; tactic:"blast") }*)
288
- SlowBlast == TRUE (*{ by (prover:"isabelle"; tactic:"blast"; timeout:120) }*)
289
- SlowerBlast == TRUE (*{ by (prover:"isabelle"; tactic:"blast"; timeout:480) }*)
290
- SlowestBlast == TRUE (*{ by (prover:"isabelle"; tactic:"blast"; timeout:960) }*)
291
-
292
- AutoBlast == TRUE (*{ by (prover:"isabelle"; tactic:"auto, blast") }*)
293
-
294
-
295
- (**************************************************************************)
296
- (* Backend pragmas: multi-back-ends *)
297
- (* *)
298
- (* These pragmas just run a bunch of back-ends one after the other in the *)
299
- (* hope that one will succeed. This saves time and effort for the user at *)
300
- (* the expense of computation time. *)
301
- (**************************************************************************)
302
-
303
- (* CVC3 goes first because it's bundled with TLAPS, then the other SMT
304
- solvers are unlikely to succeed if CVC3 fails, so we run zenon and
305
- Isabelle before them. *)
306
- AllProvers == TRUE (*{
307
- by (prover:"cvc33")
308
- by (prover:"zenon")
309
- by (prover:"isabelle"; tactic:"auto")
310
- by (prover:"spass")
311
- by (prover:"smt3")
312
- by (prover:"yices3")
313
- by (prover:"verit")
314
- by (prover:"z33")
315
- by (prover:"isabelle"; tactic:"force")
316
- by (prover:"isabelle"; tactic:"(auto intro: setEqualI)")
317
- by (prover:"isabelle"; tactic:"clarsimp auto?")
318
- by (prover:"isabelle"; tactic:"clarsimp")
319
- by (prover:"isabelle"; tactic:"auto, blast")
320
- }*)
321
- AllProversT(X) == TRUE (*{
322
- by (prover:"cvc33"; timeout:@)
323
- by (prover:"zenon"; timeout:@)
324
- by (prover:"isabelle"; tactic:"auto"; timeout:@)
325
- by (prover:"spass"; timeout:@)
326
- by (prover:"smt3"; timeout:@)
327
- by (prover:"yices3"; timeout:@)
328
- by (prover:"verit"; timeout:@)
329
- by (prover:"z33"; timeout:@)
330
- by (prover:"isabelle"; tactic:"force"; timeout:@)
331
- by (prover:"isabelle"; tactic:"(auto intro: setEqualI)"; timeout:@)
332
- by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:@)
333
- by (prover:"isabelle"; tactic:"clarsimp"; timeout:@)
334
- by (prover:"isabelle"; tactic:"auto, blast"; timeout:@)
335
- }*)
336
-
337
- AllSMT == TRUE (*{
338
- by (prover:"cvc33")
339
- by (prover:"smt3")
340
- by (prover:"yices3")
341
- by (prover:"verit")
342
- by (prover:"z33")
343
- }*)
344
- AllSMTT(X) == TRUE (*{
345
- by (prover:"cvc33"; timeout:@)
346
- by (prover:"smt3"; timeout:@)
347
- by (prover:"yices3"; timeout:@)
348
- by (prover:"verit"; timeout:@)
349
- by (prover:"z33"; timeout:@)
350
- }*)
351
-
352
- AllIsa == TRUE (*{
353
- by (prover:"isabelle"; tactic:"auto")
354
- by (prover:"isabelle"; tactic:"force")
355
- by (prover:"isabelle"; tactic:"(auto intro: setEqualI)")
356
- by (prover:"isabelle"; tactic:"clarsimp auto?")
357
- by (prover:"isabelle"; tactic:"clarsimp")
358
- by (prover:"isabelle"; tactic:"auto, blast")
359
- }*)
360
- AllIsaT(X) == TRUE (*{
361
- by (prover:"isabelle"; tactic:"auto"; timeout:@)
362
- by (prover:"isabelle"; tactic:"force"; timeout:@)
363
- by (prover:"isabelle"; tactic:"(auto intro: setEqualI)"; timeout:@)
364
- by (prover:"isabelle"; tactic:"clarsimp auto?"; timeout:@)
365
- by (prover:"isabelle"; tactic:"clarsimp"; timeout:@)
366
- by (prover:"isabelle"; tactic:"auto, blast"; timeout:@)
367
- }*)
368
-
369
-
370
- (**************************************************************************)
371
- (* The pragma ExpandEnabled invokes expansion of the operator ENABLED. *)
372
- (* *)
373
- (* The pragma ExpandCdot invokes expansion of the operator \\cdot. *)
374
- (* *)
375
- (* The pragma AutoUSE invokes automated expansion of definitions, *)
376
- (* for both of ExpandEnabled and ExpandCdot, when each is present. *)
377
- (* *)
378
- (* The pragma Lambdify invokes expansion of the operators *)
379
- (* ENABLED and \\cdot to an intermediate form with bound VARIABLES, *)
380
- (* which is a form before introducing rigid quantifiers. *)
381
- (* The pragma Lambdify is sound for occurrences of ENABLED and \\cdot *)
382
- (* that are not nested. *)
383
- (**************************************************************************)
384
- ExpandENABLED == TRUE (*{ by (prover:"expandenabled") }*)
385
- ExpandCdot == TRUE (*{ by (prover:"expandcdot") }*)
386
- AutoUSE == TRUE (*{ by (prover:"autouse") }*)
387
- Lambdify == TRUE (*{ by (prover:"lambdify") }*)
388
- ENABLEDaxioms == TRUE (*{ by (prover:"enabledaxioms") }*)
389
- LevelComparison == TRUE (*{ by (prover:"levelcomparison") }*)
390
-
391
- (* The operators EnabledWrapper and CdotWrapper occur in an intermediate *)
392
- (* representation within TLAPM. *)
393
- EnabledWrapper(Op(_)) == FALSE
394
- CdotWrapper(Op(_)) == FALSE
395
-
396
- (***************************************************************************)
397
- (* The following may be used in a \`BY ONLY ThmName\` for unit testing the *)
398
- (* triviality checks in TLAPM. *)
399
- (***************************************************************************)
400
- Trivial == TRUE (*{ by (prover:"trivial") }*)
401
-
402
-
403
- =============================================================================
404
-
405
- The material below is obsolete: the TLA proof rules below are superseded by
406
- the PTL decision procedure, and their formulation is unsound for the semantics
407
- of temporal reasoning that TLAPS adopts.
408
-
409
- ----------------------------------------------------------------------------
410
- (***************************************************************************)
411
- (* TEMPORAL LOGIC *)
412
- (* *)
413
- (* The following rules are intended to be used when TLAPS handles temporal *)
414
- (* logic. They will not work now. Moreover when temporal reasoning is *)
415
- (* implemented, these rules may be changed or omitted, and additional *)
416
- (* rules will probably be added. However, they are included mainly so *)
417
- (* their names will be defined, preventing the use of identifiers that are *)
418
- (* likely to produce name clashes with future versions of this module. *)
419
- (***************************************************************************)
420
-
421
-
422
- (***************************************************************************)
423
- (* The following proof rules (and their names) are from the paper "The *)
424
- (* Temporal Logic of Actions". *)
425
- (***************************************************************************)
426
- THEOREM RuleTLA1 == ASSUME STATE P, STATE f,
427
- P /\\ (f' = f) => P'
428
- PROVE []P <=> P /\\ [][P => P']_f
429
-
430
- THEOREM RuleTLA2 == ASSUME STATE P, STATE Q, STATE f, STATE g,
431
- ACTION A, ACTION B,
432
- P /\\ [A]_f => Q /\\ [B]_g
433
- PROVE []P /\\ [][A]_f => []Q /\\ [][B]_g
434
-
435
- THEOREM RuleINV1 == ASSUME STATE I, STATE F, ACTION N,
436
- I /\\ [N]_F => I'
437
- PROVE I /\\ [][N]_F => []I
438
-
439
- THEOREM RuleINV2 == ASSUME STATE I, STATE f, ACTION N
440
- PROVE []I => ([][N]_f <=> [][N /\\ I /\\ I']_f)
441
-
442
- THEOREM RuleWF1 == ASSUME STATE P, STATE Q, STATE f, ACTION N, ACTION A,
443
- P /\\ [N]_f => (P' \\/ Q'),
444
- P /\\ <<N /\\ A>>_f => Q',
445
- P => ENABLED <<A>>_f
446
- PROVE [][N]_f /\\ WF_f(A) => (P ~> Q)
447
-
448
- THEOREM RuleSF1 == ASSUME STATE P, STATE Q, STATE f,
449
- ACTION N, ACTION A, TEMPORAL F,
450
- P /\\ [N]_f => (P' \\/ Q'),
451
- P /\\ <<N /\\ A>>_f => Q',
452
- []P /\\ [][N]_f /\\ []F => <> ENABLED <<A>>_f
453
- PROVE [][N]_f /\\ SF_f(A) /\\ []F => (P ~> Q)
454
-
455
- (***************************************************************************)
456
- (* The rules WF2 and SF2 in "The Temporal Logic of Actions" are obtained *)
457
- (* from the following two rules by the following substitutions: \`. *)
458
- (* *)
459
- (* ___ ___ _______________ *)
460
- (* M <- M , g <- g , EM <- ENABLED <<M>>_g .' *)
461
- (***************************************************************************)
462
- THEOREM RuleWF2 == ASSUME STATE P, STATE f, STATE g, STATE EM,
463
- ACTION A, ACTION B, ACTION N, ACTION M,
464
- TEMPORAL F,
465
- <<N /\\ B>>_f => <<M>>_g,
466
- P /\\ P' /\\ <<N /\\ A>>_f /\\ EM => B,
467
- P /\\ EM => ENABLED A,
468
- [][N /\\ ~B]_f /\\ WF_f(A) /\\ []F /\\ <>[]EM => <>[]P
469
- PROVE [][N]_f /\\ WF_f(A) /\\ []F => []<><<M>>_g \\/ []<>(~EM)
470
-
471
- THEOREM RuleSF2 == ASSUME STATE P, STATE f, STATE g, STATE EM,
472
- ACTION A, ACTION B, ACTION N, ACTION M,
473
- TEMPORAL F,
474
- <<N /\\ B>>_f => <<M>>_g,
475
- P /\\ P' /\\ <<N /\\ A>>_f /\\ EM => B,
476
- P /\\ EM => ENABLED A,
477
- [][N /\\ ~B]_f /\\ SF_f(A) /\\ []F /\\ []<>EM => <>[]P
478
- PROVE [][N]_f /\\ SF_f(A) /\\ []F => []<><<M>>_g \\/ <>[](~EM)
479
-
480
-
481
- (***************************************************************************)
482
- (* The following rule is a special case of the general temporal logic *)
483
- (* proof rule STL4 from the paper "The Temporal Logic of Actions". The *)
484
- (* general rule is for arbitrary temporal formulas F and G, but it cannot *)
485
- (* yet be handled by TLAPS. *)
486
- (***************************************************************************)
487
- THEOREM RuleInvImplication ==
488
- ASSUME STATE F, STATE G,
489
- F => G
490
- PROVE []F => []G
491
- PROOF OMITTED
492
-
493
- (***************************************************************************)
494
- (* The following rule is a special case of rule TLA2 from the paper "The *)
495
- (* Temporal Logic of Actions". *)
496
- (***************************************************************************)
497
- THEOREM RuleStepSimulation ==
498
- ASSUME STATE I, STATE f, STATE g,
499
- ACTION M, ACTION N,
500
- I /\\ I' /\\ [M]_f => [N]_g
501
- PROVE []I /\\ [][M]_f => [][N]_g
502
- PROOF OMITTED
503
-
504
- (***************************************************************************)
505
- (* The following may be used to invoke a decision procedure for *)
506
- (* propositional temporal logic. *)
507
- (***************************************************************************)
508
- PropositionalTemporalLogic == TRUE
509
- =============================================================================
510
- `;
@@ -1,32 +0,0 @@
1
- Copyright (c) 1997-2006, Institut National de Recherche en
2
- Informatique et en Automatique (INRIA)
3
-
4
- All rights reserved.
5
-
6
- Redistribution and use in source and binary forms, with or without
7
- modification, are permitted provided that the following conditions are
8
- met:
9
-
10
- * Redistributions of source code must retain the above copyright notice,
11
- this list of conditions and the following disclaimer.
12
-
13
- * Redistributions in binary form must reproduce the above copyright
14
- notice, this list of conditions and the following disclaimer in the
15
- documentation and/or other materials provided with the
16
- distribution.
17
-
18
- * Neither the name of INRIA nor the names of its contributors may
19
- be used to endorse or promote products derived from this software
20
- without specific prior written permission.
21
-
22
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23
- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24
- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
25
- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
26
- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
27
- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
28
- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
32
- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.