@stevenvo780/st-lang 2.0.4 → 2.5.0

package/dist/profiles/arithmetic/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/arithmetic/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D;AAC/D,sEAAsE;AACtE,wDAAwD;AACxD,EAAE;AACF,0BAA0B;AAC1B,EAAE;AACF,qEAAqE;AACrE,iEAAiE;AACjE,+DAA+D;;;AA4B/D,kCAmDC;AArED,4BAA4B;AAE5B,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAC/B,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,QAAQ,EAAE,QAAQ;IAC3D,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY;CAC3C,CAAC,CAAC;AAEH,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IAC/B,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY;CAC3C,CAAC,CAAC;AAEH,8BAA8B;AAE9B;;;;GAIG;AACH,SAAgB,WAAW,CAAC,CAAU,EAAE,IAA0B;IAChE,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,yCAAyC;YACzC,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAE,CAAC;YAC3B,CAAC;YACD,oCAAoC;YACpC,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,MAAM,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;YACxC,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YACxB,OAAO,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QACD,8CAA8C;QAC9C,KAAK,MAAM;YACT,OAAO,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,KAAK,SAAS;YACZ,OAAO,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/E,KAAK,SAAS;YACZ,OAAO,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChF,KAAK,YAAY;YACf,OAAO,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,IAAK,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAChF;YACE,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CAAC,CAAU,EAAE,IAA0B;IAC5D,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACjC,OAAO,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;IACD,6DAA6D;IAC7D,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IACjC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,gDAAgD;AAChD,SAAS,YAAY,CAAC,CAAU;IAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,SAAS,IAAI,CAAC,IAAa;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAI,IAAI,CAAC,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,CAAC,CAAC,CAAC,CAAC;IACR,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,CAAU;IACrC,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IACnE,IAAI,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;IACrD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iBAAiB;AAEjB,MAAa,iBAAiB;IAC5B,IAAI,GAAG,YAAY,CAAC;IACpB,WAAW,GAAG,4DAA4D,CAAC;IAEnE,MAAM,CAAC,MAA2B,EAAE,MAAc;QACxD,OAAO;YACL,MAAM;YACN,MAAM;YACN,WAAW,EAAE,EAAE;SAChB,CAAC;IACJ,CAAC;IAED,eAAe,CAAC,OAAgB;QAC9B,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,mDAAmD;QACnD,SAAS,IAAI,CAAC,CAAU;YACtB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC/C,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,OAAO,EAAE,IAAI,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;oBACtD,KAAK,CAAC,IAAI,CAAC;wBACT,QAAQ,EAAE,SAAS;wBACnB,OAAO,EAAE,6BAA6B;wBACtC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC;wBACzB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC;qBAC9B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YACD,IAAI,CAAC,CAAC,IAAI;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;oBAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,CAAC;QACd,OAAO,KAAK,CAAC;IACf,CAAC;IAED,UAAU,CAAC,OAAgB;QACzB,2DAA2D;QAC3D,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;YACvC,OAAO,IAAI,CAAC,MAAM,CAChB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAC5B,MAAM,CAAC,CAAC,CAAC,sCAAsC,CAAC,CAAC,CAAC,kCAAkC,CACrF,CAAC;QACJ,CAAC;QAED,oEAAoE;QACpE,OAAO,IAAI,CAAC,MAAM,CAChB,SAAS,EACT,kCAAkC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,0DAA0D,CAClH,CAAC;IACJ,CAAC;IAED,gBAAgB,CAAC,OAAgB;QAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;YACvC,OAAO,IAAI,CAAC,MAAM,CAChB,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,eAAe,EACxC,MAAM;gBACJ,CAAC,CAAC,qDAAqD;gBACvD,CAAC,CAAC,oDAAoD,CACzD,CAAC;QACJ,CAAC;QAED,wEAAwE;QACxE,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,sDAAsD,CAAC,CAAC;IAC5F,CAAC;IAED,KAAK,CAAC,IAAa,EAAE,MAAc;QACjC,2DAA2D;QAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE;YACtC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC9B,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC3C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;oBAChC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,eAAe,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/D,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1C,OAAO,IAAI,CAAC,MAAM,CAChB,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,EACjC,MAAM;gBACJ,CAAC,CAAC,wEAAwE;gBAC1E,CAAC,CAAC,kEAAkE,CACvE,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,CAAC,MAAM,CAChB,SAAS,EACT,qDAAqD,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAClF,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,IAAa,EAAE,QAAkB,EAAE,MAAc;QACtD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAClC,CAAC;IAED,YAAY,CAAC,OAAgB;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;YACvC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,OAAO,IAAI,CAAC,MAAM,CAChB,WAAW,EACX,2DAA2D,CAC5D,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC,MAAM,CAChB,OAAO,EACP,mEAAmE,CACpE,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,CAAC,MAAM,CAChB,SAAS,EACT,sEAAsE,CACvE,CAAC;IACJ,CAAC;IAED,OAAO,CAAC,OAAgB;QACtB,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QAEpC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;YACjC,IAAI,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;gBACvC,OAAO,IAAI,CAAC,MAAM,CAChB,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAC5B,uCAAuC,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,EAAE,CACxE,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC,MAAM,CAChB,OAAO,EACP,qCAAqC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,EAAE,CACvE,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,CAAC,MAAM,CAChB,SAAS,EACT,uCAAuC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,gCAAgC,CAC7F,CAAC;IACJ,CAAC;CACF;AAnJD,8CAmJC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/profiles/arithmetic/index.ts"],"names":[],"mappings":";AAAA,+DAA+D;AAC/D,gDAAgD;AAChD,+DAA+D;AAC/D,sEAAsE;AACtE,wDAAwD;AACxD,EAAE;AACF,0BAA0B;AAC1B,EAAE;AACF,qEAAqE;AACrE,iEAAiE;AACjE,+DAA+D;;;AAU/D,kCA8EC;AApFD,4BAA4B;AAE5B,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,SAAS,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC,CAAC;AAE/E,8BAA8B;AAE9B,SAAgB,WAAW,CAAC,CAAU,EAAE,IAA0B,EAAE,KAAgB;IAClF,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;QACf,KAAK,QAAQ;YACX,OAAO,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QACtB,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,IAAI,CAAC,CAAC,IAAI,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAChC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAW,CAAC;YACpC,CAAC;YACD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,KAAK,CAAC,CAAC,CAAC;YACX,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;YACvD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,UAAU,CAAC,CAAC;YACxD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,UAAU,CAAC,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,mBAAmB,CAAC,CAAC;YACjE,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YACxB,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,aAAa,CAAC,CAAC;YAC3D,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,QAAQ,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,IAAI,CAAC,KAAK,CAAC;gBAAE,OAAO,GAAG,CAAC;YACxB,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,WAAW,CAAC,CAAC;YACzD,OAAO,GAAG,CAAC;QACb,CAAC;QACD,KAAK,MAAM,CAAC,CAAC,CAAC;YACZ,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC;YACtF,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC;YAClB,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC;YACtF,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,SAAS,CAAC,CAAC,CAAC;YACf,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACnB,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC;YACvF,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,YAAY,CAAC,CAAC,CAAC;YAClB,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,CAAC,GAAG,WAAW,CAAE,CAAC,CAAC,IAAkB,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC7D,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;YACnB,IAAI,KAAK;gBAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,gBAAgB,CAAC,CAAC;YACvF,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrB,CAAC;QACD;YACE,OAAO,GAAG,CAAC;IACf,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CAAC,CAAU,EAAE,IAA0B,EAAE,KAAgB;IAC9E,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;QACjC,OAAO,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IAC3C,CAAC;IACD,MAAM,GAAG,GAAG,WAAW,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACxC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC;AAClC,CAAC;AAED,gDAAgD;AAChD,SAAS,YAAY,CAAC,CAAU;IAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,SAAS,IAAI,CAAC,IAAa;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC5D,IAAI,IAAI,CAAC,IAAI;YAAE,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,IAAI;gBAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,CAAC,CAAC,CAAC,CAAC;IACR,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iBAAiB;AAEjB,MAAa,iBAAiB;IAC5B,IAAI,GAAG,YAAY,CAAC;IACpB,WAAW,GAAG,4DAA4D,CAAC;IAEnE,MAAM,CAAC,MAA2B,EAAE,MAAc;QACxD,OAAO;YACL,MAAM;YACN,MAAM;YACN,WAAW,EAAE,EAAE;SAChB,CAAC;IACJ,CAAC;IAED,eAAe,CAAC,OAAgB;QAC9B,MAAM,KAAK,GAAiB,EAAE,CAAC;QAC/B,mDAAmD;QACnD,SAAS,IAAI,CAAC,CAAU;YACtB,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC/C,MAAM,OAAO,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,OAAO,EAAE,IAAI,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;oBACtD,KAAK,CAAC,IAAI,CAAC;wBACT,QAAQ,EAAE,SAAS;wBACnB,OAAO,EAAE,6BAA6B;wBACtC,IAAI,EAAE,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC;wBACzB,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,MAAM,IAAI,CAAC;qBAC9B,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YACD,IAAI,CAAC,CAAC,IAAI;gBAAE,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI;oBAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,CAAC;QACd,OAAO,KAAK,CAAC;IACf,CAAC;IAED,UAAU,CAAC,OAAgB;QACzB,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YACzD,IAAI,MAAM,GAAG,4BAA4B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAC9D,MAAM,IAAI,kBAAkB,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;YAEjE,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC;QAC3D,CAAC;QAED,oEAAoE;QACpE,OAAO,IAAI,CAAC,MAAM,CAChB,SAAS,EACT,kCAAkC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,0DAA0D,CAClH,CAAC;IACJ,CAAC;IAED,gBAAgB,CAAC,OAAgB;QAC/B,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;YACvC,OAAO,IAAI,CAAC,MAAM,CAChB,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,eAAe,EACxC,MAAM;gBACJ,CAAC,CAAC,qDAAqD;gBACvD,CAAC,CAAC,oDAAoD,CACzD,CAAC;QACJ,CAAC;QAED,wEAAwE;QACxE,OAAO,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,sDAAsD,CAAC,CAAC;IAC5F,CAAC;IAED,KAAK,CAAC,IAAa,EAAE,MAAc;QACjC,2DAA2D;QAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;QACvC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,IAAI,EAAE,EAAE;YACtC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC9B,MAAM,YAAY,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC3C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,EAAE,CAAC;oBAChC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBAC/B,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;QACjC,MAAM,eAAe,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/D,IAAI,eAAe,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YAC1C,OAAO,IAAI,CAAC,MAAM,CAChB,MAAM,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,WAAW,EACjC,MAAM;gBACJ,CAAC,CAAC,wEAAwE;gBAC1E,CAAC,CAAC,kEAAkE,CACvE,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,CAAC,MAAM,CAChB,SAAS,EACT,qDAAqD,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAClF,CAAC;IACJ,CAAC;IAED,MAAM,CAAC,IAAa,EAAE,QAAkB,EAAE,MAAc;QACtD,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAClC,CAAC;IAED,YAAY,CAAC,OAAgB;QAC3B,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QACpC,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;YACvC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACZ,OAAO,IAAI,CAAC,MAAM,CAChB,WAAW,EACX,2DAA2D,CAC5D,CAAC;YACJ,CAAC;YACD,OAAO,IAAI,CAAC,MAAM,CAChB,OAAO,EACP,mEAAmE,CACpE,CAAC;QACJ,CAAC;QAED,OAAO,IAAI,CAAC,MAAM,CAChB,SAAS,EACT,sEAAsE,CACvE,CAAC;IACJ,CAAC;IAED,OAAO,CAAC,OAAgB;QACtB,MAAM,KAAK,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC;QAEpC,IAAI,MAAM,GAAG,EAAE,CAAC;QAChB,IAAI,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACrB,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YACnD,MAAM,IAAI,4BAA4B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAC3D,IAAI,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvC,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;gBACvC,MAAM,IAAI,kBAAkB,MAAM,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,MAAM,CAAC;YACvE,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,kBAAkB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC;YACpE,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,IAAI,uCAAuC,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC;QAChF,CAAC;QAED,iBAAiB;QACjB,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,kBAAkB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACvC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,IAAI,8BAA8B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QACrE,CAAC;QAED,aAAa;QACb,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;YAC3B,MAAM,IAAI,+BAA+B,CAAC;YAC1C,MAAM,IAAI,kCAAkC,CAAC;YAC7C,MAAM,IAAI,6CAA6C,CAAC;YACxD,MAAM,IAAI,4BAA4B,CAAC;YACvC,MAAM,IAAI,6BAA6B,CAAC;QAC1C,CAAC;aAAM,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACvC,MAAM,IAAI,yCAAyC,CAAC;YACpD,MAAM,IAAI,kCAAkC,CAAC;YAC7C,MAAM,IAAI,6CAA6C,CAAC;YACxD,MAAM,IAAI,4BAA4B,CAAC;YACvC,MAAM,IAAI,4BAA4B,CAAC;QACzC,CAAC;QAED,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,IAAI,EAAE,IAAI,yBAAyB,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1F,CAAC;CACF;AAtKD,8CAsKC;AAED,SAAS,kBAAkB,CAAC,CAAU,EAAE,KAAe;IACrD,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,IAAI,CAAC,CAAC,IAAI,EAAE,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7C,MAAM,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;YAC/C,OAAO,CAAC,CAAC;QACX,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;YAC/C,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;IAChC,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,EAAE,MAAM,KAAK,CAAC,EAAE,CAAC;QAClD,MAAM,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,CAAC,GAAG,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACrF,KAAK,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;YACtD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;QACtC,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;YACtD,OAAO,CAAC,CAAC;QACX,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,EAAE,CAAC;YACzC,KAAK,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;YACtD,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC;IAChC,CAAC;IACD,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QACX,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,kBAAkB,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;IACtE,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC"}

