@stevenvo780/st-lang 4.2.0 → 4.3.0

package/dist/tests/modal-frame-axioms/frame-axioms.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"frame-axioms.test.js","sourceRoot":"","sources":["../../../src/tests/modal-frame-axioms/frame-axioms.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,+CAA+C;AAC/C,+DAA+D;;AAE/D,mCAA8C;AAC9C,0EAe2C;AAE3C,MAAM,CAAC,GAAG,IAAA,yBAAI,EAAC,GAAG,CAAC,CAAC;AACpB,MAAM,CAAC,GAAG,IAAA,yBAAI,EAAC,GAAG,CAAC,CAAC;AAEpB,+DAA+D;AAC/D,yBAAyB;AACzB,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,iDAAiD,EAAE,GAAG,EAAE;IAC/D,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,SAAS,EAAE,GAAG,EAAE;QACjB,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,aAAa,EAAE,GAAG,EAAE;QACrB,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gBAAgB,EAAE,GAAG,EAAE;QACxB,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC7D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,YAAY,EAAE,GAAG,EAAE;QACpB,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kBAAkB,EAAE,GAAG,EAAE;QAC1B,IAAA,eAAM,EAAC,IAAA,iCAAY,EAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,8DAA8D;AAC9D,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,uDAAuD,EAAE,GAAG,EAAE;IACrE,MAAM,KAAK,GAAsD;QAC/D,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;QAC3B,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE;QAC5B,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,IAAI,EAAE;QAC5B,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;QAC3B,EAAE,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE;KAC5B,CAAC;IAEF,KAAK,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACtC,IAAA,WAAE,EAAC,UAAU,KAAK,cAAc,MAAM,EAAE,EAAE,GAAG,EAAE;YAC7C,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,iCAAY,EAAC,KAAK,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QAEH,IAAA,WAAE,EAAC,UAAU,KAAK,iBAAiB,EAAE,GAAG,EAAE;YACxC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,iCAAY,EAAC,KAAK,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3D,CAAC,CAAC,CAAC;IACL,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,6BAA6B,EAAE,GAAG,EAAE;IAC3C,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6BAA6B,EAAE,GAAG,EAAE;QACrC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8BAA8B,EAAE,GAAG,EAAE;QACtC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACtE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kBAAkB,EAAE,GAAG,EAAE;IAChC,IAAA,WAAE,EAAC,uBAAuB,EAAE,GAAG,EAAE;QAC/B,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,CAAC,EAAE,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wCAAwC,EAAE,GAAG,EAAE;QAChD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,0BAA0B,EAAE,GAAG,EAAE;IACxC,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,mCAAmC,EAAE,GAAG,EAAE;QAC3C,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,IAAA,4BAAO,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxF,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4DAA4D,EAAE,GAAG,EAAE;QACpE,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,IAAA,uBAAE,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,IAAA,WAAE,EAAC,wBAAwB,EAAE,GAAG,EAAE;QAChC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qDAAqD,EAAE,GAAG,EAAE;QAC7D,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,oBAAoB,EAAE,GAAG,EAAE;IAClC,IAAA,WAAE,EAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qBAAqB,EAAE,GAAG,EAAE;QAC7B,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,iCAAY,EAAC,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,iCAAY,EAAC,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,iCAAY,EAAC,GAAG,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,4BAA4B;AAC5B,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,4DAA4D,EAAE,GAAG,EAAE;IAC1E,IAAA,WAAE,EAAC,gDAAgD,EAAE,GAAG,EAAE;QACxD,MAAM,CAAC,GAAG,IAAA,sCAAiB,EAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACnC,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC9B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAM,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,wDAAwD,EAAE,GAAG,EAAE;QAChE,MAAM,CAAC,GAAG,IAAA,sCAAiB,EAAC,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACrD,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,CAAC,GAAG,IAAA,sCAAiB,EAAC,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC1B,IAAA,eAAM,EAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAA,eAAM,EAAC,CAAC,CAAC,KAAK,CAAC,CAAC,aAAa,EAAE,CAAC;IAClC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,yDAAyD,EAAE,GAAG,EAAE;QACjE,IAAA,eAAM,EAAC,IAAA,sCAAiB,EAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,IAAA,sCAAiB,EAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,IAAA,eAAM,EAAC,IAAA,sCAAiB,EAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,+DAA+D;AAC/D,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,4CAA4C,EAAE,GAAG,EAAE;IAC1D,MAAM,QAAQ,GAAG;QACf,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,WAAW;QAC/B,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,WAAW;QACzC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,aAAa;KAC3C,CAAC;IAEF,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;YACnD,IAAI,IAAA,4BAAO,EAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBACtB,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACtC,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,GAAG,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC;AACH,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,uCAAuC;AACvC,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,yBAAyB,EAAE,GAAG,EAAE;IACvC,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,0CAA0C,EAAE,GAAG,EAAE;QAClD,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,IAAA,4BAAO,EAAC,CAAC,CAAC,CAAC,EAAE,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,+DAA+D;AAC/D,wBAAwB;AACxB,+DAA+D;AAE/D,IAAA,iBAAQ,EAAC,0CAA0C,EAAE,GAAG,EAAE;IACxD,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,IAAA,wBAAG,EAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,GAAG,GAAG,IAAA,4BAAO,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAA,kCAAa,EAAC,IAAA,wBAAG,EAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC9D,IAAA,eAAM,EAAC,IAAA,4BAAO,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAA,kCAAa,EAAC,IAAA,wBAAG,EAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAChE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,GAAG,GAAG,IAAA,wBAAG,EAAC,IAAA,wBAAG,EAAC,CAAC,CAAC,EAAE,IAAA,wBAAG,EAAC,CAAC,CAAC,CAAC,CAAC;QAChC,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,wEAAwE;QACxE,IAAA,eAAM,EAAC,IAAA,kCAAa,EAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/proof-minify/minify.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=minify.test.d.ts.map

package/dist/tests/proof-minify/minify.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"minify.test.d.ts","sourceRoot":"","sources":["../../../src/tests/proof-minify/minify.test.ts"],"names":[],"mappings":""}

