tla-ts 0.0.4-dev.e4c2d0e → 0.0.4-dev.ee344a5

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 (311) hide show
  1. package/README.md +45 -1
  2. package/dist/deciders.cjs +366 -0
  3. package/dist/deciders.js +366 -0
  4. package/dist/index.cjs +1 -1
  5. package/dist/index.d.cts +35 -1
  6. package/dist/index.d.ts +35 -1
  7. package/dist/index.js +1 -1
  8. package/dist/parallel-worker.cjs +1 -4
  9. package/dist/parallel-worker.js +1 -4
  10. package/dist/prove-worker.cjs +9 -0
  11. package/dist/prove-worker.d.cts +9 -0
  12. package/dist/prove-worker.d.ts +9 -0
  13. package/dist/prove-worker.js +9 -0
  14. package/dist/prove.cjs +515 -0
  15. package/dist/prove.js +515 -0
  16. package/dist/run-cli.cjs +30 -47
  17. package/dist/run-cli.js +30 -47
  18. package/dist/tlapm.cjs +10 -0
  19. package/dist/tlapm.js +10 -0
  20. package/dist/transfer.cjs +38 -44
  21. package/dist/transfer.js +38 -44
  22. package/dist/worker.cjs +21 -0
  23. package/dist/worker.js +21 -0
  24. package/package.json +21 -12
  25. package/src/check.ts +1 -0
  26. package/src/codegen.ts +26 -7
  27. package/src/errors.ts +86 -0
  28. package/src/evaluate.ts +63 -20
  29. package/src/index.ts +10 -0
  30. package/src/{obligation-action.ts → obligations/action.ts} +258 -37
  31. package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
  32. package/src/obligations/ctx.ts +64 -0
  33. package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
  34. package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
  35. package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
  36. package/src/{obligations.ts → obligations/index.ts} +26 -12
  37. package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
  38. package/src/{obligation-module.ts → obligations/module.ts} +46 -20
  39. package/src/obligations/pickle.ts +100 -0
  40. package/src/obligations/pragma.ts +189 -0
  41. package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
  42. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
  43. package/src/{obligation-source.ts → obligations/source.ts} +91 -35
  44. package/src/obligations/temporal.ts +319 -0
  45. package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
  46. package/src/parallel-worker.ts +2 -18
  47. package/src/parallel.ts +10 -43
  48. package/src/prove/decide-pool.ts +100 -0
  49. package/src/prove/deciders.ts +27 -0
  50. package/src/prove/isabelle/LICENSE +36 -0
  51. package/src/prove/isabelle/LICENSE-tlapm +26 -0
  52. package/src/prove/isabelle/decide.ts +47 -0
  53. package/src/prove/isabelle/encode.ts +477 -0
  54. package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
  55. package/src/prove/isabelle/isar/method.ts +367 -0
  56. package/src/prove/isabelle/isar/proof.ts +28 -0
  57. package/src/prove/isabelle/isar/statement.ts +57 -0
  58. package/src/prove/isabelle/isar/theory.ts +192 -0
  59. package/src/prove/isabelle/isar/type-check.ts +278 -0
  60. package/src/prove/isabelle/provers/blast/blast.ts +258 -0
  61. package/src/prove/isabelle/provers/blast/branch.ts +322 -0
  62. package/src/prove/isabelle/provers/blast/prove.ts +347 -0
  63. package/src/prove/isabelle/provers/blast/rules.ts +330 -0
  64. package/src/prove/isabelle/provers/blast/state.ts +180 -0
  65. package/src/prove/isabelle/provers/blast/term.ts +547 -0
  66. package/src/prove/isabelle/provers/clasimp.ts +150 -0
  67. package/src/prove/isabelle/provers/classical.ts +389 -0
  68. package/src/prove/isabelle/provers/hypsubst.ts +441 -0
  69. package/src/prove/isabelle/pure/bicompose.ts +174 -0
  70. package/src/prove/isabelle/pure/consts.ts +32 -0
  71. package/src/prove/isabelle/pure/conv.ts +79 -0
  72. package/src/prove/isabelle/pure/drule.ts +264 -0
  73. package/src/prove/isabelle/pure/envir.ts +363 -0
  74. package/src/prove/isabelle/pure/goal.ts +53 -0
  75. package/src/prove/isabelle/pure/interrupt.ts +16 -0
  76. package/src/prove/isabelle/pure/list.ts +12 -0
  77. package/src/prove/isabelle/pure/logic.ts +402 -0
  78. package/src/prove/isabelle/pure/name.ts +110 -0
  79. package/src/prove/isabelle/pure/net.ts +262 -0
  80. package/src/prove/isabelle/pure/object-logic.ts +41 -0
  81. package/src/prove/isabelle/pure/pattern.ts +650 -0
  82. package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
  83. package/src/prove/isabelle/pure/rewriter.ts +602 -0
  84. package/src/prove/isabelle/pure/search.ts +68 -0
  85. package/src/prove/isabelle/pure/seq.ts +156 -0
  86. package/src/prove/isabelle/pure/simplifier.ts +112 -0
  87. package/src/prove/isabelle/pure/table.ts +208 -0
  88. package/src/prove/isabelle/pure/tactic.ts +276 -0
  89. package/src/prove/isabelle/pure/tactical.ts +347 -0
  90. package/src/prove/isabelle/pure/term-ord.ts +159 -0
  91. package/src/prove/isabelle/pure/term.ts +808 -0
  92. package/src/prove/isabelle/pure/thm.ts +806 -0
  93. package/src/prove/isabelle/pure/type.ts +133 -0
  94. package/src/prove/isabelle/pure/unify.ts +753 -0
  95. package/src/prove/isabelle/pure/variable.ts +25 -0
  96. package/src/prove/isabelle/tla/classical-setup.ts +101 -0
  97. package/src/prove/isabelle/tla/context.ts +74 -0
  98. package/src/prove/isabelle/tla/logic-data.ts +5 -0
  99. package/src/prove/isabelle/tla/logic.ts +215 -0
  100. package/src/prove/isabelle/tla/simpdata.ts +241 -0
  101. package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
  102. package/src/prove/ocaml.ts +22 -0
  103. package/src/prove/prep/action.ts +520 -0
  104. package/src/prove/prep/defs.ts +27 -0
  105. package/src/prove/prep/elab.ts +156 -0
  106. package/src/prove/prep/enabled-axioms.ts +189 -0
  107. package/src/prove/prep/enabled.ts +43 -0
  108. package/src/prove/prep/fingerprint.ts +388 -0
  109. package/src/prove/prep/flatten.ts +70 -0
  110. package/src/prove/prep/level-comparison.ts +552 -0
  111. package/src/prove/prep/md5.ts +67 -0
  112. package/src/prove/prep/pragma.ts +221 -0
  113. package/src/prove/prep/trivial.ts +22 -0
  114. package/src/prove/prove-worker.ts +29 -0
  115. package/src/prove/prove.ts +417 -0
  116. package/src/prove/ptl/decide.ts +68 -0
  117. package/src/prove/ptl/encode.ts +256 -0
  118. package/src/prove/ptl/sat.ts +151 -0
  119. package/src/prove/ptl/tableau.ts +276 -0
  120. package/src/prove/smt/axiomatize.ts +69 -0
  121. package/src/prove/smt/axioms.ts +210 -0
  122. package/src/prove/smt/context.ts +108 -0
  123. package/src/prove/smt/data.ts +665 -0
  124. package/src/prove/smt/encode.ts +169 -0
  125. package/src/prove/smt/extensionality.ts +63 -0
  126. package/src/prove/smt/flatten.ts +127 -0
  127. package/src/prove/smt/format.ts +143 -0
  128. package/src/prove/smt/instances.ts +182 -0
  129. package/src/prove/smt/rewrite.ts +784 -0
  130. package/src/prove/smt/simplify.ts +57 -0
  131. package/src/prove/smt/solver/act-cache.ts +265 -0
  132. package/src/prove/smt/solver/arith-rewriter.ts +962 -0
  133. package/src/prove/smt/solver/array.ts +22 -0
  134. package/src/prove/smt/solver/asserted-formulas.ts +469 -0
  135. package/src/prove/smt/solver/ast-lt.ts +157 -0
  136. package/src/prove/smt/solver/ast-util.ts +147 -0
  137. package/src/prove/smt/solver/ast.ts +1315 -0
  138. package/src/prove/smt/solver/auf-solver.ts +572 -0
  139. package/src/prove/smt/solver/case-split-queue.ts +178 -0
  140. package/src/prove/smt/solver/cg-table.ts +175 -0
  141. package/src/prove/smt/solver/clause.ts +276 -0
  142. package/src/prove/smt/solver/conflict-resolution.ts +343 -0
  143. package/src/prove/smt/solver/context.ts +1292 -0
  144. package/src/prove/smt/solver/ctx-simplify.ts +334 -0
  145. package/src/prove/smt/solver/der.ts +224 -0
  146. package/src/prove/smt/solver/dyn-ack.ts +141 -0
  147. package/src/prove/smt/solver/e-matching.ts +659 -0
  148. package/src/prove/smt/solver/enode.ts +259 -0
  149. package/src/prove/smt/solver/expr-ref.ts +21 -0
  150. package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
  151. package/src/prove/smt/solver/fingerprints.ts +92 -0
  152. package/src/prove/smt/solver/flat-literals.ts +51 -0
  153. package/src/prove/smt/solver/goal.ts +138 -0
  154. package/src/prove/smt/solver/hash.ts +173 -0
  155. package/src/prove/smt/solver/hashtable.ts +166 -0
  156. package/src/prove/smt/solver/internalizer.ts +1381 -0
  157. package/src/prove/smt/solver/lbool.ts +5 -0
  158. package/src/prove/smt/solver/literal.ts +24 -0
  159. package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
  160. package/src/prove/smt/solver/lp/constraints.ts +78 -0
  161. package/src/prove/smt/solver/lp/containers.ts +296 -0
  162. package/src/prove/smt/solver/lp/core-solver.ts +504 -0
  163. package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
  164. package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
  165. package/src/prove/smt/solver/lp/dependency.ts +51 -0
  166. package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
  167. package/src/prove/smt/solver/lp/explanation.ts +46 -0
  168. package/src/prove/smt/solver/lp/gomory.ts +255 -0
  169. package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
  170. package/src/prove/smt/solver/lp/hnf.ts +281 -0
  171. package/src/prove/smt/solver/lp/int-cube.ts +295 -0
  172. package/src/prove/smt/solver/lp/int-solver.ts +514 -0
  173. package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
  174. package/src/prove/smt/solver/lp/lar-term.ts +62 -0
  175. package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
  176. package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
  177. package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
  178. package/src/prove/smt/solver/lp/nex.ts +120 -0
  179. package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
  180. package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
  181. package/src/prove/smt/solver/lp/nla-core.ts +968 -0
  182. package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
  183. package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
  184. package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
  185. package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
  186. package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
  187. package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
  188. package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  189. package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
  190. package/src/prove/smt/solver/lp/nla-order.ts +307 -0
  191. package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
  192. package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
  193. package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
  194. package/src/prove/smt/solver/lp/nla-types.ts +124 -0
  195. package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
  196. package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
  197. package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
  198. package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
  199. package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
  200. package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
  201. package/src/prove/smt/solver/lp/pdd.ts +971 -0
  202. package/src/prove/smt/solver/lp/random-updater.ts +138 -0
  203. package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
  204. package/src/prove/smt/solver/lp/union-find.ts +96 -0
  205. package/src/prove/smt/solver/mam-compiler.ts +847 -0
  206. package/src/prove/smt/solver/mam-interpreter.ts +400 -0
  207. package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
  208. package/src/prove/smt/solver/model-checker.ts +347 -0
  209. package/src/prove/smt/solver/model-evaluator.ts +262 -0
  210. package/src/prove/smt/solver/model-finder.ts +155 -0
  211. package/src/prove/smt/solver/model-generator.ts +97 -0
  212. package/src/prove/smt/solver/model-macro-solver.ts +728 -0
  213. package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
  214. package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
  215. package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
  216. package/src/prove/smt/solver/nlsat/explain.ts +607 -0
  217. package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
  218. package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
  219. package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
  220. package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
  221. package/src/prove/smt/solver/nlsat/solver.ts +911 -0
  222. package/src/prove/smt/solver/nlsat/types.ts +43 -0
  223. package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  224. package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
  225. package/src/prove/smt/solver/nnf.ts +469 -0
  226. package/src/prove/smt/solver/pattern-inference.ts +351 -0
  227. package/src/prove/smt/solver/poly-rewriter.ts +477 -0
  228. package/src/prove/smt/solver/propagate-values.ts +83 -0
  229. package/src/prove/smt/solver/proto-model.ts +551 -0
  230. package/src/prove/smt/solver/pull-quant.ts +139 -0
  231. package/src/prove/smt/solver/qe-lite-der.ts +526 -0
  232. package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
  233. package/src/prove/smt/solver/qe-lite.ts +381 -0
  234. package/src/prove/smt/solver/qi-queue.ts +362 -0
  235. package/src/prove/smt/solver/quant-tactics.ts +117 -0
  236. package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
  237. package/src/prove/smt/solver/quantifier-manager.ts +186 -0
  238. package/src/prove/smt/solver/random-gen.ts +10 -0
  239. package/src/prove/smt/solver/rational.ts +165 -0
  240. package/src/prove/smt/solver/ref-vector.ts +62 -0
  241. package/src/prove/smt/solver/relevancy.ts +247 -0
  242. package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
  243. package/src/prove/smt/solver/rewriter.ts +843 -0
  244. package/src/prove/smt/solver/rlimit.ts +79 -0
  245. package/src/prove/smt/solver/smtlib-parser.ts +526 -0
  246. package/src/prove/smt/solver/solver.ts +71 -0
  247. package/src/prove/smt/solver/sort.ts +35 -0
  248. package/src/prove/smt/solver/sticky-generations.ts +69 -0
  249. package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
  250. package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
  251. package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
  252. package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
  253. package/src/prove/smt/solver/theory-lra-model.ts +243 -0
  254. package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
  255. package/src/prove/smt/solver/theory-lra-state.ts +43 -0
  256. package/src/prove/smt/solver/theory-lra.ts +56 -0
  257. package/src/prove/smt/solver/var-subst.ts +258 -0
  258. package/src/prove/smt/solver/z3-license.txt +10 -0
  259. package/src/prove/smt/table.ts +170 -0
  260. package/src/prove/tlapm/tlapm.ts +96 -0
  261. package/src/prove/tlaps-module.ts +510 -0
  262. package/src/prove/verdict.ts +13 -0
  263. package/src/prove/zenon/LICENSE +32 -0
  264. package/src/prove/zenon/check/check.ts +105 -0
  265. package/src/prove/zenon/check/definitions.ts +144 -0
  266. package/src/prove/zenon/check/equality.ts +182 -0
  267. package/src/prove/zenon/check/functions.ts +62 -0
  268. package/src/prove/zenon/check/keys.ts +125 -0
  269. package/src/prove/zenon/check/propositional.ts +104 -0
  270. package/src/prove/zenon/check/records.ts +188 -0
  271. package/src/prove/zenon/check/relations.ts +121 -0
  272. package/src/prove/zenon/check/rewrites.ts +224 -0
  273. package/src/prove/zenon/check/sets.ts +302 -0
  274. package/src/prove/zenon/check/terms.ts +127 -0
  275. package/src/prove/zenon/check/tla.ts +126 -0
  276. package/src/prove/zenon/decide.ts +113 -0
  277. package/src/prove/zenon/encode.ts +444 -0
  278. package/src/prove/zenon/eqrel.ts +300 -0
  279. package/src/prove/zenon/equality-rules.ts +435 -0
  280. package/src/prove/zenon/expr.ts +551 -0
  281. package/src/prove/zenon/index-table.ts +350 -0
  282. package/src/prove/zenon/isar-case.ts +513 -0
  283. package/src/prove/zenon/isar.ts +1249 -0
  284. package/src/prove/zenon/limits.ts +15 -0
  285. package/src/prove/zenon/llproof.ts +173 -0
  286. package/src/prove/zenon/mltoll.ts +1566 -0
  287. package/src/prove/zenon/node.ts +297 -0
  288. package/src/prove/zenon/ocaml.ts +169 -0
  289. package/src/prove/zenon/parse.ts +247 -0
  290. package/src/prove/zenon/phrase.ts +191 -0
  291. package/src/prove/zenon/proof.ts +198 -0
  292. package/src/prove/zenon/propositional-rules.ts +387 -0
  293. package/src/prove/zenon/rules.ts +94 -0
  294. package/src/prove/zenon/search.ts +288 -0
  295. package/src/prove/zenon/tla/functions.ts +151 -0
  296. package/src/prove/zenon/tla/llproof.ts +480 -0
  297. package/src/prove/zenon/tla/records.ts +225 -0
  298. package/src/prove/zenon/tla/rewrites.ts +447 -0
  299. package/src/prove/zenon/tla/sets.ts +304 -0
  300. package/src/prove/zenon/tla/terms.ts +181 -0
  301. package/src/prove/zenon/tla/tla.ts +506 -0
  302. package/src/run-cli.ts +73 -20
  303. package/src/standard-modules.ts +5 -2
  304. package/src/successors.ts +24 -5
  305. package/src/tlc-random.ts +55 -32
  306. package/src/tlc-version.ts +8 -7
  307. package/src/values.ts +85 -41
  308. package/src/worker.ts +65 -0
  309. package/dist/parallel.cjs +0 -12
  310. package/dist/parallel.js +0 -12
  311. /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
