@stevenvo780/st-lang 4.2.0 → 4.4.0
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.
- package/dist/index.d.ts +8 -0
- package/dist/index.d.ts.map +1 -1
- package/dist/index.js +70 -1
- package/dist/index.js.map +1 -1
- package/dist/lambda-calc/church.d.ts +8 -0
- package/dist/lambda-calc/church.d.ts.map +1 -0
- package/dist/lambda-calc/church.js +67 -0
- package/dist/lambda-calc/church.js.map +1 -0
- package/dist/lambda-calc/combinators.d.ts +8 -0
- package/dist/lambda-calc/combinators.d.ts.map +1 -0
- package/dist/lambda-calc/combinators.js +24 -0
- package/dist/lambda-calc/combinators.js.map +1 -0
- package/dist/lambda-calc/index.d.ts +8 -0
- package/dist/lambda-calc/index.d.ts.map +1 -0
- package/dist/lambda-calc/index.js +48 -0
- package/dist/lambda-calc/index.js.map +1 -0
- package/dist/lambda-calc/reduce.d.ts +18 -0
- package/dist/lambda-calc/reduce.d.ts.map +1 -0
- package/dist/lambda-calc/reduce.js +174 -0
- package/dist/lambda-calc/reduce.js.map +1 -0
- package/dist/lambda-calc/substitution.d.ts +6 -0
- package/dist/lambda-calc/substitution.d.ts.map +1 -0
- package/dist/lambda-calc/substitution.js +120 -0
- package/dist/lambda-calc/substitution.js.map +1 -0
- package/dist/lambda-calc/types.d.ts +19 -0
- package/dist/lambda-calc/types.d.ts.map +1 -0
- package/dist/lambda-calc/types.js +72 -0
- package/dist/lambda-calc/types.js.map +1 -0
- package/dist/mltt/equality.d.ts +9 -0
- package/dist/mltt/equality.d.ts.map +1 -0
- package/dist/mltt/equality.js +79 -0
- package/dist/mltt/equality.js.map +1 -0
- package/dist/mltt/index.d.ts +8 -0
- package/dist/mltt/index.d.ts.map +1 -0
- package/dist/mltt/index.js +49 -0
- package/dist/mltt/index.js.map +1 -0
- package/dist/mltt/infer.d.ts +17 -0
- package/dist/mltt/infer.d.ts.map +1 -0
- package/dist/mltt/infer.js +269 -0
- package/dist/mltt/infer.js.map +1 -0
- package/dist/mltt/normalize.d.ts +7 -0
- package/dist/mltt/normalize.d.ts.map +1 -0
- package/dist/mltt/normalize.js +131 -0
- package/dist/mltt/normalize.js.map +1 -0
- package/dist/mltt/substitute.d.ts +4 -0
- package/dist/mltt/substitute.d.ts.map +1 -0
- package/dist/mltt/substitute.js +94 -0
- package/dist/mltt/substitute.js.map +1 -0
- package/dist/mltt/types.d.ts +72 -0
- package/dist/mltt/types.d.ts.map +1 -0
- package/dist/mltt/types.js +211 -0
- package/dist/mltt/types.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/formula.d.ts +19 -0
- package/dist/profiles/intuitionistic-nj/formula.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/formula.js +99 -0
- package/dist/profiles/intuitionistic-nj/formula.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/index.d.ts +5 -0
- package/dist/profiles/intuitionistic-nj/index.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/index.js +24 -0
- package/dist/profiles/intuitionistic-nj/index.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/kripke.d.ts +17 -0
- package/dist/profiles/intuitionistic-nj/kripke.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/kripke.js +206 -0
- package/dist/profiles/intuitionistic-nj/kripke.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/prover.d.ts +13 -0
- package/dist/profiles/intuitionistic-nj/prover.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/prover.js +418 -0
- package/dist/profiles/intuitionistic-nj/prover.js.map +1 -0
- package/dist/profiles/intuitionistic-nj/types.d.ts +55 -0
- package/dist/profiles/intuitionistic-nj/types.d.ts.map +1 -0
- package/dist/profiles/intuitionistic-nj/types.js +21 -0
- package/dist/profiles/intuitionistic-nj/types.js.map +1 -0
- package/dist/profiles/many-valued/index.d.ts +39 -0
- package/dist/profiles/many-valued/index.d.ts.map +1 -0
- package/dist/profiles/many-valued/index.js +250 -0
- package/dist/profiles/many-valued/index.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/formula.d.ts +23 -0
- package/dist/profiles/modal-frame-axioms/formula.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/formula.js +158 -0
- package/dist/profiles/modal-frame-axioms/formula.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/index.d.ts +6 -0
- package/dist/profiles/modal-frame-axioms/index.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/index.js +41 -0
- package/dist/profiles/modal-frame-axioms/index.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/systems.d.ts +29 -0
- package/dist/profiles/modal-frame-axioms/systems.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/systems.js +96 -0
- package/dist/profiles/modal-frame-axioms/systems.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/tableau.d.ts +12 -0
- package/dist/profiles/modal-frame-axioms/tableau.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/tableau.js +299 -0
- package/dist/profiles/modal-frame-axioms/tableau.js.map +1 -0
- package/dist/profiles/modal-frame-axioms/types.d.ts +61 -0
- package/dist/profiles/modal-frame-axioms/types.d.ts.map +1 -0
- package/dist/profiles/modal-frame-axioms/types.js +27 -0
- package/dist/profiles/modal-frame-axioms/types.js.map +1 -0
- package/dist/profiles/mu-calculus/check.d.ts +15 -0
- package/dist/profiles/mu-calculus/check.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/check.js +172 -0
- package/dist/profiles/mu-calculus/check.js.map +1 -0
- package/dist/profiles/mu-calculus/ctl-translate.d.ts +61 -0
- package/dist/profiles/mu-calculus/ctl-translate.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/ctl-translate.js +181 -0
- package/dist/profiles/mu-calculus/ctl-translate.js.map +1 -0
- package/dist/profiles/mu-calculus/index.d.ts +7 -0
- package/dist/profiles/mu-calculus/index.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/index.js +33 -0
- package/dist/profiles/mu-calculus/index.js.map +1 -0
- package/dist/profiles/mu-calculus/types.d.ts +51 -0
- package/dist/profiles/mu-calculus/types.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/types.js +42 -0
- package/dist/profiles/mu-calculus/types.js.map +1 -0
- package/dist/profiles/mu-calculus/wellformed.d.ts +40 -0
- package/dist/profiles/mu-calculus/wellformed.d.ts.map +1 -0
- package/dist/profiles/mu-calculus/wellformed.js +160 -0
- package/dist/profiles/mu-calculus/wellformed.js.map +1 -0
- package/dist/profiles/sequent-lk/cut-elimination.d.ts +11 -0
- package/dist/profiles/sequent-lk/cut-elimination.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/cut-elimination.js +216 -0
- package/dist/profiles/sequent-lk/cut-elimination.js.map +1 -0
- package/dist/profiles/sequent-lk/index.d.ts +5 -0
- package/dist/profiles/sequent-lk/index.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/index.js +24 -0
- package/dist/profiles/sequent-lk/index.js.map +1 -0
- package/dist/profiles/sequent-lk/prover.d.ts +25 -0
- package/dist/profiles/sequent-lk/prover.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/prover.js +532 -0
- package/dist/profiles/sequent-lk/prover.js.map +1 -0
- package/dist/profiles/sequent-lk/types.d.ts +55 -0
- package/dist/profiles/sequent-lk/types.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/types.js +18 -0
- package/dist/profiles/sequent-lk/types.js.map +1 -0
- package/dist/profiles/sequent-lk/util.d.ts +18 -0
- package/dist/profiles/sequent-lk/util.d.ts.map +1 -0
- package/dist/profiles/sequent-lk/util.js +71 -0
- package/dist/profiles/sequent-lk/util.js.map +1 -0
- package/dist/profiles/substructural/index.d.ts +4 -0
- package/dist/profiles/substructural/index.d.ts.map +1 -0
- package/dist/profiles/substructural/index.js +22 -0
- package/dist/profiles/substructural/index.js.map +1 -0
- package/dist/profiles/substructural/prover.d.ts +13 -0
- package/dist/profiles/substructural/prover.d.ts.map +1 -0
- package/dist/profiles/substructural/prover.js +481 -0
- package/dist/profiles/substructural/prover.js.map +1 -0
- package/dist/profiles/substructural/types.d.ts +72 -0
- package/dist/profiles/substructural/types.d.ts.map +1 -0
- package/dist/profiles/substructural/types.js +27 -0
- package/dist/profiles/substructural/types.js.map +1 -0
- package/dist/refinement-types/checker.d.ts +19 -0
- package/dist/refinement-types/checker.d.ts.map +1 -0
- package/dist/refinement-types/checker.js +248 -0
- package/dist/refinement-types/checker.js.map +1 -0
- package/dist/refinement-types/index.d.ts +11 -0
- package/dist/refinement-types/index.d.ts.map +1 -0
- package/dist/refinement-types/index.js +51 -0
- package/dist/refinement-types/index.js.map +1 -0
- package/dist/refinement-types/predicate.d.ts +31 -0
- package/dist/refinement-types/predicate.d.ts.map +1 -0
- package/dist/refinement-types/predicate.js +369 -0
- package/dist/refinement-types/predicate.js.map +1 -0
- package/dist/refinement-types/solver.d.ts +24 -0
- package/dist/refinement-types/solver.d.ts.map +1 -0
- package/dist/refinement-types/solver.js +207 -0
- package/dist/refinement-types/solver.js.map +1 -0
- package/dist/refinement-types/subtype.d.ts +14 -0
- package/dist/refinement-types/subtype.d.ts.map +1 -0
- package/dist/refinement-types/subtype.js +39 -0
- package/dist/refinement-types/subtype.js.map +1 -0
- package/dist/refinement-types/types.d.ts +64 -0
- package/dist/refinement-types/types.d.ts.map +1 -0
- package/dist/refinement-types/types.js +130 -0
- package/dist/refinement-types/types.js.map +1 -0
- package/dist/runtime/abduction/entails.d.ts +21 -0
- package/dist/runtime/abduction/entails.d.ts.map +1 -0
- package/dist/runtime/abduction/entails.js +308 -0
- package/dist/runtime/abduction/entails.js.map +1 -0
- package/dist/runtime/abduction/find.d.ts +18 -0
- package/dist/runtime/abduction/find.d.ts.map +1 -0
- package/dist/runtime/abduction/find.js +202 -0
- package/dist/runtime/abduction/find.js.map +1 -0
- package/dist/runtime/abduction/index.d.ts +4 -0
- package/dist/runtime/abduction/index.d.ts.map +1 -0
- package/dist/runtime/abduction/index.js +26 -0
- package/dist/runtime/abduction/index.js.map +1 -0
- package/dist/runtime/abduction/types.d.ts +78 -0
- package/dist/runtime/abduction/types.d.ts.map +1 -0
- package/dist/runtime/abduction/types.js +23 -0
- package/dist/runtime/abduction/types.js.map +1 -0
- package/dist/runtime/anti-unification/anti-unify.d.ts +22 -0
- package/dist/runtime/anti-unification/anti-unify.d.ts.map +1 -0
- package/dist/runtime/anti-unification/anti-unify.js +154 -0
- package/dist/runtime/anti-unification/anti-unify.js.map +1 -0
- package/dist/runtime/anti-unification/index.d.ts +6 -0
- package/dist/runtime/anti-unification/index.d.ts.map +1 -0
- package/dist/runtime/anti-unification/index.js +23 -0
- package/dist/runtime/anti-unification/index.js.map +1 -0
- package/dist/runtime/anti-unification/many.d.ts +49 -0
- package/dist/runtime/anti-unification/many.d.ts.map +1 -0
- package/dist/runtime/anti-unification/many.js +185 -0
- package/dist/runtime/anti-unification/many.js.map +1 -0
- package/dist/runtime/anti-unification/term-utils.d.ts +40 -0
- package/dist/runtime/anti-unification/term-utils.d.ts.map +1 -0
- package/dist/runtime/anti-unification/term-utils.js +173 -0
- package/dist/runtime/anti-unification/term-utils.js.map +1 -0
- package/dist/runtime/anti-unification/types.d.ts +41 -0
- package/dist/runtime/anti-unification/types.d.ts.map +1 -0
- package/dist/runtime/anti-unification/types.js +26 -0
- package/dist/runtime/anti-unification/types.js.map +1 -0
- package/dist/runtime/bayesian/factor.d.ts +22 -0
- package/dist/runtime/bayesian/factor.d.ts.map +1 -0
- package/dist/runtime/bayesian/factor.js +249 -0
- package/dist/runtime/bayesian/factor.js.map +1 -0
- package/dist/runtime/bayesian/index.d.ts +3 -0
- package/dist/runtime/bayesian/index.d.ts.map +1 -0
- package/dist/runtime/bayesian/index.js +25 -0
- package/dist/runtime/bayesian/index.js.map +1 -0
- package/dist/runtime/bayesian/inference.d.ts +6 -0
- package/dist/runtime/bayesian/inference.d.ts.map +1 -0
- package/dist/runtime/bayesian/inference.js +260 -0
- package/dist/runtime/bayesian/inference.js.map +1 -0
- package/dist/runtime/bayesian/types.d.ts +19 -0
- package/dist/runtime/bayesian/types.d.ts.map +1 -0
- package/dist/runtime/bayesian/types.js +9 -0
- package/dist/runtime/bayesian/types.js.map +1 -0
- package/dist/runtime/bisimulation/index.d.ts +4 -0
- package/dist/runtime/bisimulation/index.d.ts.map +1 -0
- package/dist/runtime/bisimulation/index.js +21 -0
- package/dist/runtime/bisimulation/index.js.map +1 -0
- package/dist/runtime/bisimulation/operations.d.ts +40 -0
- package/dist/runtime/bisimulation/operations.d.ts.map +1 -0
- package/dist/runtime/bisimulation/operations.js +219 -0
- package/dist/runtime/bisimulation/operations.js.map +1 -0
- package/dist/runtime/bisimulation/paige-tarjan.d.ts +8 -0
- package/dist/runtime/bisimulation/paige-tarjan.d.ts.map +1 -0
- package/dist/runtime/bisimulation/paige-tarjan.js +199 -0
- package/dist/runtime/bisimulation/paige-tarjan.js.map +1 -0
- package/dist/runtime/bisimulation/types.d.ts +26 -0
- package/dist/runtime/bisimulation/types.d.ts.map +1 -0
- package/dist/runtime/bisimulation/types.js +22 -0
- package/dist/runtime/bisimulation/types.js.map +1 -0
- package/dist/runtime/csp/ac3.d.ts +20 -0
- package/dist/runtime/csp/ac3.d.ts.map +1 -0
- package/dist/runtime/csp/ac3.js +165 -0
- package/dist/runtime/csp/ac3.js.map +1 -0
- package/dist/runtime/csp/backtrack.d.ts +15 -0
- package/dist/runtime/csp/backtrack.d.ts.map +1 -0
- package/dist/runtime/csp/backtrack.js +233 -0
- package/dist/runtime/csp/backtrack.js.map +1 -0
- package/dist/runtime/csp/builtins.d.ts +27 -0
- package/dist/runtime/csp/builtins.d.ts.map +1 -0
- package/dist/runtime/csp/builtins.js +109 -0
- package/dist/runtime/csp/builtins.js.map +1 -0
- package/dist/runtime/csp/index.d.ts +5 -0
- package/dist/runtime/csp/index.d.ts.map +1 -0
- package/dist/runtime/csp/index.js +23 -0
- package/dist/runtime/csp/index.js.map +1 -0
- package/dist/runtime/csp/types.d.ts +54 -0
- package/dist/runtime/csp/types.d.ts.map +1 -0
- package/dist/runtime/csp/types.js +14 -0
- package/dist/runtime/csp/types.js.map +1 -0
- package/dist/runtime/fca/context.d.ts +46 -0
- package/dist/runtime/fca/context.d.ts.map +1 -0
- package/dist/runtime/fca/context.js +155 -0
- package/dist/runtime/fca/context.js.map +1 -0
- package/dist/runtime/fca/implications.d.ts +10 -0
- package/dist/runtime/fca/implications.d.ts.map +1 -0
- package/dist/runtime/fca/implications.js +33 -0
- package/dist/runtime/fca/implications.js.map +1 -0
- package/dist/runtime/fca/index.d.ts +6 -0
- package/dist/runtime/fca/index.d.ts.map +1 -0
- package/dist/runtime/fca/index.js +39 -0
- package/dist/runtime/fca/index.js.map +1 -0
- package/dist/runtime/fca/lattice.d.ts +10 -0
- package/dist/runtime/fca/lattice.d.ts.map +1 -0
- package/dist/runtime/fca/lattice.js +86 -0
- package/dist/runtime/fca/lattice.js.map +1 -0
- package/dist/runtime/fca/next-closure.d.ts +12 -0
- package/dist/runtime/fca/next-closure.d.ts.map +1 -0
- package/dist/runtime/fca/next-closure.js +99 -0
- package/dist/runtime/fca/next-closure.js.map +1 -0
- package/dist/runtime/fca/types.d.ts +31 -0
- package/dist/runtime/fca/types.d.ts.map +1 -0
- package/dist/runtime/fca/types.js +30 -0
- package/dist/runtime/fca/types.js.map +1 -0
- package/dist/runtime/markov-logic/grounding.d.ts +19 -0
- package/dist/runtime/markov-logic/grounding.d.ts.map +1 -0
- package/dist/runtime/markov-logic/grounding.js +252 -0
- package/dist/runtime/markov-logic/grounding.js.map +1 -0
- package/dist/runtime/markov-logic/index.d.ts +6 -0
- package/dist/runtime/markov-logic/index.d.ts.map +1 -0
- package/dist/runtime/markov-logic/index.js +47 -0
- package/dist/runtime/markov-logic/index.js.map +1 -0
- package/dist/runtime/markov-logic/inference.d.ts +77 -0
- package/dist/runtime/markov-logic/inference.d.ts.map +1 -0
- package/dist/runtime/markov-logic/inference.js +382 -0
- package/dist/runtime/markov-logic/inference.js.map +1 -0
- package/dist/runtime/markov-logic/parser.d.ts +25 -0
- package/dist/runtime/markov-logic/parser.d.ts.map +1 -0
- package/dist/runtime/markov-logic/parser.js +264 -0
- package/dist/runtime/markov-logic/parser.js.map +1 -0
- package/dist/runtime/markov-logic/types.d.ts +64 -0
- package/dist/runtime/markov-logic/types.d.ts.map +1 -0
- package/dist/runtime/markov-logic/types.js +17 -0
- package/dist/runtime/markov-logic/types.js.map +1 -0
- package/dist/runtime/pi-calculus/congruence.d.ts +15 -0
- package/dist/runtime/pi-calculus/congruence.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/congruence.js +271 -0
- package/dist/runtime/pi-calculus/congruence.js.map +1 -0
- package/dist/runtime/pi-calculus/index.d.ts +6 -0
- package/dist/runtime/pi-calculus/index.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/index.js +30 -0
- package/dist/runtime/pi-calculus/index.js.map +1 -0
- package/dist/runtime/pi-calculus/names.d.ts +28 -0
- package/dist/runtime/pi-calculus/names.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/names.js +182 -0
- package/dist/runtime/pi-calculus/names.js.map +1 -0
- package/dist/runtime/pi-calculus/reduction.d.ts +25 -0
- package/dist/runtime/pi-calculus/reduction.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/reduction.js +338 -0
- package/dist/runtime/pi-calculus/reduction.js.map +1 -0
- package/dist/runtime/pi-calculus/substitution.d.ts +11 -0
- package/dist/runtime/pi-calculus/substitution.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/substitution.js +109 -0
- package/dist/runtime/pi-calculus/substitution.js.map +1 -0
- package/dist/runtime/pi-calculus/types.d.ts +38 -0
- package/dist/runtime/pi-calculus/types.d.ts.map +1 -0
- package/dist/runtime/pi-calculus/types.js +22 -0
- package/dist/runtime/pi-calculus/types.js.map +1 -0
- package/dist/runtime/planning/astar.d.ts +10 -0
- package/dist/runtime/planning/astar.d.ts.map +1 -0
- package/dist/runtime/planning/astar.js +155 -0
- package/dist/runtime/planning/astar.js.map +1 -0
- package/dist/runtime/planning/bfs.d.ts +17 -0
- package/dist/runtime/planning/bfs.d.ts.map +1 -0
- package/dist/runtime/planning/bfs.js +87 -0
- package/dist/runtime/planning/bfs.js.map +1 -0
- package/dist/runtime/planning/ground.d.ts +55 -0
- package/dist/runtime/planning/ground.d.ts.map +1 -0
- package/dist/runtime/planning/ground.js +154 -0
- package/dist/runtime/planning/ground.js.map +1 -0
- package/dist/runtime/planning/heuristic.d.ts +29 -0
- package/dist/runtime/planning/heuristic.d.ts.map +1 -0
- package/dist/runtime/planning/heuristic.js +172 -0
- package/dist/runtime/planning/heuristic.js.map +1 -0
- package/dist/runtime/planning/index.d.ts +6 -0
- package/dist/runtime/planning/index.d.ts.map +1 -0
- package/dist/runtime/planning/index.js +38 -0
- package/dist/runtime/planning/index.js.map +1 -0
- package/dist/runtime/planning/types.d.ts +100 -0
- package/dist/runtime/planning/types.d.ts.map +1 -0
- package/dist/runtime/planning/types.js +22 -0
- package/dist/runtime/planning/types.js.map +1 -0
- package/dist/runtime/proof-minify/index.d.ts +3 -0
- package/dist/runtime/proof-minify/index.d.ts.map +1 -0
- package/dist/runtime/proof-minify/index.js +13 -0
- package/dist/runtime/proof-minify/index.js.map +1 -0
- package/dist/runtime/proof-minify/minify.d.ts +13 -0
- package/dist/runtime/proof-minify/minify.d.ts.map +1 -0
- package/dist/runtime/proof-minify/minify.js +540 -0
- package/dist/runtime/proof-minify/minify.js.map +1 -0
- package/dist/runtime/proof-minify/types.d.ts +89 -0
- package/dist/runtime/proof-minify/types.d.ts.map +1 -0
- package/dist/runtime/proof-minify/types.js +16 -0
- package/dist/runtime/proof-minify/types.js.map +1 -0
- package/dist/runtime/symbolic-diff/constructors.d.ts +16 -0
- package/dist/runtime/symbolic-diff/constructors.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/constructors.js +75 -0
- package/dist/runtime/symbolic-diff/constructors.js.map +1 -0
- package/dist/runtime/symbolic-diff/differentiate.d.ts +22 -0
- package/dist/runtime/symbolic-diff/differentiate.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/differentiate.js +107 -0
- package/dist/runtime/symbolic-diff/differentiate.js.map +1 -0
- package/dist/runtime/symbolic-diff/evaluate.d.ts +3 -0
- package/dist/runtime/symbolic-diff/evaluate.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/evaluate.js +47 -0
- package/dist/runtime/symbolic-diff/evaluate.js.map +1 -0
- package/dist/runtime/symbolic-diff/index.d.ts +9 -0
- package/dist/runtime/symbolic-diff/index.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/index.js +34 -0
- package/dist/runtime/symbolic-diff/index.js.map +1 -0
- package/dist/runtime/symbolic-diff/parse.d.ts +16 -0
- package/dist/runtime/symbolic-diff/parse.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/parse.js +212 -0
- package/dist/runtime/symbolic-diff/parse.js.map +1 -0
- package/dist/runtime/symbolic-diff/simplify.d.ts +11 -0
- package/dist/runtime/symbolic-diff/simplify.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/simplify.js +214 -0
- package/dist/runtime/symbolic-diff/simplify.js.map +1 -0
- package/dist/runtime/symbolic-diff/stringify.d.ts +3 -0
- package/dist/runtime/symbolic-diff/stringify.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/stringify.js +69 -0
- package/dist/runtime/symbolic-diff/stringify.js.map +1 -0
- package/dist/runtime/symbolic-diff/types.d.ts +35 -0
- package/dist/runtime/symbolic-diff/types.d.ts.map +1 -0
- package/dist/runtime/symbolic-diff/types.js +9 -0
- package/dist/runtime/symbolic-diff/types.js.map +1 -0
- package/dist/runtime/term-rewriting/critical-pairs.d.ts +38 -0
- package/dist/runtime/term-rewriting/critical-pairs.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/critical-pairs.js +109 -0
- package/dist/runtime/term-rewriting/critical-pairs.js.map +1 -0
- package/dist/runtime/term-rewriting/index.d.ts +9 -0
- package/dist/runtime/term-rewriting/index.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/index.js +38 -0
- package/dist/runtime/term-rewriting/index.js.map +1 -0
- package/dist/runtime/term-rewriting/knuth-bendix.d.ts +29 -0
- package/dist/runtime/term-rewriting/knuth-bendix.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/knuth-bendix.js +196 -0
- package/dist/runtime/term-rewriting/knuth-bendix.js.map +1 -0
- package/dist/runtime/term-rewriting/lpo.d.ts +17 -0
- package/dist/runtime/term-rewriting/lpo.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/lpo.js +158 -0
- package/dist/runtime/term-rewriting/lpo.js.map +1 -0
- package/dist/runtime/term-rewriting/rewrite.d.ts +44 -0
- package/dist/runtime/term-rewriting/rewrite.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/rewrite.js +189 -0
- package/dist/runtime/term-rewriting/rewrite.js.map +1 -0
- package/dist/runtime/term-rewriting/term-utils.d.ts +64 -0
- package/dist/runtime/term-rewriting/term-utils.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/term-utils.js +360 -0
- package/dist/runtime/term-rewriting/term-utils.js.map +1 -0
- package/dist/runtime/term-rewriting/types.d.ts +66 -0
- package/dist/runtime/term-rewriting/types.d.ts.map +1 -0
- package/dist/runtime/term-rewriting/types.js +21 -0
- package/dist/runtime/term-rewriting/types.js.map +1 -0
- package/dist/runtime/theorem-cache/cache.d.ts +100 -0
- package/dist/runtime/theorem-cache/cache.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/cache.js +213 -0
- package/dist/runtime/theorem-cache/cache.js.map +1 -0
- package/dist/runtime/theorem-cache/canonical.d.ts +59 -0
- package/dist/runtime/theorem-cache/canonical.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/canonical.js +105 -0
- package/dist/runtime/theorem-cache/canonical.js.map +1 -0
- package/dist/runtime/theorem-cache/index.d.ts +6 -0
- package/dist/runtime/theorem-cache/index.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/index.js +16 -0
- package/dist/runtime/theorem-cache/index.js.map +1 -0
- package/dist/runtime/theorem-cache/pattern.d.ts +24 -0
- package/dist/runtime/theorem-cache/pattern.d.ts.map +1 -0
- package/dist/runtime/theorem-cache/pattern.js +80 -0
- package/dist/runtime/theorem-cache/pattern.js.map +1 -0
- package/dist/system-f/index.d.ts +7 -0
- package/dist/system-f/index.d.ts.map +1 -0
- package/dist/system-f/index.js +48 -0
- package/dist/system-f/index.js.map +1 -0
- package/dist/system-f/infer.d.ts +9 -0
- package/dist/system-f/infer.d.ts.map +1 -0
- package/dist/system-f/infer.js +94 -0
- package/dist/system-f/infer.js.map +1 -0
- package/dist/system-f/reduce.d.ts +15 -0
- package/dist/system-f/reduce.d.ts.map +1 -0
- package/dist/system-f/reduce.js +259 -0
- package/dist/system-f/reduce.js.map +1 -0
- package/dist/system-f/types.d.ts +53 -0
- package/dist/system-f/types.d.ts.map +1 -0
- package/dist/system-f/types.js +157 -0
- package/dist/system-f/types.js.map +1 -0
- package/dist/tests/abduction/abduction.test.d.ts +2 -0
- package/dist/tests/abduction/abduction.test.d.ts.map +1 -0
- package/dist/tests/abduction/abduction.test.js +380 -0
- package/dist/tests/abduction/abduction.test.js.map +1 -0
- package/dist/tests/anti-unification/anti-unify.test.d.ts +2 -0
- package/dist/tests/anti-unification/anti-unify.test.d.ts.map +1 -0
- package/dist/tests/anti-unification/anti-unify.test.js +219 -0
- package/dist/tests/anti-unification/anti-unify.test.js.map +1 -0
- package/dist/tests/bayesian/bayesian.test.d.ts +2 -0
- package/dist/tests/bayesian/bayesian.test.d.ts.map +1 -0
- package/dist/tests/bayesian/bayesian.test.js +328 -0
- package/dist/tests/bayesian/bayesian.test.js.map +1 -0
- package/dist/tests/bisimulation/paige-tarjan.test.d.ts +2 -0
- package/dist/tests/bisimulation/paige-tarjan.test.d.ts.map +1 -0
- package/dist/tests/bisimulation/paige-tarjan.test.js +254 -0
- package/dist/tests/bisimulation/paige-tarjan.test.js.map +1 -0
- package/dist/tests/coverage-fill-aristotelian.test.js +1 -1
- package/dist/tests/coverage-fill-aristotelian.test.js.map +1 -1
- package/dist/tests/coverage-fill-fallacies.test.js +1 -1
- package/dist/tests/coverage-fill-fallacies.test.js.map +1 -1
- package/dist/tests/coverage-fill-format.test.js +1 -1
- package/dist/tests/coverage-fill-format.test.js.map +1 -1
- package/dist/tests/coverage-fill-intuitionistic.test.js +1 -1
- package/dist/tests/coverage-fill-intuitionistic.test.js.map +1 -1
- package/dist/tests/coverage-fill-probabilistic.test.js +1 -1
- package/dist/tests/coverage-fill-probabilistic.test.js.map +1 -1
- package/dist/tests/csp/csp.test.d.ts +2 -0
- package/dist/tests/csp/csp.test.d.ts.map +1 -0
- package/dist/tests/csp/csp.test.js +292 -0
- package/dist/tests/csp/csp.test.js.map +1 -0
- package/dist/tests/fca/fca.test.d.ts +2 -0
- package/dist/tests/fca/fca.test.d.ts.map +1 -0
- package/dist/tests/fca/fca.test.js +317 -0
- package/dist/tests/fca/fca.test.js.map +1 -0
- package/dist/tests/intuitionistic-nj/nj.test.d.ts +2 -0
- package/dist/tests/intuitionistic-nj/nj.test.d.ts.map +1 -0
- package/dist/tests/intuitionistic-nj/nj.test.js +216 -0
- package/dist/tests/intuitionistic-nj/nj.test.js.map +1 -0
- package/dist/tests/lambda-calc/lambda-calc.test.d.ts +2 -0
- package/dist/tests/lambda-calc/lambda-calc.test.d.ts.map +1 -0
- package/dist/tests/lambda-calc/lambda-calc.test.js +164 -0
- package/dist/tests/lambda-calc/lambda-calc.test.js.map +1 -0
- package/dist/tests/many-valued/many-valued.test.d.ts +2 -0
- package/dist/tests/many-valued/many-valued.test.d.ts.map +1 -0
- package/dist/tests/many-valued/many-valued.test.js +150 -0
- package/dist/tests/many-valued/many-valued.test.js.map +1 -0
- package/dist/tests/markov-logic/markov-logic.test.d.ts +2 -0
- package/dist/tests/markov-logic/markov-logic.test.d.ts.map +1 -0
- package/dist/tests/markov-logic/markov-logic.test.js +349 -0
- package/dist/tests/markov-logic/markov-logic.test.js.map +1 -0
- package/dist/tests/mltt/mltt.test.d.ts +2 -0
- package/dist/tests/mltt/mltt.test.d.ts.map +1 -0
- package/dist/tests/mltt/mltt.test.js +181 -0
- package/dist/tests/mltt/mltt.test.js.map +1 -0
- package/dist/tests/modal-frame-axioms/frame-axioms.test.d.ts +2 -0
- package/dist/tests/modal-frame-axioms/frame-axioms.test.d.ts.map +1 -0
- package/dist/tests/modal-frame-axioms/frame-axioms.test.js +236 -0
- package/dist/tests/modal-frame-axioms/frame-axioms.test.js.map +1 -0
- package/dist/tests/mu-calculus/check.test.d.ts +2 -0
- package/dist/tests/mu-calculus/check.test.d.ts.map +1 -0
- package/dist/tests/mu-calculus/check.test.js +234 -0
- package/dist/tests/mu-calculus/check.test.js.map +1 -0
- package/dist/tests/pi-calculus/pi-calculus.test.d.ts +2 -0
- package/dist/tests/pi-calculus/pi-calculus.test.d.ts.map +1 -0
- package/dist/tests/pi-calculus/pi-calculus.test.js +273 -0
- package/dist/tests/pi-calculus/pi-calculus.test.js.map +1 -0
- package/dist/tests/planning/planning.test.d.ts +2 -0
- package/dist/tests/planning/planning.test.d.ts.map +1 -0
- package/dist/tests/planning/planning.test.js +397 -0
- package/dist/tests/planning/planning.test.js.map +1 -0
- package/dist/tests/proof-minify/minify.test.d.ts +2 -0
- package/dist/tests/proof-minify/minify.test.d.ts.map +1 -0
- package/dist/tests/proof-minify/minify.test.js +281 -0
- package/dist/tests/proof-minify/minify.test.js.map +1 -0
- package/dist/tests/refinement-types/refinement-types.test.d.ts +2 -0
- package/dist/tests/refinement-types/refinement-types.test.d.ts.map +1 -0
- package/dist/tests/refinement-types/refinement-types.test.js +174 -0
- package/dist/tests/refinement-types/refinement-types.test.js.map +1 -0
- package/dist/tests/sequent-lk/prover.test.d.ts +2 -0
- package/dist/tests/sequent-lk/prover.test.d.ts.map +1 -0
- package/dist/tests/sequent-lk/prover.test.js +317 -0
- package/dist/tests/sequent-lk/prover.test.js.map +1 -0
- package/dist/tests/substructural/prover.test.d.ts +2 -0
- package/dist/tests/substructural/prover.test.d.ts.map +1 -0
- package/dist/tests/substructural/prover.test.js +271 -0
- package/dist/tests/substructural/prover.test.js.map +1 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.d.ts +2 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.d.ts.map +1 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.js +278 -0
- package/dist/tests/symbolic-diff/symbolic-diff.test.js.map +1 -0
- package/dist/tests/system-f/system-f.test.d.ts +2 -0
- package/dist/tests/system-f/system-f.test.d.ts.map +1 -0
- package/dist/tests/system-f/system-f.test.js +217 -0
- package/dist/tests/system-f/system-f.test.js.map +1 -0
- package/dist/tests/term-rewriting/critical-pairs.test.d.ts +2 -0
- package/dist/tests/term-rewriting/critical-pairs.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/critical-pairs.test.js +34 -0
- package/dist/tests/term-rewriting/critical-pairs.test.js.map +1 -0
- package/dist/tests/term-rewriting/knuth-bendix.test.d.ts +2 -0
- package/dist/tests/term-rewriting/knuth-bendix.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/knuth-bendix.test.js +94 -0
- package/dist/tests/term-rewriting/knuth-bendix.test.js.map +1 -0
- package/dist/tests/term-rewriting/lpo.test.d.ts +2 -0
- package/dist/tests/term-rewriting/lpo.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/lpo.test.js +57 -0
- package/dist/tests/term-rewriting/lpo.test.js.map +1 -0
- package/dist/tests/term-rewriting/rewrite.test.d.ts +2 -0
- package/dist/tests/term-rewriting/rewrite.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/rewrite.test.js +56 -0
- package/dist/tests/term-rewriting/rewrite.test.js.map +1 -0
- package/dist/tests/term-rewriting/term-utils.test.d.ts +2 -0
- package/dist/tests/term-rewriting/term-utils.test.d.ts.map +1 -0
- package/dist/tests/term-rewriting/term-utils.test.js +58 -0
- package/dist/tests/term-rewriting/term-utils.test.js.map +1 -0
- package/dist/tests/theorem-cache/cache.test.d.ts +2 -0
- package/dist/tests/theorem-cache/cache.test.d.ts.map +1 -0
- package/dist/tests/theorem-cache/cache.test.js +510 -0
- package/dist/tests/theorem-cache/cache.test.js.map +1 -0
- package/package.json +1 -1
|
@@ -0,0 +1,317 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const sequent_lk_1 = require("../../profiles/sequent-lk");
|
|
5
|
+
// --- Helpers ---
|
|
6
|
+
const atom = (name) => ({ kind: 'atom', name });
|
|
7
|
+
const not = (a) => ({ kind: 'not', arg: a });
|
|
8
|
+
const and = (a, b) => ({ kind: 'and', left: a, right: b });
|
|
9
|
+
const or = (a, b) => ({ kind: 'or', left: a, right: b });
|
|
10
|
+
const imp = (a, b) => ({ kind: 'implies', left: a, right: b });
|
|
11
|
+
const P = atom('P');
|
|
12
|
+
const Q = atom('Q');
|
|
13
|
+
const R = atom('R');
|
|
14
|
+
function rulesOf(p) {
|
|
15
|
+
if (!p)
|
|
16
|
+
return [];
|
|
17
|
+
const out = [p.rule];
|
|
18
|
+
for (const sub of p.premises)
|
|
19
|
+
out.push(...rulesOf(sub));
|
|
20
|
+
return out;
|
|
21
|
+
}
|
|
22
|
+
(0, vitest_1.describe)('LK — proveLK sobre tautologias clasicas', () => {
|
|
23
|
+
(0, vitest_1.it)('demuestra el axioma P ⊢ P', () => {
|
|
24
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [P], right: [P] });
|
|
25
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
26
|
+
(0, vitest_1.expect)(proof.rule).toBe('axiom');
|
|
27
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
28
|
+
});
|
|
29
|
+
(0, vitest_1.it)('demuestra ⊢ P ∨ ¬P (tercio excluido)', () => {
|
|
30
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(or(P, not(P)));
|
|
31
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
32
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
33
|
+
const set = new Set(rulesOf(proof));
|
|
34
|
+
(0, vitest_1.expect)(set.has('orR')).toBe(true);
|
|
35
|
+
(0, vitest_1.expect)(set.has('notR')).toBe(true);
|
|
36
|
+
(0, vitest_1.expect)(set.has('axiom')).toBe(true);
|
|
37
|
+
});
|
|
38
|
+
(0, vitest_1.it)('demuestra ⊢ ¬¬P → P (doble negacion clasica)', () => {
|
|
39
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(not(not(P)), P));
|
|
40
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
41
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
42
|
+
});
|
|
43
|
+
(0, vitest_1.it)('demuestra ley de Peirce: ((P → Q) → P) → P', () => {
|
|
44
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(imp(imp(P, Q), P), P));
|
|
45
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
46
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
47
|
+
});
|
|
48
|
+
(0, vitest_1.it)('demuestra ⊢ ¬¬¬P → ¬P', () => {
|
|
49
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(not(not(not(P))), not(P)));
|
|
50
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
51
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
52
|
+
});
|
|
53
|
+
(0, vitest_1.it)('demuestra (P → Q) → (¬Q → ¬P) — contraposicion', () => {
|
|
54
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(imp(P, Q), imp(not(Q), not(P))));
|
|
55
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
56
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
57
|
+
});
|
|
58
|
+
(0, vitest_1.it)('demuestra De Morgan: ¬(P ∧ Q) → (¬P ∨ ¬Q)', () => {
|
|
59
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(not(and(P, Q)), or(not(P), not(Q))));
|
|
60
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
61
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
62
|
+
});
|
|
63
|
+
(0, vitest_1.it)('rechaza ⊢ P (no es tautologia)', () => {
|
|
64
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(P);
|
|
65
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
66
|
+
});
|
|
67
|
+
(0, vitest_1.it)('rechaza P ⊢ Q (no es derivable)', () => {
|
|
68
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [P], right: [Q] });
|
|
69
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
70
|
+
});
|
|
71
|
+
});
|
|
72
|
+
(0, vitest_1.describe)('LK — multisuccedente', () => {
|
|
73
|
+
(0, vitest_1.it)('demuestra Γ ⊢ P, ¬P en una sola rama via axiom', () => {
|
|
74
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [], right: [P, not(P)] });
|
|
75
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
76
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
77
|
+
});
|
|
78
|
+
(0, vitest_1.it)('demuestra P, Q ⊢ P ∧ Q', () => {
|
|
79
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [P, Q], right: [and(P, Q)] });
|
|
80
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
81
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
82
|
+
(0, vitest_1.expect)(rulesOf(proof)).toContain('andR');
|
|
83
|
+
});
|
|
84
|
+
(0, vitest_1.it)('demuestra P ∨ Q ⊢ Q ∨ P (conmutatividad)', () => {
|
|
85
|
+
const proof = (0, sequent_lk_1.proveLK)({ left: [or(P, Q)], right: [or(Q, P)] });
|
|
86
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
87
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(proof)).toBe(true);
|
|
88
|
+
});
|
|
89
|
+
});
|
|
90
|
+
(0, vitest_1.describe)('LK — Hauptsatz / cut elimination', () => {
|
|
91
|
+
(0, vitest_1.it)('hasCut es false en una prueba cut-free producida por proveLK', () => {
|
|
92
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(imp(P, P));
|
|
93
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
94
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(proof)).toBe(false);
|
|
95
|
+
});
|
|
96
|
+
(0, vitest_1.it)('detecta hasCut=true en una prueba con cut manual', () => {
|
|
97
|
+
// Construimos: ⊢ P via cut sobre P, premisas: ⊢ P, P y P ⊢ (ambas falsas como derivaciones,
|
|
98
|
+
// pero la estructura sirve para chequear hasCut)
|
|
99
|
+
const fakeProof = {
|
|
100
|
+
goal: { left: [], right: [P] },
|
|
101
|
+
rule: 'cut',
|
|
102
|
+
cutFormula: P,
|
|
103
|
+
premises: [
|
|
104
|
+
{ goal: { left: [], right: [P, P] }, rule: 'axiom', premises: [], principalFormula: P },
|
|
105
|
+
{ goal: { left: [P], right: [] }, rule: 'axiom', premises: [], principalFormula: P },
|
|
106
|
+
],
|
|
107
|
+
};
|
|
108
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(fakeProof)).toBe(true);
|
|
109
|
+
});
|
|
110
|
+
(0, vitest_1.it)('construye prueba con cut y elimina via eliminateCut → hasCut=false', () => {
|
|
111
|
+
// Objetivo: P → P
|
|
112
|
+
// Estrategia: armar una derivacion *con* corte que pruebe P → P:
|
|
113
|
+
// premisa1: P ⊢ P, P (via weakR sobre el axiom P ⊢ P) — usamos axiom multisuccedente
|
|
114
|
+
// premisa2: P, P ⊢ P (via weakL sobre el axiom P ⊢ P)
|
|
115
|
+
// cut sobre P → P ⊢ P, luego impR → ⊢ P → P
|
|
116
|
+
//
|
|
117
|
+
// Por simplicidad, construimos directamente un cut sobre Q en un secuente que tiene
|
|
118
|
+
// sub-derivaciones canonicas (axiomas).
|
|
119
|
+
const axQ = {
|
|
120
|
+
goal: { left: [Q], right: [Q] },
|
|
121
|
+
rule: 'axiom',
|
|
122
|
+
premises: [],
|
|
123
|
+
principalFormula: Q,
|
|
124
|
+
};
|
|
125
|
+
const axQ2 = {
|
|
126
|
+
goal: { left: [Q], right: [Q] },
|
|
127
|
+
rule: 'axiom',
|
|
128
|
+
premises: [],
|
|
129
|
+
principalFormula: Q,
|
|
130
|
+
};
|
|
131
|
+
// cut: Q ⊢ Q cut_Q Q ⊢ Q ⟹ Q ⊢ Q
|
|
132
|
+
const withCut = {
|
|
133
|
+
goal: { left: [Q], right: [Q] },
|
|
134
|
+
rule: 'cut',
|
|
135
|
+
cutFormula: Q,
|
|
136
|
+
premises: [axQ, axQ2],
|
|
137
|
+
};
|
|
138
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(withCut)).toBe(true);
|
|
139
|
+
const elim = (0, sequent_lk_1.eliminateCut)(withCut);
|
|
140
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
141
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
142
|
+
});
|
|
143
|
+
(0, vitest_1.it)('cut sobre conectivo and: eliminacion produce prueba cut-free valida del mismo secuente', () => {
|
|
144
|
+
// Objetivo: P, Q ⊢ P ∧ Q via cut sobre P∧Q
|
|
145
|
+
// p1 (concluye P, Q ⊢ P∧Q): andR de P ⊢ P y Q ⊢ Q → este es el lado derecho del cut
|
|
146
|
+
// p2 (concluye P∧Q ⊢ P∧Q): axiom
|
|
147
|
+
// cut: P, Q ⊢ P∧Q cut_{P∧Q} P∧Q ⊢ P∧Q → P, Q ⊢ P∧Q
|
|
148
|
+
// andR para P, Q ⊢ P∧Q: premisas P, Q ⊢ P y P, Q ⊢ Q
|
|
149
|
+
// Usamos derivaciones donde la formula extra viene como axiom multisuccedente, lo cual exige
|
|
150
|
+
// pasar por axiomas con weakening. Para mantener la prueba estructuralmente valida construimos
|
|
151
|
+
// p1 a partir de un cut trivial cuya eliminacion seria correcta — pero como aqui solo testeamos
|
|
152
|
+
// hasCut/eliminateCut, sirve igual: la entrada tiene cuts, la salida no.
|
|
153
|
+
const subAndL = {
|
|
154
|
+
goal: { left: [P, Q], right: [P] },
|
|
155
|
+
rule: 'axiom',
|
|
156
|
+
premises: [],
|
|
157
|
+
principalFormula: P,
|
|
158
|
+
};
|
|
159
|
+
const subAndR = {
|
|
160
|
+
goal: { left: [P, Q], right: [Q] },
|
|
161
|
+
rule: 'axiom',
|
|
162
|
+
premises: [],
|
|
163
|
+
principalFormula: Q,
|
|
164
|
+
};
|
|
165
|
+
const p1 = {
|
|
166
|
+
goal: { left: [P, Q], right: [and(P, Q)] },
|
|
167
|
+
rule: 'andR',
|
|
168
|
+
premises: [subAndL, subAndR],
|
|
169
|
+
principalFormula: and(P, Q),
|
|
170
|
+
};
|
|
171
|
+
const p2 = {
|
|
172
|
+
goal: { left: [and(P, Q)], right: [and(P, Q)] },
|
|
173
|
+
rule: 'axiom',
|
|
174
|
+
premises: [],
|
|
175
|
+
principalFormula: and(P, Q),
|
|
176
|
+
};
|
|
177
|
+
const withCut = {
|
|
178
|
+
goal: { left: [P, Q], right: [and(P, Q)] },
|
|
179
|
+
rule: 'cut',
|
|
180
|
+
cutFormula: and(P, Q),
|
|
181
|
+
premises: [p1, p2],
|
|
182
|
+
};
|
|
183
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(withCut)).toBe(true);
|
|
184
|
+
const elim = (0, sequent_lk_1.eliminateCut)(withCut);
|
|
185
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
186
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
187
|
+
// El secuente terminal debe coincidir
|
|
188
|
+
(0, vitest_1.expect)(elim.goal.left.map((f) => (f.kind === 'atom' ? f.name : '')).sort()).toEqual(['P', 'Q']);
|
|
189
|
+
});
|
|
190
|
+
(0, vitest_1.it)('cut con axioma como una de las premisas se reduce a la otra premisa', () => {
|
|
191
|
+
// Axiom A ⊢ A cut_A A ⊢ A ⟹ A ⊢ A
|
|
192
|
+
const axL = {
|
|
193
|
+
goal: { left: [P], right: [P] },
|
|
194
|
+
rule: 'axiom',
|
|
195
|
+
premises: [],
|
|
196
|
+
principalFormula: P,
|
|
197
|
+
};
|
|
198
|
+
const axR = {
|
|
199
|
+
goal: { left: [P], right: [P] },
|
|
200
|
+
rule: 'axiom',
|
|
201
|
+
premises: [],
|
|
202
|
+
principalFormula: P,
|
|
203
|
+
};
|
|
204
|
+
const withCut = {
|
|
205
|
+
goal: { left: [P], right: [P] },
|
|
206
|
+
rule: 'cut',
|
|
207
|
+
cutFormula: P,
|
|
208
|
+
premises: [axL, axR],
|
|
209
|
+
};
|
|
210
|
+
const elim = (0, sequent_lk_1.eliminateCut)(withCut);
|
|
211
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
212
|
+
(0, vitest_1.expect)(elim.rule).toBe('axiom');
|
|
213
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
214
|
+
});
|
|
215
|
+
});
|
|
216
|
+
(0, vitest_1.describe)('LK — isValid sobre estructuras', () => {
|
|
217
|
+
(0, vitest_1.it)('isValid acepta axiom genuino', () => {
|
|
218
|
+
const ax = {
|
|
219
|
+
goal: { left: [P, Q], right: [P, R] },
|
|
220
|
+
rule: 'axiom',
|
|
221
|
+
premises: [],
|
|
222
|
+
principalFormula: P,
|
|
223
|
+
};
|
|
224
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(ax)).toBe(true);
|
|
225
|
+
});
|
|
226
|
+
(0, vitest_1.it)('isValid rechaza axiom sin formula compartida', () => {
|
|
227
|
+
const bad = {
|
|
228
|
+
goal: { left: [P], right: [Q] },
|
|
229
|
+
rule: 'axiom',
|
|
230
|
+
premises: [],
|
|
231
|
+
principalFormula: P,
|
|
232
|
+
};
|
|
233
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(bad)).toBe(false);
|
|
234
|
+
});
|
|
235
|
+
(0, vitest_1.it)('isValid acepta impR construido a mano: ⊢ P → P', () => {
|
|
236
|
+
const ax = {
|
|
237
|
+
goal: { left: [P], right: [P] },
|
|
238
|
+
rule: 'axiom',
|
|
239
|
+
premises: [],
|
|
240
|
+
principalFormula: P,
|
|
241
|
+
};
|
|
242
|
+
const impR = {
|
|
243
|
+
goal: { left: [], right: [imp(P, P)] },
|
|
244
|
+
rule: 'impR',
|
|
245
|
+
premises: [ax],
|
|
246
|
+
principalFormula: imp(P, P),
|
|
247
|
+
};
|
|
248
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(impR)).toBe(true);
|
|
249
|
+
});
|
|
250
|
+
(0, vitest_1.it)('isValid acepta weakL', () => {
|
|
251
|
+
const ax = {
|
|
252
|
+
goal: { left: [P], right: [P] },
|
|
253
|
+
rule: 'axiom',
|
|
254
|
+
premises: [],
|
|
255
|
+
principalFormula: P,
|
|
256
|
+
};
|
|
257
|
+
const w = {
|
|
258
|
+
goal: { left: [Q, P], right: [P] },
|
|
259
|
+
rule: 'weakL',
|
|
260
|
+
premises: [ax],
|
|
261
|
+
principalFormula: Q,
|
|
262
|
+
};
|
|
263
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(w)).toBe(true);
|
|
264
|
+
});
|
|
265
|
+
(0, vitest_1.it)('isValid acepta contrR', () => {
|
|
266
|
+
// p: ⊢ P, P ; conclusion: ⊢ P
|
|
267
|
+
// Necesitamos una p valida que tenga ⊢ P, P. Una axiom (P ⊢ P) no sirve; usamos
|
|
268
|
+
// un weakR sobre axiom para construir ⊢ P, P es delicado — en cambio testeamos
|
|
269
|
+
// contrR sobre un ejemplo trivial: dados p con goal ⊢ P, P (que aceptamos como
|
|
270
|
+
// un nodo fake con rule weakR), validamos que contrR encaje estructuralmente.
|
|
271
|
+
const fakeP = {
|
|
272
|
+
goal: { left: [], right: [P, P] },
|
|
273
|
+
rule: 'axiom',
|
|
274
|
+
premises: [],
|
|
275
|
+
principalFormula: P,
|
|
276
|
+
};
|
|
277
|
+
// isValid sobre fakeP es false (axiom necesita L y R compartir). Probamos isValid
|
|
278
|
+
// del contrR ignorando la rama de fakeP:
|
|
279
|
+
const contr = {
|
|
280
|
+
goal: { left: [], right: [P] },
|
|
281
|
+
rule: 'contrR',
|
|
282
|
+
premises: [fakeP],
|
|
283
|
+
principalFormula: P,
|
|
284
|
+
};
|
|
285
|
+
// isValid recursivo encontrara que fakeP no es valido → expect false.
|
|
286
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(contr)).toBe(false);
|
|
287
|
+
});
|
|
288
|
+
});
|
|
289
|
+
(0, vitest_1.describe)('LK — propiedad: cut-elimination preserva derivabilidad', () => {
|
|
290
|
+
(0, vitest_1.it)('para una tautologia, eliminateCut produce prueba cut-free isValid', () => {
|
|
291
|
+
// Tomamos una prueba cut-free directa y le inyectamos un cut trivial
|
|
292
|
+
// que tras eliminacion debe colapsar al original (o equivalente).
|
|
293
|
+
const original = (0, sequent_lk_1.proveLKFormula)(imp(P, imp(Q, P)));
|
|
294
|
+
(0, vitest_1.expect)(original).not.toBeNull();
|
|
295
|
+
const withCut = {
|
|
296
|
+
goal: { left: [P], right: [P] },
|
|
297
|
+
rule: 'cut',
|
|
298
|
+
cutFormula: P,
|
|
299
|
+
premises: [
|
|
300
|
+
{ goal: { left: [P], right: [P] }, rule: 'axiom', premises: [], principalFormula: P },
|
|
301
|
+
{ goal: { left: [P], right: [P] }, rule: 'axiom', premises: [], principalFormula: P },
|
|
302
|
+
],
|
|
303
|
+
};
|
|
304
|
+
const elim = (0, sequent_lk_1.eliminateCut)(withCut);
|
|
305
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
306
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
307
|
+
});
|
|
308
|
+
(0, vitest_1.it)('eliminateCut sobre prueba ya cut-free es estable (hasCut sigue siendo false)', () => {
|
|
309
|
+
const proof = (0, sequent_lk_1.proveLKFormula)(or(P, not(P)));
|
|
310
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
311
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(proof)).toBe(false);
|
|
312
|
+
const elim = (0, sequent_lk_1.eliminateCut)(proof);
|
|
313
|
+
(0, vitest_1.expect)((0, sequent_lk_1.hasCut)(elim)).toBe(false);
|
|
314
|
+
(0, vitest_1.expect)((0, sequent_lk_1.isValid)(elim)).toBe(true);
|
|
315
|
+
});
|
|
316
|
+
});
|
|
317
|
+
//# sourceMappingURL=prover.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"prover.test.js","sourceRoot":"","sources":["../../../src/tests/sequent-lk/prover.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,0DAQmC;AAEnC,kBAAkB;AAClB,MAAM,IAAI,GAAG,CAAC,IAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AACnE,MAAM,GAAG,GAAG,CAAC,CAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AACnE,MAAM,GAAG,GAAG,CAAC,CAAY,EAAE,CAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAC5F,MAAM,EAAE,GAAG,CAAC,CAAY,EAAE,CAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAC1F,MAAM,GAAG,GAAG,CAAC,CAAY,EAAE,CAAY,EAAa,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;AAEhG,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AAEpB,SAAS,OAAO,CAAC,CAA6B;IAC5C,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAClB,MAAM,GAAG,GAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC/B,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,QAAQ;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,IAAA,iBAAQ,EAAC,yCAAyC,EAAE,GAAG,EAAE;IACvD,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAClD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uBAAuB,EAAE,GAAG,EAAE;QAC/B,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACtE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC5D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,MAAM,KAAK,GAAG,IAAA,oBAAO,EAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,6FAA6F;QAC7F,iDAAiD;QACjD,MAAM,SAAS,GAAY;YACzB,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC9B,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE;gBACvF,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE;aACrF;SACF,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oEAAoE,EAAE,GAAG,EAAE;QAC5E,kBAAkB;QAClB,iEAAiE;QACjE,wFAAwF;QACxF,yDAAyD;QACzD,8CAA8C;QAC9C,EAAE;QACF,oFAAoF;QACpF,wCAAwC;QACxC,MAAM,GAAG,GAAY;YACnB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,IAAI,GAAY;YACpB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,wCAAwC;QACxC,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC;SACtB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wFAAwF,EAAE,GAAG,EAAE;QAChG,2CAA2C;QAC3C,qFAAqF;QACrF,iCAAiC;QACjC,wDAAwD;QACxD,uDAAuD;QACvD,6FAA6F;QAC7F,+FAA+F;QAC/F,gGAAgG;QAChG,yEAAyE;QACzE,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAClC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAClC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YAC1C,IAAI,EAAE,MAAM;YACZ,QAAQ,EAAE,CAAC,OAAO,EAAE,OAAO,CAAC;YAC5B,gBAAgB,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;SAC5B,CAAC;QACF,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/C,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;SAC5B,CAAC;QACF,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YAC1C,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;YACrB,QAAQ,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;SACnB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,sCAAsC;QACtC,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAClG,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qEAAqE,EAAE,GAAG,EAAE;QAC7E,0CAA0C;QAC1C,MAAM,GAAG,GAAY;YACnB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,GAAG,GAAY;YACnB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC;SACrB,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACrC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,MAAM,GAAG,GAAY;YACnB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,IAAI,GAAY;YACpB,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE;YACtC,IAAI,EAAE,MAAM;YACZ,QAAQ,EAAE,CAAC,EAAE,CAAC;YACd,gBAAgB,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;SAC5B,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,EAAE,GAAY;YAClB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,MAAM,CAAC,GAAY;YACjB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAClC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,CAAC,EAAE,CAAC;YACd,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uBAAuB,EAAE,GAAG,EAAE;QAC/B,gCAAgC;QAChC,gFAAgF;QAChF,+EAA+E;QAC/E,+EAA+E;QAC/E,8EAA8E;QAC9E,MAAM,KAAK,GAAY;YACrB,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE;YACjC,IAAI,EAAE,OAAO;YACb,QAAQ,EAAE,EAAE;YACZ,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,kFAAkF;QAClF,yCAAyC;QACzC,MAAM,KAAK,GAAY;YACrB,IAAI,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC9B,IAAI,EAAE,QAAQ;YACd,QAAQ,EAAE,CAAC,KAAK,CAAC;YACjB,gBAAgB,EAAE,CAAC;SACpB,CAAC;QACF,sEAAsE;QACtE,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wDAAwD,EAAE,GAAG,EAAE;IACtE,IAAA,WAAE,EAAC,mEAAmE,EAAE,GAAG,EAAE;QAC3E,qEAAqE;QACrE,kEAAkE;QAClE,MAAM,QAAQ,GAAG,IAAA,2BAAc,EAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,IAAA,eAAM,EAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAChC,MAAM,OAAO,GAAY;YACvB,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE;YAC/B,IAAI,EAAE,KAAK;YACX,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE;gBACR,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE;gBACrF,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,gBAAgB,EAAE,CAAC,EAAE;aACtF;SACF,CAAC;QACF,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,OAAO,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8EAA8E,EAAE,GAAG,EAAE;QACtF,MAAM,KAAK,GAAG,IAAA,2BAAc,EAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,KAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,yBAAY,EAAC,KAAM,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,IAAA,mBAAM,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,IAAA,oBAAO,EAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"prover.test.d.ts","sourceRoot":"","sources":["../../../src/tests/substructural/prover.test.ts"],"names":[],"mappings":""}
|
|
@@ -0,0 +1,271 @@
|
|
|
1
|
+
"use strict";
|
|
2
|
+
Object.defineProperty(exports, "__esModule", { value: true });
|
|
3
|
+
const vitest_1 = require("vitest");
|
|
4
|
+
const substructural_1 = require("../../profiles/substructural");
|
|
5
|
+
// --- Helpers de construccion ---
|
|
6
|
+
const atom = (name) => ({ kind: 'atom', name });
|
|
7
|
+
const tensor = (a, b) => ({
|
|
8
|
+
kind: 'tensor',
|
|
9
|
+
left: a,
|
|
10
|
+
right: b,
|
|
11
|
+
});
|
|
12
|
+
const lolli = (a, b) => ({
|
|
13
|
+
kind: 'lollipop',
|
|
14
|
+
left: a,
|
|
15
|
+
right: b,
|
|
16
|
+
});
|
|
17
|
+
const wWith = (a, b) => ({
|
|
18
|
+
kind: 'with',
|
|
19
|
+
left: a,
|
|
20
|
+
right: b,
|
|
21
|
+
});
|
|
22
|
+
const plus = (a, b) => ({
|
|
23
|
+
kind: 'plus',
|
|
24
|
+
left: a,
|
|
25
|
+
right: b,
|
|
26
|
+
});
|
|
27
|
+
const bang = (a) => ({ kind: 'bang', arg: a });
|
|
28
|
+
const ONE = { kind: 'one' };
|
|
29
|
+
const A = atom('A');
|
|
30
|
+
const B = atom('B');
|
|
31
|
+
const C = atom('C');
|
|
32
|
+
function rules(tree) {
|
|
33
|
+
if (!tree)
|
|
34
|
+
return [];
|
|
35
|
+
const out = [tree.rule];
|
|
36
|
+
for (const p of tree.premises)
|
|
37
|
+
out.push(...rules(p));
|
|
38
|
+
return out;
|
|
39
|
+
}
|
|
40
|
+
// ============================================================
|
|
41
|
+
// LINEAR LOGIC
|
|
42
|
+
// ============================================================
|
|
43
|
+
(0, vitest_1.describe)('Linear logic — fragmento basico', () => {
|
|
44
|
+
(0, vitest_1.it)('demuestra A ⊸ A (identidad)', () => {
|
|
45
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, A)] });
|
|
46
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
47
|
+
(0, vitest_1.expect)(rules(proof)).toContain('lollipopR');
|
|
48
|
+
(0, vitest_1.expect)(rules(proof)).toContain('axiom');
|
|
49
|
+
});
|
|
50
|
+
(0, vitest_1.it)('demuestra ⊢ 1 (unit)', () => {
|
|
51
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [ONE] });
|
|
52
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
53
|
+
(0, vitest_1.expect)(proof?.rule).toBe('oneR');
|
|
54
|
+
});
|
|
55
|
+
(0, vitest_1.it)('demuestra A ⊸ (1 ⊸ A) (curry trivial con 1)', () => {
|
|
56
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, lolli(ONE, A))] });
|
|
57
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
58
|
+
});
|
|
59
|
+
});
|
|
60
|
+
(0, vitest_1.describe)('Linear logic — multiplicativos (⊗, ⊸)', () => {
|
|
61
|
+
(0, vitest_1.it)('demuestra conmutatividad: A ⊗ B ⊸ B ⊗ A', () => {
|
|
62
|
+
const proof = (0, substructural_1.proveLinear)({
|
|
63
|
+
left: [],
|
|
64
|
+
right: [lolli(tensor(A, B), tensor(B, A))],
|
|
65
|
+
});
|
|
66
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
67
|
+
const r = rules(proof);
|
|
68
|
+
(0, vitest_1.expect)(r).toContain('lollipopR');
|
|
69
|
+
(0, vitest_1.expect)(r).toContain('tensorL');
|
|
70
|
+
(0, vitest_1.expect)(r).toContain('tensorR');
|
|
71
|
+
});
|
|
72
|
+
(0, vitest_1.it)('demuestra asociatividad: A ⊗ (B ⊗ C) ⊸ (A ⊗ B) ⊗ C', () => {
|
|
73
|
+
const proof = (0, substructural_1.proveLinear)({
|
|
74
|
+
left: [],
|
|
75
|
+
right: [lolli(tensor(A, tensor(B, C)), tensor(tensor(A, B), C))],
|
|
76
|
+
});
|
|
77
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
78
|
+
});
|
|
79
|
+
(0, vitest_1.it)('NO demuestra A ⊸ A ⊗ A (no contraction)', () => {
|
|
80
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, tensor(A, A))] });
|
|
81
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
82
|
+
});
|
|
83
|
+
(0, vitest_1.it)('NO demuestra A ⊗ B ⊸ A (no weakening en linear)', () => {
|
|
84
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(tensor(A, B), A)] });
|
|
85
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
86
|
+
});
|
|
87
|
+
(0, vitest_1.it)('demuestra modus ponens lineal: A ⊗ (A ⊸ B) ⊸ B', () => {
|
|
88
|
+
const proof = (0, substructural_1.proveLinear)({
|
|
89
|
+
left: [],
|
|
90
|
+
right: [lolli(tensor(A, lolli(A, B)), B)],
|
|
91
|
+
});
|
|
92
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
93
|
+
});
|
|
94
|
+
(0, vitest_1.it)('demuestra composicion: (A ⊸ B) ⊗ (B ⊸ C) ⊸ (A ⊸ C)', () => {
|
|
95
|
+
const proof = (0, substructural_1.proveLinear)({
|
|
96
|
+
left: [],
|
|
97
|
+
right: [lolli(tensor(lolli(A, B), lolli(B, C)), lolli(A, C))],
|
|
98
|
+
});
|
|
99
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
100
|
+
});
|
|
101
|
+
});
|
|
102
|
+
(0, vitest_1.describe)('Linear logic — aditivos (&, ⊕)', () => {
|
|
103
|
+
(0, vitest_1.it)('demuestra A & B ⊸ A (proyeccion 1, with permite descartar uno)', () => {
|
|
104
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(wWith(A, B), A)] });
|
|
105
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
106
|
+
(0, vitest_1.expect)(rules(proof)).toContain('withL1');
|
|
107
|
+
});
|
|
108
|
+
(0, vitest_1.it)('demuestra A & B ⊸ B (proyeccion 2)', () => {
|
|
109
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(wWith(A, B), B)] });
|
|
110
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
111
|
+
(0, vitest_1.expect)(rules(proof)).toContain('withL2');
|
|
112
|
+
});
|
|
113
|
+
(0, vitest_1.it)('demuestra A ⊸ A ⊕ B (inyeccion 1)', () => {
|
|
114
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, plus(A, B))] });
|
|
115
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
116
|
+
(0, vitest_1.expect)(rules(proof)).toContain('plusR1');
|
|
117
|
+
});
|
|
118
|
+
(0, vitest_1.it)('demuestra A ⊸ B ⊕ A (inyeccion 2)', () => {
|
|
119
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, plus(B, A))] });
|
|
120
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
121
|
+
(0, vitest_1.expect)(rules(proof)).toContain('plusR2');
|
|
122
|
+
});
|
|
123
|
+
(0, vitest_1.it)('NO demuestra A ⊕ B ⊸ A (sin info de cual lado del plus)', () => {
|
|
124
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(plus(A, B), A)] });
|
|
125
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
126
|
+
});
|
|
127
|
+
(0, vitest_1.it)('NO demuestra A ⊸ A & B (B no es derivable de A)', () => {
|
|
128
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, wWith(A, B))] });
|
|
129
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
130
|
+
});
|
|
131
|
+
});
|
|
132
|
+
(0, vitest_1.describe)('Linear logic — exponencial bang (!)', () => {
|
|
133
|
+
(0, vitest_1.it)('demuestra !A ⊸ A (dereliction)', () => {
|
|
134
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(bang(A), A)] });
|
|
135
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
136
|
+
// El prover usa la zona unrestricted: bangL promueve a Σ, luego
|
|
137
|
+
// axioma desde Σ. Cualquier ruta correcta cuenta.
|
|
138
|
+
const r = rules(proof);
|
|
139
|
+
(0, vitest_1.expect)(r).toContain('bangL');
|
|
140
|
+
(0, vitest_1.expect)(r).toContain('axiom');
|
|
141
|
+
});
|
|
142
|
+
(0, vitest_1.it)('demuestra !A ⊸ A ⊗ A (contraction via bang)', () => {
|
|
143
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(bang(A), tensor(A, A))] });
|
|
144
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
145
|
+
// La "contraction" se realiza implicitamente al copiar dos veces
|
|
146
|
+
// desde la zona unrestricted Σ via derelictionL.
|
|
147
|
+
const r = rules(proof);
|
|
148
|
+
(0, vitest_1.expect)(r).toContain('bangL');
|
|
149
|
+
(0, vitest_1.expect)(r).toContain('tensorR');
|
|
150
|
+
// Dos copias de A desde Σ:
|
|
151
|
+
const derelicts = r.filter((x) => x === 'derelictionL').length;
|
|
152
|
+
const axioms = r.filter((x) => x === 'axiom').length;
|
|
153
|
+
(0, vitest_1.expect)(derelicts + axioms).toBeGreaterThanOrEqual(2);
|
|
154
|
+
});
|
|
155
|
+
(0, vitest_1.it)('demuestra !A ⊸ 1 (weakening via bang)', () => {
|
|
156
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(bang(A), ONE)] });
|
|
157
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
158
|
+
});
|
|
159
|
+
(0, vitest_1.it)('demuestra !A ⊗ !B ⊸ !B ⊗ !A (conmutatividad sobre !)', () => {
|
|
160
|
+
const proof = (0, substructural_1.proveLinear)({
|
|
161
|
+
left: [],
|
|
162
|
+
right: [lolli(tensor(bang(A), bang(B)), tensor(bang(B), bang(A)))],
|
|
163
|
+
});
|
|
164
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
165
|
+
});
|
|
166
|
+
(0, vitest_1.it)('NO demuestra A ⊸ !A (no se puede promover sin contexto bang)', () => {
|
|
167
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, bang(A))] });
|
|
168
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
169
|
+
});
|
|
170
|
+
});
|
|
171
|
+
// ============================================================
|
|
172
|
+
// AFFINE LOGIC
|
|
173
|
+
// ============================================================
|
|
174
|
+
(0, vitest_1.describe)('Affine logic — weakening permitido', () => {
|
|
175
|
+
(0, vitest_1.it)('demuestra A ⊗ B ⊸ A (weakening descarta B)', () => {
|
|
176
|
+
const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(tensor(A, B), A)] });
|
|
177
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
178
|
+
(0, vitest_1.expect)(rules(proof)).toContain('weakening');
|
|
179
|
+
});
|
|
180
|
+
(0, vitest_1.it)('demuestra A ⊗ B ⊸ B (weakening descarta A)', () => {
|
|
181
|
+
const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(tensor(A, B), B)] });
|
|
182
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
183
|
+
});
|
|
184
|
+
(0, vitest_1.it)('demuestra A ⊸ 1 (todo es descartable en afin)', () => {
|
|
185
|
+
const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(A, ONE)] });
|
|
186
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
187
|
+
});
|
|
188
|
+
(0, vitest_1.it)('demuestra A ⊗ B ⊗ C ⊸ A (multi-weakening)', () => {
|
|
189
|
+
const proof = (0, substructural_1.proveAffine)({
|
|
190
|
+
left: [],
|
|
191
|
+
right: [lolli(tensor(A, tensor(B, C)), A)],
|
|
192
|
+
});
|
|
193
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
194
|
+
});
|
|
195
|
+
(0, vitest_1.it)('preserva validez lineal: A ⊸ A es valido en afin', () => {
|
|
196
|
+
const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(A, A)] });
|
|
197
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
198
|
+
});
|
|
199
|
+
});
|
|
200
|
+
(0, vitest_1.describe)('Affine logic — contraction sigue prohibida', () => {
|
|
201
|
+
(0, vitest_1.it)('NO demuestra A ⊸ A ⊗ A (no contraction en afin)', () => {
|
|
202
|
+
const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(A, tensor(A, A))] });
|
|
203
|
+
(0, vitest_1.expect)(proof).toBeNull();
|
|
204
|
+
});
|
|
205
|
+
(0, vitest_1.it)('NO demuestra A ⊸ A & A si A es atomo (no, with si admite)', () => {
|
|
206
|
+
// Trampa: A ⊸ A & A SI es valido en afin/linear porque
|
|
207
|
+
// with usa el MISMO contexto en ambas ramas (no duplica).
|
|
208
|
+
const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(A, wWith(A, A))] });
|
|
209
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
210
|
+
});
|
|
211
|
+
(0, vitest_1.it)('SI demuestra (!A) ⊸ A ⊗ A en afin (bang permite contraction)', () => {
|
|
212
|
+
const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(bang(A), tensor(A, A))] });
|
|
213
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
214
|
+
});
|
|
215
|
+
});
|
|
216
|
+
// ============================================================
|
|
217
|
+
// LINEAR vs AFFINE — discriminacion
|
|
218
|
+
// ============================================================
|
|
219
|
+
(0, vitest_1.describe)('Discriminacion entre linear y afin', () => {
|
|
220
|
+
(0, vitest_1.it)('A ⊗ B ⊸ A: NO en linear, SI en afin', () => {
|
|
221
|
+
const seq = { left: [], right: [lolli(tensor(A, B), A)] };
|
|
222
|
+
(0, vitest_1.expect)((0, substructural_1.proveLinear)(seq)).toBeNull();
|
|
223
|
+
(0, vitest_1.expect)((0, substructural_1.proveAffine)(seq)).not.toBeNull();
|
|
224
|
+
});
|
|
225
|
+
(0, vitest_1.it)('A ⊸ A ⊗ A: NO en linear, NO en afin', () => {
|
|
226
|
+
const seq = { left: [], right: [lolli(A, tensor(A, A))] };
|
|
227
|
+
(0, vitest_1.expect)((0, substructural_1.proveLinear)(seq)).toBeNull();
|
|
228
|
+
(0, vitest_1.expect)((0, substructural_1.proveAffine)(seq)).toBeNull();
|
|
229
|
+
});
|
|
230
|
+
(0, vitest_1.it)('A ⊸ A: SI en linear, SI en afin', () => {
|
|
231
|
+
const seq = { left: [], right: [lolli(A, A)] };
|
|
232
|
+
(0, vitest_1.expect)((0, substructural_1.proveLinear)(seq)).not.toBeNull();
|
|
233
|
+
(0, vitest_1.expect)((0, substructural_1.proveAffine)(seq)).not.toBeNull();
|
|
234
|
+
});
|
|
235
|
+
});
|
|
236
|
+
// ============================================================
|
|
237
|
+
// Estructura de la prueba
|
|
238
|
+
// ============================================================
|
|
239
|
+
(0, vitest_1.describe)('Forma de las pruebas', () => {
|
|
240
|
+
(0, vitest_1.it)('la conclusion de la prueba coincide con el secuente pedido', () => {
|
|
241
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, A)] });
|
|
242
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
243
|
+
if (!proof)
|
|
244
|
+
return;
|
|
245
|
+
(0, vitest_1.expect)(proof.conclusion.left.length).toBe(0);
|
|
246
|
+
(0, vitest_1.expect)(proof.conclusion.right.length).toBe(1);
|
|
247
|
+
const first = proof.conclusion.right[0];
|
|
248
|
+
(0, vitest_1.expect)(first?.kind).toBe('lollipop');
|
|
249
|
+
});
|
|
250
|
+
(0, vitest_1.it)('axiom tiene cero premisas', () => {
|
|
251
|
+
const proof = (0, substructural_1.proveLinear)({ left: [A], right: [A] });
|
|
252
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
253
|
+
(0, vitest_1.expect)(proof?.rule).toBe('axiom');
|
|
254
|
+
(0, vitest_1.expect)(proof?.premises.length).toBe(0);
|
|
255
|
+
});
|
|
256
|
+
(0, vitest_1.it)('lollipopR tiene exactamente una premisa', () => {
|
|
257
|
+
const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, A)] });
|
|
258
|
+
const lolliNode = proof?.rule === 'lollipopR' ? proof : null;
|
|
259
|
+
(0, vitest_1.expect)(lolliNode).not.toBeNull();
|
|
260
|
+
(0, vitest_1.expect)(lolliNode?.premises.length).toBe(1);
|
|
261
|
+
});
|
|
262
|
+
(0, vitest_1.it)('tensorR ramifica en 2 premisas', () => {
|
|
263
|
+
const proof = (0, substructural_1.proveLinear)({ left: [A, B], right: [tensor(A, B)] });
|
|
264
|
+
(0, vitest_1.expect)(proof).not.toBeNull();
|
|
265
|
+
if (!proof)
|
|
266
|
+
return;
|
|
267
|
+
(0, vitest_1.expect)(proof.rule).toBe('tensorR');
|
|
268
|
+
(0, vitest_1.expect)(proof.premises.length).toBe(2);
|
|
269
|
+
});
|
|
270
|
+
});
|
|
271
|
+
//# sourceMappingURL=prover.test.js.map
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
{"version":3,"file":"prover.test.js","sourceRoot":"","sources":["../../../src/tests/substructural/prover.test.ts"],"names":[],"mappings":";;AAAA,mCAA8C;AAC9C,gEAAoG;AAEpG,kCAAkC;AAElC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAiB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;AACvE,MAAM,MAAM,GAAG,CAAC,CAAgB,EAAE,CAAgB,EAAiB,EAAE,CAAC,CAAC;IACrE,IAAI,EAAE,QAAQ;IACd,IAAI,EAAE,CAAC;IACP,KAAK,EAAE,CAAC;CACT,CAAC,CAAC;AACH,MAAM,KAAK,GAAG,CAAC,CAAgB,EAAE,CAAgB,EAAiB,EAAE,CAAC,CAAC;IACpE,IAAI,EAAE,UAAU;IAChB,IAAI,EAAE,CAAC;IACP,KAAK,EAAE,CAAC;CACT,CAAC,CAAC;AACH,MAAM,KAAK,GAAG,CAAC,CAAgB,EAAE,CAAgB,EAAiB,EAAE,CAAC,CAAC;IACpE,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE,CAAC;IACP,KAAK,EAAE,CAAC;CACT,CAAC,CAAC;AACH,MAAM,IAAI,GAAG,CAAC,CAAgB,EAAE,CAAgB,EAAiB,EAAE,CAAC,CAAC;IACnE,IAAI,EAAE,MAAM;IACZ,IAAI,EAAE,CAAC;IACP,KAAK,EAAE,CAAC;CACT,CAAC,CAAC;AACH,MAAM,IAAI,GAAG,CAAC,CAAgB,EAAiB,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;AAC7E,MAAM,GAAG,GAAkB,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AAE3C,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;AAEpB,SAAS,KAAK,CAAC,IAAwB;IACrC,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,CAAC;IACrB,MAAM,GAAG,GAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ;QAAE,GAAG,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,+DAA+D;AAC/D,eAAe;AACf,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACtD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAK,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC1E,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC;YACxB,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SAC3C,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC;YACxB,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SACjE,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC;YACxB,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAC1C,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC;YACxB,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;SAC9D,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oCAAoC,EAAE,GAAG,EAAE;QAC5C,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACvE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,gEAAgE;QAChE,kDAAkD;QAClD,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,iEAAiE;QACjE,iDAAiD;QACjD,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QACvB,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAA,eAAM,EAAC,CAAC,CAAC,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QAC/B,2BAA2B;QAC3B,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,cAAc,CAAC,CAAC,MAAM,CAAC;QAC/D,MAAM,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,OAAO,CAAC,CAAC,MAAM,CAAC;QACrD,IAAA,eAAM,EAAC,SAAS,GAAG,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QACtE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC;YACxB,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SACnE,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACpE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,eAAe;AACf,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC;YACxB,IAAI,EAAE,EAAE;YACR,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAC3C,CAAC,CAAC;QACH,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kDAAkD,EAAE,GAAG,EAAE;QAC1D,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,IAAA,WAAE,EAAC,iDAAiD,EAAE,GAAG,EAAE;QACzD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACzE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,uDAAuD;QACvD,0DAA0D;QAC1D,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8DAA8D,EAAE,GAAG,EAAE;QACtE,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC/E,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,oCAAoC;AACpC,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,oCAAoC,EAAE,GAAG,EAAE;IAClD,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,2BAAW,EAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,2BAAW,EAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1D,IAAA,eAAM,EAAC,IAAA,2BAAW,EAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;QACpC,IAAA,eAAM,EAAC,IAAA,2BAAW,EAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,GAAG,GAAG,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/C,IAAA,eAAM,EAAC,IAAA,2BAAW,EAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAA,eAAM,EAAC,IAAA,2BAAW,EAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,0BAA0B;AAC1B,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,IAAA,eAAM,EAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACxC,IAAA,eAAM,EAAC,KAAK,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2BAA2B,EAAE,GAAG,EAAE;QACnC,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAA,eAAM,EAAC,KAAK,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,KAAK,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yCAAyC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC9D,MAAM,SAAS,GAAG,KAAK,EAAE,IAAI,KAAK,WAAW,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7D,IAAA,eAAM,EAAC,SAAS,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QACjC,IAAA,eAAM,EAAC,SAAS,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,KAAK,GAAG,IAAA,2BAAW,EAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,KAAK,CAAC,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK;YAAE,OAAO;QACnB,IAAA,eAAM,EAAC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}
|