package/dist/tests/proof-minify/minify.test.js

@@ -0,0 +1,281 @@
+"use strict";
+// ============================================================
+// ST Proof Minification — Tests
+// ============================================================
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const proof_minify_1 = require("../../runtime/proof-minify");
+// ── Helpers de construcción ──────────────────────────────────
+function ax(conclusion) {
+    return { conclusion, rule: 'axiom', premises: [] };
+}
+function hyp(conclusion) {
+    return { conclusion, rule: 'hypothesis', premises: [] };
+}
+function mp(conclusion, ant, impl) {
+    return { conclusion, rule: 'MP', premises: [ant, impl] };
+}
+function andI(left, right) {
+    return {
+        conclusion: `${left.conclusion} ∧ ${right.conclusion}`,
+        rule: '∧I',
+        premises: [left, right],
+    };
+}
+function andE1(conjunct, conj) {
+    return { conclusion: conjunct, rule: '∧E1', premises: [conj] };
+}
+function cut(conclusion, left, right) {
+    return { conclusion, rule: 'cut', premises: [left, right] };
+}
+function weaken(conclusion, ...premises) {
+    return { conclusion, rule: 'weakening', premises };
+}
+// ── Tests ────────────────────────────────────────────────────
+(0, vitest_1.describe)('proof-minify: counts y depth', () => {
+    (0, vitest_1.it)('countNodes/depth funcionan correctamente sobre un árbol simple', () => {
+        const proof = mp('B', ax('A'), ax('A → B'));
+        const result = (0, proof_minify_1.minifyProof)(proof, { rules: [] }); // no aplicar reglas
+        (0, vitest_1.expect)(result.original.nodes).toBe(3);
+        (0, vitest_1.expect)(result.original.depth).toBe(1);
+    });
+});
+(0, vitest_1.describe)('proof-minify: detrivialize ∧I/∧E', () => {
+    (0, vitest_1.it)('colapsa ∧E1 ∘ ∧I al sub-árbol correspondiente', () => {
+        // (A ∧ B) introducido y luego eliminado a A.
+        const intro = andI(ax('A'), ax('B'));
+        const elim = andE1('A', intro);
+        const result = (0, proof_minify_1.minifyProof)(elim);
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('A');
+        (0, vitest_1.expect)(result.minified.rule).toBe('axiom');
+        (0, vitest_1.expect)(result.minified.premises).toHaveLength(0);
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThanOrEqual(2);
+    });
+    (0, vitest_1.it)('detrivializa anidados: ∧E1 ∘ ∧I ∘ ∧E1 ∘ ∧I', () => {
+        // Construimos: (((A ∧ B) ∧ C) , extracción de A vía dos eliminaciones)
+        const innerIntro = andI(ax('A'), ax('B'));
+        const elim1 = andE1('A', innerIntro);
+        const outerIntro = andI(elim1, ax('C'));
+        const elim2 = andE1('A', outerIntro);
+        const result = (0, proof_minify_1.minifyProof)(elim2);
+        (0, vitest_1.expect)(result.minified.rule).toBe('axiom');
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('A');
+    });
+});
+(0, vitest_1.describe)('proof-minify: compact MP chains', () => {
+    (0, vitest_1.it)('compacta una cadena de 5 MPs en un único MP*', () => {
+        // A, A→B, B→C, C→D, D→E, E→F ⊢ F
+        const step1 = mp('B', ax('A'), ax('A → B'));
+        const step2 = mp('C', step1, ax('B → C'));
+        const step3 = mp('D', step2, ax('C → D'));
+        const step4 = mp('E', step3, ax('D → E'));
+        const step5 = mp('F', step4, ax('E → F'));
+        const result = (0, proof_minify_1.minifyProof)(step5, { rules: ['compact-mp'] });
+        (0, vitest_1.expect)(result.minified.rule).toBe('MP*');
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('F');
+        (0, vitest_1.expect)(result.minified.metadata?.chain).toBeDefined();
+        (0, vitest_1.expect)(result.minified.metadata.chain.length).toBeGreaterThanOrEqual(5);
+        // Profundidad debe haberse reducido drásticamente.
+        (0, vitest_1.expect)(result.reduction.depthDelta).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('no compacta cadenas ambiguas (sin → en las premisas)', () => {
+        const fake1 = mp('X', ax('Y'), ax('Z'));
+        const fake2 = mp('A', fake1, ax('W'));
+        const result = (0, proof_minify_1.compactModusPonensChain)(fake2);
+        // Como no detecta antecedente vs implicación, no compacta.
+        (0, vitest_1.expect)(result.rule).toBe('MP');
+    });
+    (0, vitest_1.it)('cadenas de exactamente 1 MP no se compactan', () => {
+        const proof = mp('B', ax('A'), ax('A → B'));
+        const result = (0, proof_minify_1.compactModusPonensChain)(proof);
+        (0, vitest_1.expect)(result.rule).toBe('MP');
+    });
+});
+(0, vitest_1.describe)('proof-minify: local cut elimination', () => {
+    (0, vitest_1.it)('elimina cut cuando una rama es hoja-identidad', () => {
+        // cut sobre conclusión A: una rama es la hipótesis A, la otra deriva A.
+        const derivacionA = andE1('A', andI(ax('A'), ax('B')));
+        const proofWithCut = cut('A', hyp('A'), derivacionA);
+        const result = (0, proof_minify_1.minifyProof)(proofWithCut, { rules: ['cut-elimination-local'] });
+        // El cut se reemplaza por la derivación que realmente concluyó A.
+        (0, vitest_1.expect)(result.minified.rule).not.toBe('cut');
+    });
+    (0, vitest_1.it)('mantiene cut cuando ninguna rama es hoja-identidad', () => {
+        const left = mp('A', ax('X'), ax('X → A'));
+        const right = mp('B', ax('A'), ax('A → B'));
+        const proof = cut('B', left, right);
+        const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['cut-elimination-local'] });
+        (0, vitest_1.expect)(result.minified.rule).toBe('cut');
+    });
+});
+(0, vitest_1.describe)('proof-minify: remove unused subproofs', () => {
+    (0, vitest_1.it)('recorta premisas irrelevantes en weakening', () => {
+        // Weakening: la conclusion es A. Sólo una premisa contiene A.
+        const irrelevante1 = ax('Z');
+        const irrelevante2 = ax('W');
+        const relevante = ax('A');
+        const proof = weaken('A', irrelevante1, irrelevante2, relevante);
+        const result = (0, proof_minify_1.removeUnusedSubproofs)(proof);
+        (0, vitest_1.expect)(result.premises.length).toBeLessThan(3);
+        // La premisa que sobrevive debe contener A.
+        (0, vitest_1.expect)(result.premises.some((p) => p.conclusion === 'A')).toBe(true);
+    });
+    (0, vitest_1.it)('no toca nodos con sólo 1 premisa', () => {
+        const proof = {
+            conclusion: 'A',
+            rule: '∧E1',
+            premises: [andI(ax('A'), ax('B'))],
+        };
+        const result = (0, proof_minify_1.removeUnusedSubproofs)(proof);
+        (0, vitest_1.expect)(result.premises).toHaveLength(1);
+    });
+});
+(0, vitest_1.describe)('proof-minify: estadística general', () => {
+    (0, vitest_1.it)('reduce un árbol con 10 nodos y 2 redundantes a ≤ 8 nodos', () => {
+        // Construimos un árbol con 2 ∧I/∧E1 redundantes.
+        // Layout:
+        //  A_intro = (A ∧ B), elim1 = A
+        //  B_intro = (B ∧ C), elim2 = B
+        //  raíz = (elim1 ∧ elim2)
+        const aIntro = andI(ax('A'), ax('B')); // 3 nodos
+        const aElim = andE1('A', aIntro); // +1 = 4
+        const bIntro = andI(ax('B'), ax('C')); // +3 = 7
+        const bElim = andE1('B', bIntro); // +1 = 8
+        const root = andI(aElim, bElim); // +1 = 9
+        // Añadimos un dead-weight: el árbol original.
+        const proof = {
+            conclusion: root.conclusion,
+            rule: root.rule,
+            premises: [...root.premises, ax('Q')], // +1 hojas dead = 10
+        };
+        const result = (0, proof_minify_1.minifyProof)(proof);
+        (0, vitest_1.expect)(result.original.nodes).toBe(10);
+        // Tras detrivialize, aElim → ax('A'), bElim → ax('B'). Nodos: 10-4 = 6.
+        (0, vitest_1.expect)(result.minified.conclusion).toBe(proof.conclusion);
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThanOrEqual(2);
+        (0, vitest_1.expect)(result.minified.premises.length).toBeLessThanOrEqual(2);
+    });
+});
+(0, vitest_1.describe)('proof-minify: preservación de la raíz', () => {
+    (0, vitest_1.it)('la conclusion de la raíz nunca cambia', () => {
+        const proof = mp('Q', ax('P'), ax('P → Q'));
+        const result = (0, proof_minify_1.minifyProof)(proof);
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('Q');
+    });
+    (0, vitest_1.it)('una hoja se devuelve sin cambios', () => {
+        const leaf = ax('Hello');
+        const result = (0, proof_minify_1.minifyProof)(leaf);
+        (0, vitest_1.expect)(result.minified).toEqual(leaf);
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
+        (0, vitest_1.expect)(result.reduction.percentage).toBe(0);
+    });
+});
+(0, vitest_1.describe)('proof-minify: idempotencia', () => {
+    (0, vitest_1.it)('minify(minify(p)) tiene la misma estructura que minify(p)', () => {
+        const aIntro = andI(ax('A'), ax('B'));
+        const aElim = andE1('A', aIntro);
+        const proof = andI(aElim, ax('C'));
+        const once = (0, proof_minify_1.minifyProof)(proof);
+        const twice = (0, proof_minify_1.minifyProof)(once.minified);
+        // Las claves canónicas deben coincidir.
+        const keyOnce = JSON.stringify(once.minified);
+        const keyTwice = JSON.stringify(twice.minified);
+        (0, vitest_1.expect)(keyOnce).toBe(keyTwice);
+        (0, vitest_1.expect)(twice.reduction.nodesRemoved).toBe(0);
+    });
+    (0, vitest_1.it)('idempotencia en cadena MP compactada', () => {
+        const s1 = mp('B', ax('A'), ax('A → B'));
+        const s2 = mp('C', s1, ax('B → C'));
+        const s3 = mp('D', s2, ax('C → D'));
+        const once = (0, proof_minify_1.minifyProof)(s3);
+        const twice = (0, proof_minify_1.minifyProof)(once.minified);
+        (0, vitest_1.expect)(JSON.stringify(once.minified)).toBe(JSON.stringify(twice.minified));
+    });
+    (0, vitest_1.it)('idempotencia sobre prueba ya minimal', () => {
+        const leaf = ax('A');
+        const r1 = (0, proof_minify_1.minifyProof)(leaf);
+        const r2 = (0, proof_minify_1.minifyProof)(r1.minified);
+        (0, vitest_1.expect)(r2.iterations).toBeLessThanOrEqual(2);
+        (0, vitest_1.expect)(r2.reduction.nodesRemoved).toBe(0);
+    });
+});
+(0, vitest_1.describe)('proof-minify: opciones', () => {
+    (0, vitest_1.it)('rules=[] no aplica ninguna reducción', () => {
+        const aElim = andE1('A', andI(ax('A'), ax('B')));
+        const result = (0, proof_minify_1.minifyProof)(aElim, { rules: [] });
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
+        (0, vitest_1.expect)(result.minified.rule).toBe('∧E1');
+    });
+    (0, vitest_1.it)('maxIterations=1 limita las pasadas globales', () => {
+        const aElim = andE1('A', andI(ax('A'), ax('B')));
+        const result = (0, proof_minify_1.minifyProof)(aElim, { maxIterations: 1 });
+        (0, vitest_1.expect)(result.iterations).toBe(1);
+    });
+    (0, vitest_1.it)('rules selectivo: sólo compact-mp no afecta árboles sin MP', () => {
+        const proof = andI(ax('A'), ax('B'));
+        const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['compact-mp'] });
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBe(0);
+    });
+    (0, vitest_1.it)('rules selectivo: sólo detrivialize en árbol con ∧I/∧E', () => {
+        const proof = andE1('A', andI(ax('A'), ax('B')));
+        const result = (0, proof_minify_1.minifyProof)(proof, { rules: ['detrivialize'] });
+        (0, vitest_1.expect)(result.minified.rule).toBe('axiom');
+    });
+});
+(0, vitest_1.describe)('proof-minify: dedup de premisas', () => {
+    (0, vitest_1.it)('elimina premisas duplicadas estructurales', () => {
+        // ∧I con dos premisas idénticas (caso degenerado pero válido).
+        const dup = {
+            conclusion: 'A ∧ A',
+            rule: '∧I',
+            premises: [ax('A'), ax('A')],
+        };
+        const result = (0, proof_minify_1.minifyProof)(dup, { rules: ['detrivialize'] });
+        (0, vitest_1.expect)(result.minified.premises).toHaveLength(1);
+    });
+});
+(0, vitest_1.describe)('proof-minify: input no se muta', () => {
+    (0, vitest_1.it)('el árbol original queda intacto', () => {
+        const original = andE1('A', andI(ax('A'), ax('B')));
+        const snapshot = JSON.stringify(original);
+        (0, proof_minify_1.minifyProof)(original);
+        (0, vitest_1.expect)(JSON.stringify(original)).toBe(snapshot);
+    });
+});
+(0, vitest_1.describe)('proof-minify: integración multi-regla', () => {
+    (0, vitest_1.it)('combina detrivialize + compact-mp + remove-unused', () => {
+        // Construye: weaken con premisas extras, cadena MP dentro, ∧E∘∧I.
+        const aElim = andE1('A', andI(ax('A'), ax('B')));
+        const s1 = mp('B', aElim, ax('A → B'));
+        const s2 = mp('C', s1, ax('B → C'));
+        const root = weaken('C', s2, ax('IRRELEVANTE_Z'));
+        const result = (0, proof_minify_1.minifyProof)(root);
+        (0, vitest_1.expect)(result.minified.conclusion).toBe('C');
+        // La premisa irrelevante debe haberse podado.
+        (0, vitest_1.expect)(result.reduction.nodesRemoved).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('punto fijo alcanzado antes de maxIterations', () => {
+        const proof = mp('B', ax('A'), ax('A → B'));
+        const result = (0, proof_minify_1.minifyProof)(proof, { maxIterations: 100 });
+        (0, vitest_1.expect)(result.iterations).toBeLessThanOrEqual(2);
+    });
+});
+(0, vitest_1.describe)('proof-minify: métricas', () => {
+    (0, vitest_1.it)('percentage es 0 para una hoja', () => {
+        const result = (0, proof_minify_1.minifyProof)(ax('X'));
+        (0, vitest_1.expect)(result.reduction.percentage).toBe(0);
+    });
+    (0, vitest_1.it)('percentage > 0 cuando hay reducción', () => {
+        const aElim = andE1('A', andI(ax('A'), ax('B')));
+        const result = (0, proof_minify_1.minifyProof)(aElim);
+        (0, vitest_1.expect)(result.reduction.percentage).toBeGreaterThan(0);
+    });
+    (0, vitest_1.it)('depthDelta > 0 al compactar cadena MP', () => {
+        const s1 = mp('B', ax('A'), ax('A → B'));
+        const s2 = mp('C', s1, ax('B → C'));
+        const s3 = mp('D', s2, ax('C → D'));
+        const result = (0, proof_minify_1.minifyProof)(s3);
+        (0, vitest_1.expect)(result.reduction.depthDelta).toBeGreaterThan(0);
+    });
+});
+//# sourceMappingURL=minify.test.js.map

package/dist/tests/proof-minify/minify.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"minify.test.js","sourceRoot":"","sources":["../../../src/tests/proof-minify/minify.test.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gCAAgC;AAChC,+DAA+D;;AAE/D,mCAA8C;AAC9C,6DAKoC;AAEpC,gEAAgE;AAEhE,SAAS,EAAE,CAAC,UAAkB;IAC5B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AACrD,CAAC;AACD,SAAS,GAAG,CAAC,UAAkB;IAC7B,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;AAC1D,CAAC;AACD,SAAS,EAAE,CAAC,UAAkB,EAAE,GAAqB,EAAE,IAAsB;IAC3E,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;AAC3D,CAAC;AACD,SAAS,IAAI,CAAC,IAAsB,EAAE,KAAuB;IAC3D,OAAO;QACL,UAAU,EAAE,GAAG,IAAI,CAAC,UAAU,MAAM,KAAK,CAAC,UAAU,EAAE;QACtD,IAAI,EAAE,IAAI;QACV,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC;KACxB,CAAC;AACJ,CAAC;AACD,SAAS,KAAK,CAAC,QAAgB,EAAE,IAAsB;IACrD,OAAO,EAAE,UAAU,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;AACjE,CAAC;AACD,SAAS,GAAG,CACV,UAAkB,EAClB,IAAsB,EACtB,KAAuB;IAEvB,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;AAC9D,CAAC;AACD,SAAS,MAAM,CAAC,UAAkB,EAAE,GAAG,QAA4B;IACjE,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;AACrD,CAAC;AAED,gEAAgE;AAEhE,IAAA,iBAAQ,EAAC,8BAA8B,EAAE,GAAG,EAAE;IAC5C,IAAA,WAAE,EAAC,gEAAgE,EAAE,GAAG,EAAE;QACxE,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,oBAAoB;QACtE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,GAAG,EAAE;IAChD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,6CAA6C;QAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,uEAAuE;QACvE,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC3C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,8CAA8C,EAAE,GAAG,EAAE;QACtD,iCAAiC;QACjC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC1C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAE1C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QACtD,IAAA,eAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,QAAS,CAAC,KAAkB,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QACvF,mDAAmD;QACnD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sDAAsD,EAAE,GAAG,EAAE;QAC9D,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAA,sCAAuB,EAAC,KAAK,CAAC,CAAC;QAC9C,2DAA2D;QAC3D,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,sCAAuB,EAAC,KAAK,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,qCAAqC,EAAE,GAAG,EAAE;IACnD,IAAA,WAAE,EAAC,+CAA+C,EAAE,GAAG,EAAE;QACvD,wEAAwE;QACxE,MAAM,WAAW,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,WAAW,CAAC,CAAC;QACrD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,YAAY,EAAE,EAAE,KAAK,EAAE,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QAC/E,kEAAkE;QAClE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,oDAAoD,EAAE,GAAG,EAAE;QAC5D,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,uBAAuB,CAAC,EAAE,CAAC,CAAC;QACxE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,4CAA4C,EAAE,GAAG,EAAE;QACpD,8DAA8D;QAC9D,MAAM,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,YAAY,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC7B,MAAM,SAAS,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;QACjE,MAAM,MAAM,GAAG,IAAA,oCAAqB,EAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/C,4CAA4C;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,UAAU,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,KAAK,GAAqB;YAC9B,UAAU,EAAE,GAAG;YACf,IAAI,EAAE,KAAK;YACX,QAAQ,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;SACnC,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,oCAAqB,EAAC,KAAK,CAAC,CAAC;QAC5C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,mCAAmC,EAAE,GAAG,EAAE;IACjD,IAAA,WAAE,EAAC,0DAA0D,EAAE,GAAG,EAAE;QAClE,iDAAiD;QACjD,UAAU;QACV,gCAAgC;QAChC,gCAAgC;QAChC,0BAA0B;QAC1B,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU;QACjD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS;QAC3C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;QAChD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,SAAS;QAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,SAAS;QAC1C,8CAA8C;QAC9C,MAAM,KAAK,GAAqB;YAC9B,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,qBAAqB;SAC7D,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,wEAAwE;QACxE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAChE,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,kCAAkC,EAAE,GAAG,EAAE;QAC1C,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACtC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,4BAA4B,EAAE,GAAG,EAAE;IAC1C,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,wCAAwC;QACxC,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC9C,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAA,eAAM,EAAC,OAAO,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC7E,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,IAAI,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QAC7B,MAAM,EAAE,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,EAAE,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAA,eAAM,EAAC,EAAE,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;QACjD,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,CAAC;QACxD,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,2DAA2D,EAAE,GAAG,EAAE;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uDAAuD,EAAE,GAAG,EAAE;QAC/D,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC/D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,iCAAiC,EAAE,GAAG,EAAE;IAC/C,IAAA,WAAE,EAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,+DAA+D;QAC/D,MAAM,GAAG,GAAqB;YAC5B,UAAU,EAAE,OAAO;YACnB,IAAI,EAAE,IAAI;YACV,QAAQ,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC;SAC7B,CAAC;QACF,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,GAAG,EAAE,EAAE,KAAK,EAAE,CAAC,cAAc,CAAC,EAAE,CAAC,CAAC;QAC7D,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,gCAAgC,EAAE,GAAG,EAAE;IAC9C,IAAA,WAAE,EAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;QAC1C,IAAA,0BAAW,EAAC,QAAQ,CAAC,CAAC;QACtB,IAAA,eAAM,EAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,uCAAuC,EAAE,GAAG,EAAE;IACrD,IAAA,WAAE,EAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,kEAAkE;QAClE,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACvC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,IAAI,CAAC,CAAC;QACjC,IAAA,eAAM,EAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,8CAA8C;QAC9C,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,EAAE,EAAE,aAAa,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1D,IAAA,eAAM,EAAC,MAAM,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,IAAA,iBAAQ,EAAC,wBAAwB,EAAE,GAAG,EAAE;IACtC,IAAA,WAAE,EAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACpC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,KAAK,CAAC,CAAC;QAClC,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;IAEH,IAAA,WAAE,EAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACzC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,EAAE,GAAG,EAAE,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,IAAA,0BAAW,EAAC,EAAE,CAAC,CAAC;QAC/B,IAAA,eAAM,EAAC,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/tests/substructural/prover.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=prover.test.d.ts.map

package/dist/tests/substructural/prover.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prover.test.d.ts","sourceRoot":"","sources":["../../../src/tests/substructural/prover.test.ts"],"names":[],"mappings":""}

package/dist/tests/substructural/prover.test.js

@@ -0,0 +1,271 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const vitest_1 = require("vitest");
+const substructural_1 = require("../../profiles/substructural");
+// --- Helpers de construccion ---
+const atom = (name) => ({ kind: 'atom', name });
+const tensor = (a, b) => ({
+    kind: 'tensor',
+    left: a,
+    right: b,
+});
+const lolli = (a, b) => ({
+    kind: 'lollipop',
+    left: a,
+    right: b,
+});
+const wWith = (a, b) => ({
+    kind: 'with',
+    left: a,
+    right: b,
+});
+const plus = (a, b) => ({
+    kind: 'plus',
+    left: a,
+    right: b,
+});
+const bang = (a) => ({ kind: 'bang', arg: a });
+const ONE = { kind: 'one' };
+const A = atom('A');
+const B = atom('B');
+const C = atom('C');
+function rules(tree) {
+    if (!tree)
+        return [];
+    const out = [tree.rule];
+    for (const p of tree.premises)
+        out.push(...rules(p));
+    return out;
+}
+// ============================================================
+// LINEAR LOGIC
+// ============================================================
+(0, vitest_1.describe)('Linear logic — fragmento basico', () => {
+    (0, vitest_1.it)('demuestra A ⊸ A (identidad)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, A)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(rules(proof)).toContain('lollipopR');
+        (0, vitest_1.expect)(rules(proof)).toContain('axiom');
+    });
+    (0, vitest_1.it)('demuestra ⊢ 1 (unit)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [ONE] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(proof?.rule).toBe('oneR');
+    });
+    (0, vitest_1.it)('demuestra A ⊸ (1 ⊸ A) (curry trivial con 1)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, lolli(ONE, A))] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+});
+(0, vitest_1.describe)('Linear logic — multiplicativos (⊗, ⊸)', () => {
+    (0, vitest_1.it)('demuestra conmutatividad: A ⊗ B ⊸ B ⊗ A', () => {
+        const proof = (0, substructural_1.proveLinear)({
+            left: [],
+            right: [lolli(tensor(A, B), tensor(B, A))],
+        });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        const r = rules(proof);
+        (0, vitest_1.expect)(r).toContain('lollipopR');
+        (0, vitest_1.expect)(r).toContain('tensorL');
+        (0, vitest_1.expect)(r).toContain('tensorR');
+    });
+    (0, vitest_1.it)('demuestra asociatividad: A ⊗ (B ⊗ C) ⊸ (A ⊗ B) ⊗ C', () => {
+        const proof = (0, substructural_1.proveLinear)({
+            left: [],
+            right: [lolli(tensor(A, tensor(B, C)), tensor(tensor(A, B), C))],
+        });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+    (0, vitest_1.it)('NO demuestra A ⊸ A ⊗ A (no contraction)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, tensor(A, A))] });
+        (0, vitest_1.expect)(proof).toBeNull();
+    });
+    (0, vitest_1.it)('NO demuestra A ⊗ B ⊸ A (no weakening en linear)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(tensor(A, B), A)] });
+        (0, vitest_1.expect)(proof).toBeNull();
+    });
+    (0, vitest_1.it)('demuestra modus ponens lineal: A ⊗ (A ⊸ B) ⊸ B', () => {
+        const proof = (0, substructural_1.proveLinear)({
+            left: [],
+            right: [lolli(tensor(A, lolli(A, B)), B)],
+        });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+    (0, vitest_1.it)('demuestra composicion: (A ⊸ B) ⊗ (B ⊸ C) ⊸ (A ⊸ C)', () => {
+        const proof = (0, substructural_1.proveLinear)({
+            left: [],
+            right: [lolli(tensor(lolli(A, B), lolli(B, C)), lolli(A, C))],
+        });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+});
+(0, vitest_1.describe)('Linear logic — aditivos (&, ⊕)', () => {
+    (0, vitest_1.it)('demuestra A & B ⊸ A (proyeccion 1, with permite descartar uno)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(wWith(A, B), A)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(rules(proof)).toContain('withL1');
+    });
+    (0, vitest_1.it)('demuestra A & B ⊸ B (proyeccion 2)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(wWith(A, B), B)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(rules(proof)).toContain('withL2');
+    });
+    (0, vitest_1.it)('demuestra A ⊸ A ⊕ B (inyeccion 1)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, plus(A, B))] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(rules(proof)).toContain('plusR1');
+    });
+    (0, vitest_1.it)('demuestra A ⊸ B ⊕ A (inyeccion 2)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, plus(B, A))] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(rules(proof)).toContain('plusR2');
+    });
+    (0, vitest_1.it)('NO demuestra A ⊕ B ⊸ A (sin info de cual lado del plus)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(plus(A, B), A)] });
+        (0, vitest_1.expect)(proof).toBeNull();
+    });
+    (0, vitest_1.it)('NO demuestra A ⊸ A & B (B no es derivable de A)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, wWith(A, B))] });
+        (0, vitest_1.expect)(proof).toBeNull();
+    });
+});
+(0, vitest_1.describe)('Linear logic — exponencial bang (!)', () => {
+    (0, vitest_1.it)('demuestra !A ⊸ A (dereliction)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(bang(A), A)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        // El prover usa la zona unrestricted: bangL promueve a Σ, luego
+        // axioma desde Σ. Cualquier ruta correcta cuenta.
+        const r = rules(proof);
+        (0, vitest_1.expect)(r).toContain('bangL');
+        (0, vitest_1.expect)(r).toContain('axiom');
+    });
+    (0, vitest_1.it)('demuestra !A ⊸ A ⊗ A (contraction via bang)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(bang(A), tensor(A, A))] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        // La "contraction" se realiza implicitamente al copiar dos veces
+        // desde la zona unrestricted Σ via derelictionL.
+        const r = rules(proof);
+        (0, vitest_1.expect)(r).toContain('bangL');
+        (0, vitest_1.expect)(r).toContain('tensorR');
+        // Dos copias de A desde Σ:
+        const derelicts = r.filter((x) => x === 'derelictionL').length;
+        const axioms = r.filter((x) => x === 'axiom').length;
+        (0, vitest_1.expect)(derelicts + axioms).toBeGreaterThanOrEqual(2);
+    });
+    (0, vitest_1.it)('demuestra !A ⊸ 1 (weakening via bang)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(bang(A), ONE)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+    (0, vitest_1.it)('demuestra !A ⊗ !B ⊸ !B ⊗ !A (conmutatividad sobre !)', () => {
+        const proof = (0, substructural_1.proveLinear)({
+            left: [],
+            right: [lolli(tensor(bang(A), bang(B)), tensor(bang(B), bang(A)))],
+        });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+    (0, vitest_1.it)('NO demuestra A ⊸ !A (no se puede promover sin contexto bang)', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, bang(A))] });
+        (0, vitest_1.expect)(proof).toBeNull();
+    });
+});
+// ============================================================
+// AFFINE LOGIC
+// ============================================================
+(0, vitest_1.describe)('Affine logic — weakening permitido', () => {
+    (0, vitest_1.it)('demuestra A ⊗ B ⊸ A (weakening descarta B)', () => {
+        const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(tensor(A, B), A)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(rules(proof)).toContain('weakening');
+    });
+    (0, vitest_1.it)('demuestra A ⊗ B ⊸ B (weakening descarta A)', () => {
+        const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(tensor(A, B), B)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+    (0, vitest_1.it)('demuestra A ⊸ 1 (todo es descartable en afin)', () => {
+        const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(A, ONE)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+    (0, vitest_1.it)('demuestra A ⊗ B ⊗ C ⊸ A (multi-weakening)', () => {
+        const proof = (0, substructural_1.proveAffine)({
+            left: [],
+            right: [lolli(tensor(A, tensor(B, C)), A)],
+        });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+    (0, vitest_1.it)('preserva validez lineal: A ⊸ A es valido en afin', () => {
+        const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(A, A)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+});
+(0, vitest_1.describe)('Affine logic — contraction sigue prohibida', () => {
+    (0, vitest_1.it)('NO demuestra A ⊸ A ⊗ A (no contraction en afin)', () => {
+        const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(A, tensor(A, A))] });
+        (0, vitest_1.expect)(proof).toBeNull();
+    });
+    (0, vitest_1.it)('NO demuestra A ⊸ A & A si A es atomo (no, with si admite)', () => {
+        // Trampa: A ⊸ A & A SI es valido en afin/linear porque
+        // with usa el MISMO contexto en ambas ramas (no duplica).
+        const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(A, wWith(A, A))] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+    (0, vitest_1.it)('SI demuestra (!A) ⊸ A ⊗ A en afin (bang permite contraction)', () => {
+        const proof = (0, substructural_1.proveAffine)({ left: [], right: [lolli(bang(A), tensor(A, A))] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+    });
+});
+// ============================================================
+// LINEAR vs AFFINE — discriminacion
+// ============================================================
+(0, vitest_1.describe)('Discriminacion entre linear y afin', () => {
+    (0, vitest_1.it)('A ⊗ B ⊸ A: NO en linear, SI en afin', () => {
+        const seq = { left: [], right: [lolli(tensor(A, B), A)] };
+        (0, vitest_1.expect)((0, substructural_1.proveLinear)(seq)).toBeNull();
+        (0, vitest_1.expect)((0, substructural_1.proveAffine)(seq)).not.toBeNull();
+    });
+    (0, vitest_1.it)('A ⊸ A ⊗ A: NO en linear, NO en afin', () => {
+        const seq = { left: [], right: [lolli(A, tensor(A, A))] };
+        (0, vitest_1.expect)((0, substructural_1.proveLinear)(seq)).toBeNull();
+        (0, vitest_1.expect)((0, substructural_1.proveAffine)(seq)).toBeNull();
+    });
+    (0, vitest_1.it)('A ⊸ A: SI en linear, SI en afin', () => {
+        const seq = { left: [], right: [lolli(A, A)] };
+        (0, vitest_1.expect)((0, substructural_1.proveLinear)(seq)).not.toBeNull();
+        (0, vitest_1.expect)((0, substructural_1.proveAffine)(seq)).not.toBeNull();
+    });
+});
+// ============================================================
+// Estructura de la prueba
+// ============================================================
+(0, vitest_1.describe)('Forma de las pruebas', () => {
+    (0, vitest_1.it)('la conclusion de la prueba coincide con el secuente pedido', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, A)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        if (!proof)
+            return;
+        (0, vitest_1.expect)(proof.conclusion.left.length).toBe(0);
+        (0, vitest_1.expect)(proof.conclusion.right.length).toBe(1);
+        const first = proof.conclusion.right[0];
+        (0, vitest_1.expect)(first?.kind).toBe('lollipop');
+    });
+    (0, vitest_1.it)('axiom tiene cero premisas', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [A], right: [A] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        (0, vitest_1.expect)(proof?.rule).toBe('axiom');
+        (0, vitest_1.expect)(proof?.premises.length).toBe(0);
+    });
+    (0, vitest_1.it)('lollipopR tiene exactamente una premisa', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [], right: [lolli(A, A)] });
+        const lolliNode = proof?.rule === 'lollipopR' ? proof : null;
+        (0, vitest_1.expect)(lolliNode).not.toBeNull();
+        (0, vitest_1.expect)(lolliNode?.premises.length).toBe(1);
+    });
+    (0, vitest_1.it)('tensorR ramifica en 2 premisas', () => {
+        const proof = (0, substructural_1.proveLinear)({ left: [A, B], right: [tensor(A, B)] });
+        (0, vitest_1.expect)(proof).not.toBeNull();
+        if (!proof)
+            return;
+        (0, vitest_1.expect)(proof.rule).toBe('tensorR');
+        (0, vitest_1.expect)(proof.premises.length).toBe(2);
+    });
+});
+//# sourceMappingURL=prover.test.js.map