@@ -0,0 +1,389 @@
1
+ // Ported from Isabelle2025's Provers/classical.ML. Copyright (c) 1986-2025 University of
2
+ // Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
3
+ //
4
+ // The classical reasoner: rule sets of safe and unsafe introduction and elimination rules, and
5
+ // the tactics that search with them. The rules Isabelle/TLA+ declares come with the logic; a
6
+ // method adds more with intro: and dest:.
7
+
8
+ import { TlaIsabelleError } from "../../../errors";
9
+ import { revcutRl, thinRl, zeroVarIndexes, makeElim } from "../pure/drule";
10
+ import { selectGoal } from "../pure/goal";
11
+ import { aconv, sizeOfTerm } from "../pure/term";
12
+ import { stripAssumsConcl, stripAssumsHyp } from "../pure/logic";
13
+ import { listOfSeq, seqHead } from "../pure/seq";
14
+ import { trade } from "../pure/variable";
15
+ import { atomizePremsTac } from "../pure/object-logic";
16
+ import { bestFirst } from "../pure/search";
17
+ import {
18
+ allGoals,
19
+ allTac,
20
+ appendGoal,
21
+ condTac,
22
+ firstGoal,
23
+ firstGoalTac,
24
+ hasFewerPrems,
25
+ noTac,
26
+ orElse,
27
+ orElseGoal,
28
+ repeatDeterm,
29
+ repeatDeterm1,
30
+ subgoal,
31
+ thenGoal,
32
+ thenTac,
33
+ type GoalTactic,
34
+ type Tactic,
35
+ } from "../pure/tactical";
36
+ import type { Limits } from "../pure/interrupt";
37
+ import {
38
+ assumeTac,
39
+ biresolutionFromNetsTac,
40
+ biresolveFromNetsTac,
41
+ bimatchFromNetsTac,
42
+ eqAssumeTac,
43
+ ematchTac,
44
+ eresolveTac,
45
+ insertTaggedBrl,
46
+ orderTagged,
47
+ subgoalsOfBrl,
48
+ type NetPair,
49
+ type TaggedRule,
50
+ } from "../pure/tactic";
51
+ import { assumption, biresolution, nprems, premsOf, rs, rsn, type Thm } from "../pure/thm";
52
+
53
+ // A rule as the user gave it, as the nets use it, and as the complete search duplicates it, each
54
+ // with its swapped forms for negated assumptions.
55
+ export interface ClassicalRule {
56
+ readonly rule: Thm;
57
+ readonly internal: Thm;
58
+ readonly swapped: readonly Thm[];
59
+ readonly dup: Thm;
60
+ readonly dupSwapped: readonly Thm[];
61
+ }
62
+
63
+ export interface Wrapper {
64
+ readonly name: string;
65
+ readonly wrap: (tactic: GoalTactic) => GoalTactic;
66
+ }
67
+
68
+ export interface Claset {
69
+ // Newest first, as Item_Net.content lists them.
70
+ readonly safeIs: readonly ClassicalRule[];
71
+ readonly safeEs: readonly ClassicalRule[];
72
+ readonly unsafeIs: readonly ClassicalRule[];
73
+ readonly unsafeEs: readonly ClassicalRule[];
74
+ readonly swrappers: readonly Wrapper[];
75
+ readonly uwrappers: readonly Wrapper[];
76
+ readonly safe0: NetPair<TaggedRule>;
77
+ readonly safep: NetPair<TaggedRule>;
78
+ readonly unsafe: NetPair<TaggedRule>;
79
+ readonly dup: NetPair<TaggedRule>;
80
+ }
81
+
82
+ // CLASSICAL_DATA: the object logic's rules for the classical reasoner.
83
+ export interface ClassicalData {
84
+ // P --> Q ==> (~ R ==> P) ==> (Q ==> R) ==> R
85
+ readonly impElim: Thm;
86
+ // ~P ==> P ==> R
87
+ readonly notElim: Thm;
88
+ // ~ P ==> (~ R ==> P) ==> R
89
+ readonly swap: Thm;
90
+ // (~ P ==> P) ==> P
91
+ readonly classical: Thm;
92
+ // The object logic's Trueprop, which Object_Logic.elim_concl looks through.
93
+ readonly judgment: string;
94
+ readonly hypSubstTacs: readonly ((limits: Limits) => GoalTactic)[];
95
+ }
96
+
97
+ export interface ClassicalContext {
98
+ readonly limits: Limits;
99
+ readonly claset: Claset;
100
+ readonly data: ClassicalData;
101
+ }
102
+
103
+ export const withClaset = (context: ClassicalContext, claset: Claset): ClassicalContext => ({
104
+ ...context,
105
+ claset,
106
+ });
107
+
108
+ // classical_rule: strengthens an elimination rule whose conclusion is a variable, so that the
109
+ // negated conclusion becomes available to every case.
110
+ const classicalRule = (data: ClassicalData, rule: Thm, limits: Limits): Thm => {
111
+ const concl = premsOf(rule).length === 0 ? rule.prop : stripAssumsConcl(rule.prop);
112
+ const body =
113
+ concl.kind === "App" && concl.fun.kind === "Const" && concl.fun.name === data.judgment
114
+ ? concl.arg
115
+ : concl;
116
+ const isElim =
117
+ body.kind === "Var" && premsOf(rule).some((premise) => aconv(concl, stripAssumsConcl(premise)));
118
+ if (!isElim) return rule;
119
+ const strengthened = rs(rule, data.classical);
120
+ const strengthenedConcl = stripAssumsConcl(strengthened.prop);
121
+ const isRedundant = (goal: ReturnType<typeof premsOf>[number]) => {
122
+ if (aconv(strengthenedConcl, stripAssumsConcl(goal))) return true;
123
+ const hyps = stripAssumsHyp(goal);
124
+ return hyps.length > 0 && hyps.slice(1).some((hyp) => aconv(hyp, hyps[0]));
125
+ };
126
+ const thinned = seqHead(
127
+ allGoals(
128
+ subgoal((goal, index) =>
129
+ index === 1 || isRedundant(goal) ? eresolveTac(limits, [thinRl])(index) : allTac,
130
+ ),
131
+ )(strengthened),
132
+ );
133
+ if (thinned === undefined) throw new TlaIsabelleError("THM", "classical_rule");
134
+ const result = zeroVarIndexes(thinned);
135
+ return aconv(result.prop, rule.prop) ? rule : result;
136
+ };
137
+
138
+ // swapify: the rules that eliminate ~A from the rules that introduce A.
139
+ const swapify = (data: ClassicalData, rules: readonly Thm[]) =>
140
+ rules.flatMap((rule) =>
141
+ listOfSeq(biresolution(undefined, false, [{ isElim: false, rule }], 2, data.swap)),
142
+ );
143
+
144
+ const dupIntr = (data: ClassicalData, rule: Thm) => zeroVarIndexes(rs(rule, data.classical));
145
+
146
+ // Drule.rule_by_tactic: runs the tactic on the rule with its variables fixed.
147
+ // Tactic.rule_by_tactic
148
+ const ruleByTactic = (tactic: Tactic, rule: Thm): Thm =>
149
+ zeroVarIndexes(
150
+ trade((fixed) => {
151
+ const result = seqHead(tactic(fixed));
152
+ if (result === undefined) throw new TlaIsabelleError("THM", "rule_by_tactic");
153
+ return [result];
154
+ }, rule)[0],
155
+ );
156
+
157
+ const dupElim = (limits: Limits, rule: Thm) => {
158
+ const duplicated = seqHead(assumption(undefined, 2, rsn(rule, 2, revcutRl)));
159
+ if (duplicated === undefined) throw new TlaIsabelleError("THM", "dup_elim");
160
+ return ruleByTactic(
161
+ allGoals((index) => orElse(eresolveTac(limits, [revcutRl])(index), allTac)),
162
+ duplicated,
163
+ );
164
+ };
165
+
166
+ // tag_brls: rules with fewer subgoals first, then the rules added last.
167
+ const tagRules = (start: number, rules: readonly { isElim: boolean; rule: Thm }[]): TaggedRule[] =>
168
+ rules.map((brule, index) => ({ tag: 1000000 * subgoalsOfBrl(brule) + start + index, ...brule }));
169
+
170
+ const insertRules = (
171
+ counts: readonly [number, number],
172
+ intros: readonly Thm[],
173
+ elims: readonly Thm[],
174
+ netpair: NetPair<TaggedRule>,
175
+ ) =>
176
+ tagRules(-(2 * counts[0] + counts[1]), [
177
+ ...elims.map((rule) => ({ isElim: true, rule })),
178
+ ...intros.map((rule) => ({ isElim: false, rule })),
179
+ ]).reduceRight((result, tagged) => insertTaggedBrl(tagged, result), netpair);
180
+
181
+ const isMember = (rules: readonly ClassicalRule[], rule: ClassicalRule) =>
182
+ rules.some((other) => aconv(other.rule.prop, rule.rule.prop));
183
+
184
+ // addI: an unsafe introduction rule, which intro: declares.
185
+ export const addUnsafeIntro = (context: ClassicalContext, rule: Thm): Claset => {
186
+ const claset = context.claset;
187
+ if (
188
+ premsOf(rule).some(
189
+ (premise) =>
190
+ premise.kind === "App" &&
191
+ premise.fun.kind === "Const" &&
192
+ premise.fun.name.startsWith("Pure."),
193
+ )
194
+ )
195
+ throw new TlaIsabelleError("ERROR", "Rules with meta-level premises are not supported");
196
+ const dup = dupIntr(context.data, rule);
197
+ const entry: ClassicalRule = {
198
+ rule,
199
+ internal: rule,
200
+ swapped: swapify(context.data, [rule]),
201
+ dup,
202
+ dupSwapped: swapify(context.data, [dup]),
203
+ };
204
+ if (isMember(claset.unsafeIs, entry)) return claset;
205
+ const counts = [claset.unsafeIs.length + 1, claset.unsafeEs.length] as const;
206
+ return {
207
+ ...claset,
208
+ unsafeIs: [entry, ...claset.unsafeIs],
209
+ unsafe: insertRules(counts, [entry.internal], entry.swapped, claset.unsafe),
210
+ dup: insertRules(counts, [entry.dup], entry.dupSwapped, claset.dup),
211
+ };
212
+ };
213
+
214
+ // addE: an unsafe elimination rule.
215
+ const addUnsafeElim = (context: ClassicalContext, rule: Thm): Claset => {
216
+ const claset = context.claset;
217
+ if (nprems(rule) < 1) throw new TlaIsabelleError("ERROR", "Ill-formed elimination rule");
218
+ const internal = classicalRule(context.data, rule, context.limits);
219
+ const entry: ClassicalRule = {
220
+ rule,
221
+ internal,
222
+ swapped: [],
223
+ dup: dupElim(context.limits, internal),
224
+ dupSwapped: [],
225
+ };
226
+ if (isMember(claset.unsafeEs, entry)) return claset;
227
+ const counts = [claset.unsafeIs.length, claset.unsafeEs.length + 1] as const;
228
+ return {
229
+ ...claset,
230
+ unsafeEs: [entry, ...claset.unsafeEs],
231
+ unsafe: insertRules(counts, [], [entry.internal], claset.unsafe),
232
+ dup: insertRules(counts, [], [entry.dup], claset.dup),
233
+ };
234
+ };
235
+
236
+ // addD: an unsafe destruction rule, which dest: declares.
237
+ export const addUnsafeDest = (context: ClassicalContext, rule: Thm): Claset => {
238
+ if (nprems(rule) < 1) throw new TlaIsabelleError("ERROR", "Ill-formed destruction rule");
239
+ return addUnsafeElim(context, makeElim(rule));
240
+ };
241
+
242
+ // AList.update: replaces a wrapper of the same name in place, or adds it in front.
243
+ const updateWrappers = (wrappers: readonly Wrapper[], wrapper: Wrapper) =>
244
+ wrappers.some((other) => other.name === wrapper.name)
245
+ ? wrappers.map((other) => (other.name === wrapper.name ? wrapper : other))
246
+ : [wrapper, ...wrappers];
247
+
248
+ // addSafter: a safe tactic to try after safe_step_tac fails.
249
+ export const addSafter = (claset: Claset, name: string, tactic: GoalTactic): Claset => ({
250
+ ...claset,
251
+ swrappers: updateWrappers(claset.swrappers, { name, wrap: (inner) => orElseGoal(inner, tactic) }),
252
+ });
253
+
254
+ // addbefore: a tactic to try before the unsafe step tactic, with backtracking.
255
+ export const addbefore = (claset: Claset, name: string, tactic: GoalTactic): Claset => ({
256
+ ...claset,
257
+ uwrappers: updateWrappers(claset.uwrappers, { name, wrap: (inner) => appendGoal(tactic, inner) }),
258
+ });
259
+
260
+ const appSWrappers = (context: ClassicalContext, tactic: GoalTactic) =>
261
+ context.claset.swrappers.reduce((result, wrapper) => wrapper.wrap(result), tactic);
262
+
263
+ export const appWrappers = (context: ClassicalContext, tactic: GoalTactic) =>
264
+ context.claset.uwrappers.reduce((result, wrapper) => wrapper.wrap(result), tactic);
265
+
266
+ // contr_tac: solves a goal that assumes both P and ~P.
267
+ export const contrTac = (context: ClassicalContext): GoalTactic =>
268
+ thenGoal(
269
+ eresolveTac(context.limits, [context.data.notElim]),
270
+ orElseGoal(eqAssumeTac, assumeTac(context.limits)),
271
+ );
272
+
273
+ // eq_mp_tac: from P --> Q and P, keeps Q, without instantiating variables.
274
+ const eqMpTac =
275
+ (context: ClassicalContext): GoalTactic =>
276
+ (index) =>
277
+ thenTac(
278
+ ematchTac(context.limits, [context.data.notElim, context.data.impElim])(index),
279
+ eqAssumeTac(index),
280
+ );
281
+
282
+ // safe_step_tac: one safe inference, by matching rather than unification.
283
+ export const safeStepTac = (context: ClassicalContext): GoalTactic =>
284
+ appSWrappers(
285
+ context,
286
+ firstGoal([
287
+ eqAssumeTac,
288
+ eqMpTac(context),
289
+ bimatchFromNetsTac(context.limits, context.claset.safe0),
290
+ firstGoal(context.data.hypSubstTacs.map((tactic) => tactic(context.limits))),
291
+ bimatchFromNetsTac(context.limits, context.claset.safep),
292
+ ]),
293
+ );
294
+
295
+ // safe_steps_tac: safe inferences on goal index for as long as they apply.
296
+ export const safeStepsTac =
297
+ (context: ClassicalContext): GoalTactic =>
298
+ (index) =>
299
+ repeatDeterm1(
300
+ condTac(hasFewerPrems(index), noTac, (state) => safeStepTac(context)(index)(state)),
301
+ );
302
+
303
+ // safe_tac: safe inferences on all goals for as long as they apply.
304
+ export const safeTac = (context: ClassicalContext): Tactic =>
305
+ repeatDeterm1(firstGoalTac(safeStepsTac(context)));
306
+
307
+ const nBimatchFromNetsTac = (
308
+ context: ClassicalContext,
309
+ count: number,
310
+ netpair: NetPair<TaggedRule>,
311
+ ) =>
312
+ biresolutionFromNetsTac(
313
+ context.limits,
314
+ (rules: TaggedRule[]) => orderTagged(rules.filter((rule) => subgoalsOfBrl(rule) === count)),
315
+ true,
316
+ netpair,
317
+ );
318
+
319
+ const eqContrTac =
320
+ (context: ClassicalContext): GoalTactic =>
321
+ (index) =>
322
+ thenTac(ematchTac(context.limits, [context.data.notElim])(index), eqAssumeTac(index));
323
+
324
+ const eqAssumeContrTac = (context: ClassicalContext) =>
325
+ orElseGoal(eqAssumeTac, eqContrTac(context));
326
+
327
+ // bimatch2_tac: two-way branching only where one branch closes at once.
328
+ const bimatch2Tac =
329
+ (context: ClassicalContext, netpair: NetPair<TaggedRule>): GoalTactic =>
330
+ (index) =>
331
+ thenTac(
332
+ nBimatchFromNetsTac(context, 2, netpair)(index),
333
+ orElse(eqAssumeContrTac(context)(index), eqAssumeContrTac(context)(index + 1)),
334
+ );
335
+
336
+ const clarifyStepTac = (context: ClassicalContext): GoalTactic =>
337
+ appSWrappers(
338
+ context,
339
+ firstGoal([
340
+ eqAssumeContrTac(context),
341
+ bimatchFromNetsTac(context.limits, context.claset.safe0),
342
+ firstGoal(context.data.hypSubstTacs.map((tactic) => tactic(context.limits))),
343
+ nBimatchFromNetsTac(context, 1, context.claset.safep),
344
+ bimatch2Tac(context, context.claset.safep),
345
+ ]),
346
+ );
347
+
348
+ // clarify_tac: safe steps that do not split the goal.
349
+ export const clarifyTac = (context: ClassicalContext): GoalTactic =>
350
+ selectGoal(repeatDeterm(clarifyStepTac(context)(1)));
351
+
352
+ export const inst0StepTac = (context: ClassicalContext): GoalTactic =>
353
+ appendGoal(
354
+ assumeTac(context.limits),
355
+ appendGoal(contrTac(context), biresolveFromNetsTac(context.limits, context.claset.safe0)),
356
+ );
357
+
358
+ export const instpStepTac = (context: ClassicalContext): GoalTactic =>
359
+ biresolveFromNetsTac(context.limits, context.claset.safep);
360
+
361
+ const instStepTac = (context: ClassicalContext): GoalTactic =>
362
+ appendGoal(inst0StepTac(context), instpStepTac(context));
363
+
364
+ export const unsafeStepTac = (context: ClassicalContext): GoalTactic =>
365
+ biresolveFromNetsTac(context.limits, context.claset.unsafe);
366
+
367
+ // step_tac: a safe step, or else an unsafe one.
368
+ export const stepTac =
369
+ (context: ClassicalContext): GoalTactic =>
370
+ (index) =>
371
+ orElse(
372
+ safeTac(context),
373
+ appWrappers(context, orElseGoal(instStepTac(context), unsafeStepTac(context)))(index),
374
+ );
375
+
376
+ // Drule.size_of_thm, the sizef of Isabelle/TLA+'s Classical: the size of the proposition with its
377
+ // flex-flex pairs.
378
+ const sizeOfThm = (thm: Thm) =>
379
+ thm.tpairs.reduce(
380
+ (size, pair) => size + 2 + sizeOfTerm(pair[0]) + sizeOfTerm(pair[1]),
381
+ sizeOfTerm(thm.prop),
382
+ );
383
+
384
+ // first_best_tac: best-first search with step_tac on the first goal.
385
+ export const firstBestTac = (context: ClassicalContext, atomizeRules: readonly Thm[]): GoalTactic =>
386
+ thenGoal(
387
+ atomizePremsTac(context.limits, atomizeRules),
388
+ selectGoal(bestFirst(hasFewerPrems(1), sizeOfThm, firstGoalTac(stepTac(context)))),
389
+ );