package/dist/profiles/classical/first-order.d.ts

@@ -1,4 +1,6 @@
 import { Formula, Diagnostic, RunResult, Theory, LogicProfile } from '../../types';
+export declare function toPrenex(f: Formula): Formula;
+export declare function skolemize(f: Formula): Formula;
 export declare class ClassicalFirstOrder implements LogicProfile {
     readonly name = "classical.first_order";
     readonly description = "Logica clasica de primer orden (FOL) \u2014 Motor de Tableau v2";

package/dist/profiles/classical/first-order.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"first-order.d.ts","sourceRoot":"","sources":["../../../src/profiles/classical/first-order.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAOnF,qBAAa,mBAAoB,YAAW,YAAY;IACtD,QAAQ,CAAC,IAAI,2BAA2B;IACxC,QAAQ,CAAC,WAAW,qEAAgE;IAEpF,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,UAAU,EAAE;IAa/C,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAavC,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAW7C,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAe/C,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAcpE,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAGzC,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAIpC,eAAe,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,SAAS;IAelD,OAAO,CAAC,KAAK;IAYb,OAAO,CAAC,cAAc;IAuOtB,OAAO,CAAC,WAAW;IAGnB,OAAO,CAAC,UAAU;IAalB,OAAO,CAAC,OAAO;CAgBhB"}
+{"version":3,"file":"first-order.d.ts","sourceRoot":"","sources":["../../../src/profiles/classical/first-order.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,aAAa,CAAC;AAkBnF,wBAAgB,QAAQ,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CAqC5C;AAED,wBAAgB,SAAS,CAAC,CAAC,EAAE,OAAO,GAAG,OAAO,CA+B7C;AAOD,qBAAa,mBAAoB,YAAW,YAAY;IACtD,QAAQ,CAAC,IAAI,2BAA2B;IACxC,QAAQ,CAAC,WAAW,qEAAgE;IAEpF,eAAe,CAAC,OAAO,EAAE,OAAO,GAAG,UAAU,EAAE;IAa/C,UAAU,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAevC,gBAAgB,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAW7C,KAAK,CAAC,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAiB/C,MAAM,CAAC,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS;IAsFpE,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAiEzC,OAAO,CAAC,OAAO,EAAE,OAAO,GAAG,SAAS;IAmHpC,eAAe,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,GAAG,SAAS;IAelD,OAAO,CAAC,KAAK;IAcb,OAAO,CAAC,cAAc;IAuRtB,OAAO,CAAC,WAAW;IAGnB,OAAO,CAAC,UAAU;IAYlB,OAAO,CAAC,OAAO;CAgBhB"}

package/dist/profiles/classical/first-order.js

@@ -4,7 +4,86 @@
 // ============================================================
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.ClassicalFirstOrder = void 0;
+exports.toPrenex = toPrenex;
+exports.skolemize = skolemize;
 const propositional_1 = require("./propositional");
+// ── Transforms ─────────────────────────────────────────────────────────────
+let varCounter = 0;
+function getNewVar() {
+    return `v${varCounter++}`;
+}
+let skolemCounter = 0;
+function getSkolem(isFunc) {
+    return isFunc ? `f${skolemCounter++}` : `c${skolemCounter++}`;
+}
+function toPrenex(f) {
+    const nnf = (0, propositional_1.toNNF)(f);
+    function rename(node, mapping) {
+        if (node.kind === 'forall' || node.kind === 'exists') {
+            const v = node.variable;
+            const nv = getNewVar();
+            const newMap = new Map(mapping).set(v, nv);
+            return { ...node, variable: nv, args: [rename((node.args || [])[0], newMap)] };
+        }
+        if (node.kind === 'predicate') {
+            return { ...node, params: (node.params || []).map((p) => mapping.get(p) || p) };
+        }
+        if (node.args) {
+            return { ...node, args: node.args.map((a) => rename(a, mapping)) };
+        }
+        return node;
+    }
+    const renamed = rename(nnf, new Map());
+    const quantifiers = [];
+    function extract(node) {
+        if (node.kind === 'forall' || node.kind === 'exists') {
+            quantifiers.push({ kind: node.kind, v: node.variable });
+            return extract((node.args || [])[0]);
+        }
+        if (node.args) {
+            return { ...node, args: node.args.map(extract) };
+        }
+        return node;
+    }
+    const matrix = extract(renamed);
+    let res = matrix;
+    for (let i = quantifiers.length - 1; i >= 0; i--) {
+        res = { kind: quantifiers[i].kind, variable: quantifiers[i].v, args: [res] };
+    }
+    return res;
+}
+function skolemize(f) {
+    const prenex = toPrenex(f);
+    const foralls = [];
+    function process(node) {
+        if (node.kind === 'forall') {
+            foralls.push(node.variable);
+            const inner = process((node.args || [])[0]);
+            foralls.pop();
+            return { ...node, args: [inner] };
+        }
+        if (node.kind === 'exists') {
+            const v = node.variable;
+            const isFunc = foralls.length > 0;
+            const skName = getSkolem(isFunc);
+            const replaceStr = isFunc ? `${skName}(${foralls.join(',')})` : skName;
+            function rep(n) {
+                if (n.kind === 'predicate') {
+                    return { ...n, params: (n.params || []).map((p) => (p === v ? replaceStr : p)) };
+                }
+                if (n.args)
+                    return { ...n, args: n.args.map(rep) };
+                return n;
+            }
+            return process(rep((node.args || [])[0]));
+        }
+        return node;
+    }
+    const rawMatrix = process(prenex);
+    // Restore remaining foralls (Skolemization removes existentials, keeps foralls usually implicitly but we make them explicit)
+    const finalRes = rawMatrix;
+    return finalRes; // Simplification: we just return the matrix, standard skolemization implicitly universalizes
+}
 class ClassicalFirstOrder {
     name = 'classical.first_order';
     description = 'Logica clasica de primer orden (FOL) — Motor de Tableau v2';
@@ -22,19 +101,21 @@ class ClassicalFirstOrder {
     }
     checkValid(formula) {
         const negated = (0, propositional_1.toNNF)({ kind: 'not', args: [formula] });
-        const isClosed = this.solve([{ formula: negated }]);
+        const res = this.solve([{ formula: negated }]);
+        const isClosed = res.closed;
         return {
-            status: isClosed ? 'valid' : 'unknown',
+            status: isClosed ? 'valid' : 'invalid',
             output: isClosed
-                ? `${(0, propositional_1.formulaToString)(formula)} es VALIDA en FOL`
-                : `${(0, propositional_1.formulaToString)(formula)} no demostrada`,
+                ? `${(0, propositional_1.formulaToString)(formula)} es VÁLIDA en FOL`
+                : `${(0, propositional_1.formulaToString)(formula)} NO es válida (tiene un contramodelo)`,
+            tableauTrace: res.trace,
             diagnostics: [],
             formula,
         };
     }
     checkSatisfiable(formula) {
         const nnf = (0, propositional_1.toNNF)(formula);
-        const isClosed = this.solve([{ formula: nnf }]);
+        const isClosed = this.solve([{ formula: nnf }]).closed;
         return {
             status: !isClosed ? 'satisfiable' : 'unsatisfiable',
             output: !isClosed ? `Satisfacible` : `Insatisfacible`,
@@ -48,32 +129,256 @@ class ClassicalFirstOrder {
             ...axioms.map((a) => ({ formula: (0, propositional_1.toNNF)(a) })),
             { formula: (0, propositional_1.toNNF)({ kind: 'not', args: [goal] }) },
         ];
-        const isClosed = this.solve(nodes);
+        const res = this.solve(nodes);
+        const isClosed = res.closed;
         return {
             status: isClosed ? 'provable' : 'refutable',
             output: isClosed ? 'Demostrado' : 'No demostrable',
+            tableauTrace: res.trace,
             diagnostics: [],
             formula: goal,
         };
     }
     derive(goal, premises, theory) {
-        const formulas = premises.map((p) => theory.axioms.get(p)).filter((f) => !!f);
+        const formulas = premises
+            .map((p) => theory.axioms.get(p) || theory.theorems.get(p))
+            .filter((f) => !!f);
         const nodes = [
             ...formulas.map((f) => ({ formula: (0, propositional_1.toNNF)(f) })),
             { formula: (0, propositional_1.toNNF)({ kind: 'not', args: [goal] }) },
         ];
+        const res = this.solve(nodes);
+        // Build proof steps from tableau trace
+        const proof = { goal, steps: [], status: 'incomplete' };
+        let stepNum = 0;
+        // Add premises as steps
+        for (let i = 0; i < premises.length; i++) {
+            stepNum++;
+            const f = formulas[i];
+            if (f) {
+                proof.steps.push({
+                    stepNumber: stepNum,
+                    formula: f,
+                    justification: `Premisa (${premises[i]})`,
+                    premises: [],
+                });
+            }
+        }
+        // Parse tableau trace to extract named quantifier rules
+        for (const traceLine of res.trace) {
+            if (traceLine.includes('Instanciación Universal UI') ||
+                traceLine.includes('Gamma') ||
+                traceLine.includes('gamma')) {
+                stepNum++;
+                proof.steps.push({
+                    stepNumber: stepNum,
+                    formula: goal,
+                    justification: 'Instanciación Universal (UI): ∀xφ(x) ⊢ φ(a)',
+                    premises: [],
+                });
+            }
+            if (traceLine.includes('Instanciación Existencial EI') ||
+                traceLine.includes('Delta') ||
+                traceLine.includes('delta')) {
+                stepNum++;
+                proof.steps.push({
+                    stepNumber: stepNum,
+                    formula: goal,
+                    justification: 'Instanciación Existencial (EI): ∃xφ(x) ⊢ φ(c) [c nueva]',
+                    premises: [],
+                });
+            }
+        }
+        // Final step
+        if (res.closed) {
+            stepNum++;
+            proof.steps.push({
+                stepNumber: stepNum,
+                formula: goal,
+                justification: 'Demostrado por refutación — todas las ramas del tableau cerradas',
+                premises: [],
+            });
+            proof.status = 'complete';
+        }
+        const output = res.closed
+            ? `Derivado con éxito mediante tableau de primer orden.\n  Reglas de cuantificadores aplicadas:\n    UI: Instanciación Universal — ∀xφ(x) ⊢ φ(a)\n    EI: Instanciación Existencial — ∃xφ(x) ⊢ φ(c) [c nueva]\n    UG: Generalización Universal — φ(a) [a arbitrario] ⊢ ∀xφ(x)\n    EG: Generalización Existencial — φ(a) ⊢ ∃xφ(x)`
+            : 'No se pudo derivar.';
         return {
-            status: this.solve(nodes) ? 'provable' : 'refutable',
-            output: 'Derivacion',
+            status: res.closed ? 'provable' : 'refutable',
+            output,
+            proof: res.closed ? proof : undefined,
+            tableauTrace: res.trace,
+            reasoningType: res.closed ? 'Tableau de primer orden (refutación)' : undefined,
+            reasoningSchema: res.closed ? 'Γ, ¬φ ⊢ ⊥  ∴  Γ ⊢ φ' : undefined,
             diagnostics: [],
             formula: goal,
         };
     }
     countermodel(formula) {
-        return this.checkValid(formula);
+        const nnf = (0, propositional_1.toNNF)(formula);
+        const res = this.solve([{ formula: { kind: 'not', args: [nnf] } }]);
+        if (!res.closed) {
+            // Extract domain and interpretation from open branch trace
+            const domain = new Set();
+            const interpretations = new Map();
+            for (const line of res.trace) {
+                // Collect constants mentioned in trace
+                const constMatch = line.match(/\b(c\d+|[a-d])\b/g);
+                if (constMatch) {
+                    for (const c of constMatch)
+                        domain.add(c);
+                }
+            }
+            if (domain.size === 0)
+                domain.add('a');
+            // Build output
+            let output = `Contramodelo encontrado:\n`;
+            output += `  Dominio D = {${Array.from(domain).join(', ')}}\n`;
+            output += `  Interpretación:\n`;
+            // Collect predicates from formula
+            const preds = new Map();
+            const collectPreds = (f) => {
+                if (f.kind === 'predicate' && f.name) {
+                    preds.set(f.name, (f.params || []).length);
+                }
+                f.args?.forEach(collectPreds);
+            };
+            collectPreds(formula);
+            for (const [pred, arity] of preds) {
+                const interp = interpretations.get(pred);
+                if (interp && interp.size > 0) {
+                    output += `    ${pred} = {${Array.from(interp).join(', ')}} (aridad ${arity})\n`;
+                }
+                else {
+                    output += `    ${pred} = {} (vacío, aridad ${arity})\n`;
+                }
+            }
+            output += `  → La fórmula no es válida`;
+            return {
+                status: 'invalid',
+                output,
+                model: {
+                    type: 'first_order',
+                    valuation: Object.fromEntries(Array.from(preds.keys()).map((p) => [p, false])),
+                },
+                tableauTrace: res.trace,
+                diagnostics: [],
+                formula,
+            };
+        }
+        return {
+            status: 'valid',
+            output: `No existen contramodelos — la fórmula es válida en FOL.`,
+            tableauTrace: res.trace,
+            diagnostics: [],
+            formula,
+        };
     }
     explain(formula) {
-        return { status: 'unknown', output: `FOL`, diagnostics: [], formula };
+        const nnf = (0, propositional_1.toNNF)(formula);
+        const prenex = toPrenex(formula);
+        const skolem = skolemize(formula);
+        // Collect quantifiers, predicates, variables
+        const quantifiers = [];
+        const predicates = new Map(); // name -> arity
+        const freeVars = new Set();
+        const boundVars = new Set();
+        const collectInfo = (f, bound) => {
+            if (f.kind === 'forall' || f.kind === 'exists') {
+                const v = f.variable || '_';
+                const innerStr = f.args?.[0] ? (0, propositional_1.formulaToString)(f.args[0]) : '?';
+                quantifiers.push({
+                    kind: f.kind === 'forall' ? '∀' : '∃',
+                    variable: v,
+                    scope: innerStr,
+                });
+                const newBound = new Set(bound);
+                newBound.add(v);
+                boundVars.add(v);
+                if (f.args)
+                    f.args.forEach((a) => collectInfo(a, newBound));
+                return;
+            }
+            if (f.kind === 'predicate' && f.name) {
+                const arity = (f.params || []).length;
+                predicates.set(f.name, arity);
+                for (const p of f.params || []) {
+                    if (!bound.has(p))
+                        freeVars.add(p);
+                }
+            }
+            if (f.kind === 'atom' && f.name) {
+                predicates.set(f.name, 0);
+            }
+            if (f.args)
+                f.args.forEach((a) => collectInfo(a, bound));
+        };
+        collectInfo(formula, new Set());
+        let out = `Análisis de Fórmula en Primer Orden:\n`;
+        out += `  Fórmula original: ${(0, propositional_1.formulaToString)(formula)}\n`;
+        // Syntactic analysis
+        out += `\nAnálisis sintáctico:\n`;
+        if (quantifiers.length > 0) {
+            const qStrs = quantifiers.map((q) => `${q.kind}${q.variable} (${q.kind === '∀' ? 'universal' : 'existencial'})`);
+            out += `  Cuantificadores: ${qStrs.join(', ')}\n`;
+            for (const q of quantifiers) {
+                out += `  Alcance de ${q.kind}${q.variable}: ${q.scope}\n`;
+            }
+        }
+        else {
+            out += `  Cuantificadores: ninguno (fórmula proposicional con predicados)\n`;
+        }
+        if (predicates.size > 0) {
+            const predStrs = Array.from(predicates.entries()).map(([n, a]) => `${n}/${a} (aridad ${a})`);
+            out += `  Predicados: ${predStrs.join(', ')}\n`;
+        }
+        if (boundVars.size > 0)
+            out += `  Variables ligadas: ${Array.from(boundVars).join(', ')}\n`;
+        if (freeVars.size > 0) {
+            out += `  Variables libres: ${Array.from(freeVars).join(', ')}\n`;
+        }
+        else {
+            out += `  Variables libres: ninguna (sentencia cerrada)\n`;
+        }
+        // Quantifier alternation depth
+        let altDepth = 0;
+        let lastQ = '';
+        for (const q of quantifiers) {
+            if (lastQ && lastQ !== q.kind)
+                altDepth++;
+            lastQ = q.kind;
+        }
+        out += `  Alternancia de cuantificadores: ${altDepth}\n`;
+        out += `  Profundidad de cuantificadores: ${quantifiers.length}\n`;
+        // Normal forms
+        out += `\nFormas normales:\n`;
+        out += `  NNF: ${(0, propositional_1.formulaToString)(nnf)}\n`;
+        out += `  PNF: ${(0, propositional_1.formulaToString)(prenex)}\n`;
+        out += `  Skolem: ${(0, propositional_1.formulaToString)(skolem)}\n`;
+        // Natural language interpretation
+        if (quantifiers.length === 1 &&
+            quantifiers[0].kind === '∀' &&
+            formula.args?.[0]?.kind === 'implies' &&
+            predicates.size === 2) {
+            const pNames = Array.from(predicates.keys());
+            out += `\nInterpretación natural: "Para todo ${quantifiers[0].variable}, si ${quantifiers[0].variable} es ${pNames[0]} entonces ${quantifiers[0].variable} es ${pNames[1]}"\n`;
+            out += `Lectura categórica: "Todo ${pNames[0]} es ${pNames[1]}" (proposición tipo A)\n`;
+        }
+        // Validity check
+        const res = this.solve([{ formula: (0, propositional_1.toNNF)({ kind: 'not', args: [formula] }) }]);
+        out += `\nEstatus: ${res.closed ? 'VÁLIDA (demostrada por tableau)' : 'INVÁLIDA (rama abierta encontrada)'}`;
+        return {
+            status: res.closed ? 'valid' : 'invalid',
+            output: out,
+            tableauTrace: res.trace,
+            normalForms: {
+                nnf: (0, propositional_1.formulaToString)(nnf),
+                pnf: (0, propositional_1.formulaToString)(prenex),
+                skolem: (0, propositional_1.formulaToString)(skolem),
+            },
+            diagnostics: [],
+            formula,
+        };
     }
     checkEquivalent(a, b) {
         const biconditional = { kind: 'biconditional', args: [a, b] };
@@ -99,17 +404,25 @@ class ClassicalFirstOrder {
             f.args?.forEach(collect);
         };
         initialNodes.forEach((n) => collect(n.formula));
-        return this.solveRecursive(initialNodes, constants, new Set(), 0);
+        const trace = [];
+        const closed = this.solveRecursive(initialNodes, constants, new Set(), 0, trace);
+        return { closed, trace };
     }
-    solveRecursive(nodes, constants, processed, depth) {
-        if (depth > 50 || nodes.length === 0)
+    solveRecursive(nodes, constants, processed, depth, trace) {
+        if (depth > 50) {
+            trace.push(`[${depth}] ⚠ Se superó la profundidad máxima permitida (50).`);
+            return false;
+        }
+        if (nodes.length === 0)
             return false;
         // 1. Contradicción robusta (comparación canónica)
         for (const n1 of nodes) {
             if (n1.formula.kind === 'not' && n1.formula.args) {
                 const atom = n1.formula.args[0];
-                if (nodes.some((n2) => this.isEqual(n2.formula, atom)))
+                if (nodes.some((n2) => this.isEqual(n2.formula, atom))) {
+                    trace.push(`[${depth}] ✕ Rama cerrada por contradicción con ${(0, propositional_1.formulaToString)(atom)}`);
                     return true;
+                }
             }
         }
         const type = (f) => {
@@ -127,15 +440,15 @@ class ClassicalFirstOrder {
                 const inner = (f.args || [])[0];
                 if (inner) {
                     if (inner.kind === 'and')
-                        return 'beta'; // ¬(A∧B) = ¬A∨¬B
+                        return 'beta';
                     if (inner.kind === 'or')
-                        return 'alfa'; // ¬(A∨B) = ¬A∧¬B
+                        return 'alfa';
                     if (inner.kind === 'implies')
-                        return 'alfa'; // ¬(A→B) = A∧¬B
+                        return 'alfa';
                     if (inner.kind === 'exists')
-                        return 'gamma'; // ¬∃x = ∀x¬
+                        return 'gamma';
                     if (inner.kind === 'forall')
-                        return 'delta'; // ¬∀x = ∃x¬
+                        return 'delta';
                 }
             }
             return 'atom';
@@ -151,20 +464,22 @@ class ClassicalFirstOrder {
             const args = f.args || [];
             const key = this.formulaHash(f);
             if (p !== 'gamma' && p !== 'atom' && processed.has(key))
-                return this.solveRecursive(rest, constants, processed, depth);
+                return this.solveRecursive(rest, constants, processed, depth, trace);
             const nextProcessed = new Set(processed);
             if (p !== 'gamma' && p !== 'atom')
                 nextProcessed.add(key);
             switch (f.kind) {
                 case 'and':
-                    return this.solveRecursive([{ formula: args[0] }, { formula: args[1] }, ...rest], constants, nextProcessed, depth + 1);
+                    trace.push(`[${depth}] Alfa (∧): ${(0, propositional_1.formulaToString)(f)}`);
+                    return this.solveRecursive([{ formula: args[0] }, { formula: args[1] }, ...rest], constants, nextProcessed, depth + 1, trace);
                 case 'exists': {
                     const variable = f.variable;
                     if (!args[0] || !variable)
                         return false;
                     const newC = `c${constants.size}`;
+                    trace.push(`[${depth}] Delta (∃ - Instanciación Existencial EI): ${(0, propositional_1.formulaToString)(f)} -> asignando cte nueva ${newC}`);
                     const nextConstants = new Set(constants).add(newC);
-                    return this.solveRecursive([{ formula: this.substitute(args[0], variable, newC) }, ...rest], nextConstants, nextProcessed, depth + 1);
+                    return this.solveRecursive([{ formula: this.substitute(args[0], variable, newC) }, ...rest], nextConstants, nextProcessed, depth + 1, trace);
                 }
                 case 'forall': {
                     const variable = f.variable;
@@ -178,62 +493,71 @@ class ClassicalFirstOrder {
                             processed.add(instKey);
                         }
                     }
-                    if (newInsts.length > 0)
-                        return this.solveRecursive([...newInsts, ...nodes], constants, processed, depth + 1);
-                    return this.solveRecursive(rest, constants, nextProcessed, depth);
+                    if (newInsts.length > 0) {
+                        trace.push(`[${depth}] Gamma (∀ - Instanciación Universal UI): ${(0, propositional_1.formulaToString)(f)} -> con instantes actuales`);
+                        return this.solveRecursive([...newInsts, ...nodes], constants, processed, depth + 1, trace);
+                    }
+                    return this.solveRecursive(rest, constants, nextProcessed, depth, trace);
                 }
                 case 'or':
-                    return (this.solveRecursive([{ formula: args[0] }, ...rest], constants, nextProcessed, depth + 1) &&
-                        this.solveRecursive([{ formula: args[1] }, ...rest], constants, nextProcessed, depth + 1));
+                    trace.push(`[${depth}] Beta (∨): ${(0, propositional_1.formulaToString)(f)} -> Bifurcando`);
+                    return (this.solveRecursive([{ formula: args[0] }, ...rest], constants, nextProcessed, depth + 1, [...trace, `[${depth}]    -> Rama 1: ${(0, propositional_1.formulaToString)(args[0])}`]) &&
+                        this.solveRecursive([{ formula: args[1] }, ...rest], constants, nextProcessed, depth + 1, [...trace, `[${depth}]    -> Rama 2: ${(0, propositional_1.formulaToString)(args[1])}`]));
                 case 'implies':
-                    // A → B ≡ ¬A ∨ B (beta)
-                    return (this.solveRecursive([{ formula: { kind: 'not', args: [args[0]] } }, ...rest], constants, nextProcessed, depth + 1) &&
-                        this.solveRecursive([{ formula: args[1] }, ...rest], constants, nextProcessed, depth + 1));
+                    trace.push(`[${depth}] Beta (→): ${(0, propositional_1.formulaToString)(f)} -> Bifurcando`);
+                    return (this.solveRecursive([{ formula: { kind: 'not', args: [args[0]] } }, ...rest], constants, nextProcessed, depth + 1, [...trace, `[${depth}]    -> Rama 1: ¬${(0, propositional_1.formulaToString)(args[0])}`]) &&
+                        this.solveRecursive([{ formula: args[1] }, ...rest], constants, nextProcessed, depth + 1, [...trace, `[${depth}]    -> Rama 2: ${(0, propositional_1.formulaToString)(args[1])}`]));
                 case 'biconditional':
-                    // A ↔ B ≡ (A∧B) ∨ (¬A∧¬B) (beta)
-                    return (this.solveRecursive([{ formula: args[0] }, { formula: args[1] }, ...rest], constants, nextProcessed, depth + 1) &&
+                    trace.push(`[${depth}] Beta (↔): ${(0, propositional_1.formulaToString)(f)}`);
+                    return (this.solveRecursive([{ formula: args[0] }, { formula: args[1] }, ...rest], constants, nextProcessed, depth + 1, [...trace]) &&
                         this.solveRecursive([
                             { formula: { kind: 'not', args: [args[0]] } },
                             { formula: { kind: 'not', args: [args[1]] } },
                             ...rest,
-                        ], constants, nextProcessed, depth + 1));
+                        ], constants, nextProcessed, depth + 1, [...trace]));
                 case 'not': {
                     const inner = args[0];
                     if (!inner)
                         return false;
                     switch (inner.kind) {
                         case 'and':
-                            // ¬(A∧B) = ¬A∨¬B (beta)
+                            trace.push(`[${depth}] Beta (¬∧): ${(0, propositional_1.formulaToString)(f)}`);
                             return ((inner.args || []).length >= 2 &&
-                                this.solveRecursive([{ formula: { kind: 'not', args: [inner.args[0]] } }, ...rest], constants, nextProcessed, depth + 1) &&
-                                this.solveRecursive([{ formula: { kind: 'not', args: [inner.args[1]] } }, ...rest], constants, nextProcessed, depth + 1));
+                                this.solveRecursive([{ formula: { kind: 'not', args: [inner.args[0]] } }, ...rest], constants, nextProcessed, depth + 1, [...trace]) &&
+                                this.solveRecursive([{ formula: { kind: 'not', args: [inner.args[1]] } }, ...rest], constants, nextProcessed, depth + 1, [...trace]));
                         case 'or':
-                            // ¬(A∨B) = ¬A∧¬B (alfa)
+                            trace.push(`[${depth}] Alfa (¬∨): ${(0, propositional_1.formulaToString)(f)}`);
                             return this.solveRecursive([
-                                ...((inner.args || []).map((a) => ({ formula: { kind: 'not', args: [a] } }))),
+                                ...(inner.args || []).map((a) => ({
+                                    formula: { kind: 'not', args: [a] },
+                                })),
                                 ...rest,
-                            ], constants, nextProcessed, depth + 1);
+                            ], constants, nextProcessed, depth + 1, trace);
                         case 'implies':
-                            // ¬(A→B) = A∧¬B (alfa)
+                            trace.push(`[${depth}] Alfa (¬→): ${(0, propositional_1.formulaToString)(f)}`);
                             return this.solveRecursive([
                                 { formula: (inner.args || [])[0] },
                                 { formula: { kind: 'not', args: [(inner.args || [])[1]] } },
                                 ...rest,
-                            ], constants, nextProcessed, depth + 1);
+                            ], constants, nextProcessed, depth + 1, trace);
                         case 'forall': {
-                            // ¬∀x.φ = ∃x.¬φ (delta)
                             const variable = inner.variable;
                             if (!(inner.args || [])[0] || !variable)
                                 return false;
                             const newC = `c${constants.size}`;
+                            trace.push(`[${depth}] Delta (¬∀): ${(0, propositional_1.formulaToString)(f)} -> instanciando con ${newC} (EI)`);
                             const nextConstants = new Set(constants).add(newC);
                             return this.solveRecursive([
-                                { formula: { kind: 'not', args: [this.substitute(inner.args[0], variable, newC)] } },
+                                {
+                                    formula: {
+                                        kind: 'not',
+                                        args: [this.substitute(inner.args[0], variable, newC)],
+                                    },
+                                },
                                 ...rest,
-                            ], nextConstants, nextProcessed, depth + 1);
+                            ], nextConstants, nextProcessed, depth + 1, trace);
                         }
                         case 'exists': {
-                            // ¬∃x.φ = ∀x.¬φ (gamma)
                             const variable = inner.variable;
                             if (!(inner.args || [])[0] || !variable)
                                 return false;
@@ -242,18 +566,18 @@ class ClassicalFirstOrder {
                                 variable,
                                 args: [{ kind: 'not', args: [inner.args[0]] }],
                             };
-                            return this.solveRecursive([{ formula: negForall }, ...rest], constants, nextProcessed, depth + 1);
+                            trace.push(`[${depth}] Gamma (¬∃): ${(0, propositional_1.formulaToString)(f)} -> transformando a ∀¬ (UG/UI prep)`);
+                            return this.solveRecursive([{ formula: negForall }, ...rest], constants, nextProcessed, depth + 1, trace);
                         }
                         case 'not':
-                            // ¬¬A = A (doble negación)
-                            return this.solveRecursive([{ formula: (inner.args || [])[0] }, ...rest], constants, nextProcessed, depth + 1);
-                        default:
-                            break;
+                            trace.push(`[${depth}] Doble negación: ${(0, propositional_1.formulaToString)(f)}`);
+                            return this.solveRecursive([{ formula: (inner.args || [])[0] }, ...rest], constants, nextProcessed, depth + 1, trace);
                     }
                     break;
                 }
             }
         }
+        trace.push(`[${depth}] ✓ Rama saturada y ABIERTA.`);
         return false;
     }
     formulaHash(f) {