@tuprolog/arg2p-core 0.6.5 → 0.6.8

package/kotlin/arg2p-core.js

@@ -6,25 +6,35 @@
   else {
     if (typeof kotlin === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency 'kotlin' was not found. Please, check whether 'kotlin' is loaded prior to '@tuprolog/arg2p-core'.");
-    }if (typeof this['@tuprolog/2p-solve'] === 'undefined') {
+    }
+    if (typeof this['@tuprolog/2p-solve'] === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency '@tuprolog/2p-solve' was not found. Please, check whether '@tuprolog/2p-solve' is loaded prior to '@tuprolog/arg2p-core'.");
-    }if (typeof this['@tuprolog/2p-dsl-theory'] === 'undefined') {
+    }
+    if (typeof this['@tuprolog/2p-dsl-theory'] === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency '@tuprolog/2p-dsl-theory' was not found. Please, check whether '@tuprolog/2p-dsl-theory' is loaded prior to '@tuprolog/arg2p-core'.");
-    }if (typeof this['@tuprolog/2p-dsl-core'] === 'undefined') {
+    }
+    if (typeof this['@tuprolog/2p-dsl-core'] === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency '@tuprolog/2p-dsl-core' was not found. Please, check whether '@tuprolog/2p-dsl-core' is loaded prior to '@tuprolog/arg2p-core'.");
-    }if (typeof this['@tuprolog/2p-unify'] === 'undefined') {
+    }
+    if (typeof this['@tuprolog/2p-unify'] === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency '@tuprolog/2p-unify' was not found. Please, check whether '@tuprolog/2p-unify' is loaded prior to '@tuprolog/arg2p-core'.");
-    }if (typeof this['@tuprolog/2p-core'] === 'undefined') {
+    }
+    if (typeof this['@tuprolog/2p-core'] === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency '@tuprolog/2p-core' was not found. Please, check whether '@tuprolog/2p-core' is loaded prior to '@tuprolog/arg2p-core'.");
-    }if (typeof this['@tuprolog/2p-theory'] === 'undefined') {
+    }
+    if (typeof this['@tuprolog/2p-theory'] === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency '@tuprolog/2p-theory' was not found. Please, check whether '@tuprolog/2p-theory' is loaded prior to '@tuprolog/arg2p-core'.");
-    }if (typeof this['@tuprolog/2p-parser-theory'] === 'undefined') {
+    }
+    if (typeof this['@tuprolog/2p-parser-theory'] === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency '@tuprolog/2p-parser-theory' was not found. Please, check whether '@tuprolog/2p-parser-theory' is loaded prior to '@tuprolog/arg2p-core'.");
-    }if (typeof this['@tuprolog/2p-solve-classic'] === 'undefined') {
+    }
+    if (typeof this['@tuprolog/2p-solve-classic'] === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency '@tuprolog/2p-solve-classic' was not found. Please, check whether '@tuprolog/2p-solve-classic' is loaded prior to '@tuprolog/arg2p-core'.");
-    }if (typeof this['@tuprolog/2p-parser-core'] === 'undefined') {
+    }
+    if (typeof this['@tuprolog/2p-parser-core'] === 'undefined') {
       throw new Error("Error loading module '@tuprolog/arg2p-core'. Its dependency '@tuprolog/2p-parser-core' was not found. Please, check whether '@tuprolog/2p-parser-core' is loaded prior to '@tuprolog/arg2p-core'.");
-    }root['@tuprolog/arg2p-core'] = factory(typeof this['@tuprolog/arg2p-core'] === 'undefined' ? {} : this['@tuprolog/arg2p-core'], kotlin, this['@tuprolog/2p-solve'], this['@tuprolog/2p-dsl-theory'], this['@tuprolog/2p-dsl-core'], this['@tuprolog/2p-unify'], this['@tuprolog/2p-core'], this['@tuprolog/2p-theory'], this['@tuprolog/2p-parser-theory'], this['@tuprolog/2p-solve-classic'], this['@tuprolog/2p-parser-core']);
+    }
+    root['@tuprolog/arg2p-core'] = factory(typeof this['@tuprolog/arg2p-core'] === 'undefined' ? {} : this['@tuprolog/arg2p-core'], kotlin, this['@tuprolog/2p-solve'], this['@tuprolog/2p-dsl-theory'], this['@tuprolog/2p-dsl-core'], this['@tuprolog/2p-unify'], this['@tuprolog/2p-core'], this['@tuprolog/2p-theory'], this['@tuprolog/2p-parser-theory'], this['@tuprolog/2p-solve-classic'], this['@tuprolog/2p-parser-core']);
   }
 }(this, function (_, Kotlin, $module$_2p_solve, $module$_2p_dsl_theory, $module$_2p_dsl_core, $module$_2p_unify, $module$_2p_core, $module$_2p_theory, $module$_2p_parser_theory, $module$_2p_solve_classic, $module$_2p_parser_core) {
   'use strict';
@@ -77,6 +87,8 @@
   var equals = Kotlin.equals;
   var DomainError = $module$_2p_solve.it.unibo.tuprolog.solve.exception.error.DomainError;
   var DomainError$Expected = $module$_2p_solve.it.unibo.tuprolog.solve.exception.error.DomainError.Expected;
+  var SolveOptions = $module$_2p_solve.it.unibo.tuprolog.solve.SolveOptions;
+  var Long$Companion$MAX_VALUE = Kotlin.Long.MAX_VALUE;
   var Unit = Kotlin.kotlin.Unit;
   var filter = Kotlin.kotlin.sequences.filter_euau3h$;
   var prolog = $module$_2p_dsl_core.it.unibo.tuprolog.dsl.prolog;
@@ -114,14 +126,14 @@
   var IllegalArgumentException_init = Kotlin.kotlin.IllegalArgumentException_init;
   var copyToArray = Kotlin.kotlin.collections.copyToArray;
   var hashCode = Kotlin.hashCode;
+  var Collection = Kotlin.kotlin.collections.Collection;
   var AliasedLibrary = $module$_2p_solve.it.unibo.tuprolog.solve.library.AliasedLibrary;
   var compareBy = Kotlin.kotlin.comparisons.compareBy_bvgy4j$;
   var sortedWith = Kotlin.kotlin.sequences.sortedWith_vjgqpk$;
   var mapIndexed = Kotlin.kotlin.sequences.mapIndexed_b7yuyq$;
-  var firstOrNull = Kotlin.kotlin.sequences.firstOrNull_veqyi0$;
+  var Pair = Kotlin.kotlin.Pair;
   var NoSuchElementException_init = Kotlin.kotlin.NoSuchElementException;
-  var addAll = Kotlin.kotlin.collections.addAll_ipc267$;
-  var firstOrNull_0 = Kotlin.kotlin.collections.firstOrNull_2p1efm$;
+  var firstOrNull = Kotlin.kotlin.collections.firstOrNull_2p1efm$;
   var plus_0 = Kotlin.kotlin.collections.plus_qloxvw$;
   var Cons = $module$_2p_core.it.unibo.tuprolog.core.Cons;
   DynamicLoader$WithLib.prototype = Object.create(DynamicLoader$AbstractWithLib.prototype);
@@ -311,7 +323,8 @@
   function Arg2pSolver$Companion_getInstance() {
     if (Arg2pSolver$Companion_instance === null) {
       new Arg2pSolver$Companion();
-    }return Arg2pSolver$Companion_instance;
+    }
+    return Arg2pSolver$Companion_instance;
   }
   Arg2pSolver.$metadata$ = {
     kind: Kind_INTERFACE,
@@ -926,36 +939,18 @@
   PrologWithArgumentationImpl.prototype.write1 = function (term) {
     return this.$delegate_38xz9p$_0.write1(term);
   };
-  PrologWithArgumentationImpl.prototype.neq2 = function ($receiver, right) {
-    return this.$delegate_38xz9p$_0.neq2($receiver, right);
-  };
-  PrologWithArgumentationImpl.prototype.nid2 = function ($receiver, right) {
-    return this.$delegate_38xz9p$_0.nid2($receiver, right);
-  };
-  PrologWithArgumentationImpl.prototype.power = function ($receiver, right) {
-    return this.$delegate_38xz9p$_0.power($receiver, right);
-  };
-  PrologWithArgumentationImpl.prototype.eq2 = function ($receiver, right) {
-    return this.$delegate_38xz9p$_0.eq2($receiver, right);
-  };
-  PrologWithArgumentationImpl.prototype.arithNeq2 = function ($receiver, right) {
-    return this.$delegate_38xz9p$_0.arithNeq2($receiver, right);
-  };
-  PrologWithArgumentationImpl.prototype.id2 = function ($receiver, right) {
-    return this.$delegate_38xz9p$_0.id2($receiver, right);
-  };
-  PrologWithArgumentationImpl.prototype.arithEq2 = function ($receiver, right) {
-    return this.$delegate_38xz9p$_0.arithEq2($receiver, right);
-  };
-  PrologWithArgumentationImpl.prototype.pow = function ($receiver, right) {
-    return this.$delegate_38xz9p$_0.pow($receiver, right);
-  };
   PrologWithArgumentationImpl.prototype.anyAnd = function ($receiver, other) {
     return this.$delegate_38xz9p$_0.anyAnd($receiver, other);
   };
   PrologWithArgumentationImpl.prototype.append = function ($receiver, item, items) {
     return this.$delegate_38xz9p$_0.append($receiver, item, items);
   };
+  PrologWithArgumentationImpl.prototype.arithEq2 = function ($receiver, right) {
+    return this.$delegate_38xz9p$_0.arithEq2($receiver, right);
+  };
+  PrologWithArgumentationImpl.prototype.arithNeq2 = function ($receiver, right) {
+    return this.$delegate_38xz9p$_0.arithNeq2($receiver, right);
+  };
   PrologWithArgumentationImpl.prototype.concat = function ($receiver, other) {
     return this.$delegate_38xz9p$_0.concat($receiver, other);
   };
@@ -971,6 +966,9 @@
   PrologWithArgumentationImpl.prototype.anyDiv = function ($receiver, other) {
     return this.$delegate_38xz9p$_0.anyDiv($receiver, other);
   };
+  PrologWithArgumentationImpl.prototype.eq2 = function ($receiver, right) {
+    return this.$delegate_38xz9p$_0.eq2($receiver, right);
+  };
   PrologWithArgumentationImpl.prototype.anyEqualsTo = function ($receiver, other) {
     return this.$delegate_38xz9p$_0.anyEqualsTo($receiver, other);
   };
@@ -983,6 +981,9 @@
   PrologWithArgumentationImpl.prototype.anyGreaterThanOrEqualsTo = function ($receiver, other) {
     return this.$delegate_38xz9p$_0.anyGreaterThanOrEqualsTo($receiver, other);
   };
+  PrologWithArgumentationImpl.prototype.id2 = function ($receiver, right) {
+    return this.$delegate_38xz9p$_0.id2($receiver, right);
+  };
   PrologWithArgumentationImpl.prototype.anyIf = function ($receiver, other) {
     return this.$delegate_38xz9p$_0.anyIf($receiver, other);
   };
@@ -1013,6 +1014,12 @@
   PrologWithArgumentationImpl.prototype.anyMinus = function ($receiver, other) {
     return this.$delegate_38xz9p$_0.anyMinus($receiver, other);
   };
+  PrologWithArgumentationImpl.prototype.neq2 = function ($receiver, right) {
+    return this.$delegate_38xz9p$_0.neq2($receiver, right);
+  };
+  PrologWithArgumentationImpl.prototype.nid2 = function ($receiver, right) {
+    return this.$delegate_38xz9p$_0.nid2($receiver, right);
+  };
   PrologWithArgumentationImpl.prototype.anyNonGreaterThan = function ($receiver, other) {
     return this.$delegate_38xz9p$_0.anyNonGreaterThan($receiver, other);
   };
@@ -1277,7 +1284,8 @@
             throw this.exception_0;
           case 2:
             return this.result_0;
-          default:this.state_0 = 1;
+          default:
+            this.state_0 = 1;
             throw new Error('State Machine Unreachable execution');
         }
       } catch (e) {
@@ -1543,7 +1551,8 @@
             throw this.exception_0;
           case 2:
             return this.result_0;
-          default:this.state_0 = 1;
+          default:
+            this.state_0 = 1;
             throw new Error('State Machine Unreachable execution');
         }
       } catch (e) {
@@ -1621,7 +1630,8 @@
             throw this.exception_0;
           case 2:
             return this.result_0;
-          default:this.state_0 = 1;
+          default:
+            this.state_0 = 1;
             throw new Error('State Machine Unreachable execution');
         }
       } catch (e) {
@@ -1724,7 +1734,7 @@
         switch (this.state_0) {
           case 0:
             this.state_0 = 2;
-            this.result_0 = this.local$$receiver.yieldAll_swo9gw$(map(this.local$closure$solver.solve(this.local$closure$goal), DynamicLoader$AbstractWithLib$solve$lambda$lambda(this.local$closure$request)), this);
+            this.result_0 = this.local$$receiver.yieldAll_swo9gw$(map(this.local$closure$solver.solveWithOptions(this.local$closure$goal, SolveOptions.Companion.allLazilyWithTimeout(Long$Companion$MAX_VALUE)), DynamicLoader$AbstractWithLib$solve$lambda$lambda(this.local$closure$request)), this);
             if (this.result_0 === COROUTINE_SUSPENDED)
               return COROUTINE_SUSPENDED;
             continue;
@@ -1732,7 +1742,8 @@
             throw this.exception_0;
           case 2:
             return this.result_0;
-          default:this.state_0 = 1;
+          default:
+            this.state_0 = 1;
             throw new Error('State Machine Unreachable execution');
         }
       } catch (e) {
@@ -1761,9 +1772,11 @@
     var goal = request.arguments.get_za3lpa$(1);
     if (!Kotlin.isType(lib, Atom)) {
       throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.LIST, lib);
-    }if (!Kotlin.isType(goal, Struct)) {
+    }
+    if (!Kotlin.isType(goal, Struct)) {
       throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.CALLABLE, goal);
-    }var $receiver = this.$outer.solver_0.dynamicLibraries();
+    }
+    var $receiver = this.$outer.solver_0.dynamicLibraries();
     var firstOrNull$result;
     firstOrNull$break: do {
       var tmp$_0;
@@ -1774,14 +1787,16 @@
         if (equals((Kotlin.isType(tmp$_1 = element, Loadable) ? tmp$_1 : throwCCE()).identifier(), lib.toString())) {
           firstOrNull$result = element;
           break firstOrNull$break;
-        }}
+        }
+      }
       firstOrNull$result = null;
     }
      while (false);
     tmp$ = firstOrNull$result;
     if (tmp$ == null) {
       throw DomainError.Companion.forGoal(request.context, request.signature, DomainError$Expected.Companion.of('Loadable Lib'), lib);
-    }this.$outer;
+    }
+    this.$outer;
     var this$DynamicLoader = this.$outer;
     var tmp$_2 = request.context;
     var tmp$_3 = Libraries.Companion;
@@ -1916,7 +1931,8 @@
   function DynamicLoader$Companion_getInstance() {
     if (DynamicLoader$Companion_instance === null) {
       new DynamicLoader$Companion();
-    }return DynamicLoader$Companion_instance;
+    }
+    return DynamicLoader$Companion_instance;
   }
   DynamicLoader.$metadata$ = {
     kind: Kind_CLASS,
@@ -2024,7 +2040,8 @@
   function FlagsBuilder$Companion_getInstance() {
     if (FlagsBuilder$Companion_instance === null) {
       new FlagsBuilder$Companion();
-    }return FlagsBuilder$Companion_instance;
+    }
+    return FlagsBuilder$Companion_instance;
   }
   FlagsBuilder.prototype.queryMode_6taknv$ = function (queryMode) {
     this.queryMode = queryMode;
@@ -2183,7 +2200,8 @@
   function MetaInterpreter_getInstance() {
     if (MetaInterpreter_instance === null) {
       new MetaInterpreter();
-    }return MetaInterpreter_instance;
+    }
+    return MetaInterpreter_instance;
   }
   function ModuleCalls() {
     ModuleCalls_instance = this;
@@ -2219,7 +2237,8 @@
   function ModuleCalls_getInstance() {
     if (ModuleCalls_instance === null) {
       new ModuleCalls();
-    }return ModuleCalls_instance;
+    }
+    return ModuleCalls_instance;
   }
   function ModulesPath() {
     ModulesPath_instance = this;
@@ -2242,7 +2261,8 @@
   function ModulesPath_getInstance() {
     if (ModulesPath_instance === null) {
       new ModulesPath();
-    }return ModulesPath_instance;
+    }
+    return ModulesPath_instance;
   }
   function ModuleCall() {
     ModuleCall_instance = this;
@@ -2286,7 +2306,8 @@
             throw this.exception_0;
           case 2:
             return this.result_0;
-          default:this.state_0 = 1;
+          default:
+            this.state_0 = 1;
             throw new Error('State Machine Unreachable execution');
         }
       } catch (e) {
@@ -2314,9 +2335,11 @@
     var goal = request.arguments.get_za3lpa$(1);
     if (!Kotlin.isType(modules, List)) {
       throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.LIST, modules);
-    }if (!Kotlin.isType(goal, Struct)) {
+    }
+    if (!Kotlin.isType(goal, Struct)) {
       throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.CALLABLE, goal);
-    }var tmp$ = request.context;
+    }
+    var tmp$ = request.context;
     var tmp$_0 = this.mineModulesPath_0(request.context);
     var $receiver = modules.toList();
     var destination = ArrayList_init(collectionSizeOrDefault($receiver, 10));
@@ -2374,7 +2397,8 @@
   function ModuleCall_getInstance() {
     if (ModuleCall_instance === null) {
       new ModuleCall();
-    }return ModuleCall_instance;
+    }
+    return ModuleCall_instance;
   }
   function AbstractModeBase() {
     LazyRawPrologContent.call(this);
@@ -2434,7 +2458,8 @@
   function GraphExtension_getInstance() {
     if (GraphExtension_instance === null) {
       new GraphExtension();
-    }return GraphExtension_instance;
+    }
+    return GraphExtension_instance;
   }
   function ArgumentLabellingMode() {
     ArgumentLabellingMode_instance = this;
@@ -2457,7 +2482,8 @@
   function ArgumentLabellingMode_getInstance() {
     if (ArgumentLabellingMode_instance === null) {
       new ArgumentLabellingMode();
-    }return ArgumentLabellingMode_instance;
+    }
+    return ArgumentLabellingMode_instance;
   }
   function StatementLabellingMode() {
     StatementLabellingMode_instance = this;
@@ -2480,7 +2506,8 @@
   function StatementLabellingMode_getInstance() {
     if (StatementLabellingMode_instance === null) {
       new StatementLabellingMode();
-    }return StatementLabellingMode_instance;
+    }
+    return StatementLabellingMode_instance;
   }
   function GraphBuildMode() {
     GraphBuildMode_instance = this;
@@ -2503,7 +2530,8 @@
   function GraphBuildMode_getInstance() {
     if (GraphBuildMode_instance === null) {
       new GraphBuildMode();
-    }return GraphBuildMode_instance;
+    }
+    return GraphBuildMode_instance;
   }
   function ArgumentationGraphBuilderBase() {
     LazyRawPrologContent.call(this);
@@ -2768,7 +2796,8 @@
   function BinaryStatementLabeller_getInstance() {
     if (BinaryStatementLabeller_instance === null) {
       new BinaryStatementLabeller();
-    }return BinaryStatementLabeller_instance;
+    }
+    return BinaryStatementLabeller_instance;
   }
   function BinaryLabelling() {
     BinaryLabelling_instance = this;
@@ -2789,7 +2818,8 @@
   function BinaryLabelling_getInstance() {
     if (BinaryLabelling_instance === null) {
       new BinaryLabelling();
-    }return BinaryLabelling_instance;
+    }
+    return BinaryLabelling_instance;
   }
   function BpCompleteLabellerBase() {
     LazyRawPrologContent.call(this);
@@ -3054,7 +3084,8 @@
   function PassThroughStatementLabeller_getInstance() {
     if (PassThroughStatementLabeller_instance === null) {
       new PassThroughStatementLabeller();
-    }return PassThroughStatementLabeller_instance;
+    }
+    return PassThroughStatementLabeller_instance;
   }
   function Labelling() {
     Labelling_instance = this;
@@ -3075,7 +3106,8 @@
   function Labelling_getInstance() {
     if (Labelling_instance === null) {
       new Labelling();
-    }return Labelling_instance;
+    }
+    return Labelling_instance;
   }
   function StatementLabellerBase() {
     LazyRawPrologContent.call(this);
@@ -3176,7 +3208,8 @@
   function RuleParserBase$Companion_getInstance() {
     if (RuleParserBase$Companion_instance === null) {
       new RuleParserBase$Companion();
-    }return RuleParserBase$Companion_instance;
+    }
+    return RuleParserBase$Companion_instance;
   }
   RuleParserBase.$metadata$ = {
     kind: Kind_CLASS,
@@ -3204,7 +3237,8 @@
   function AutoTransposition_getInstance() {
     if (AutoTransposition_instance === null) {
       new AutoTransposition();
-    }return AutoTransposition_instance;
+    }
+    return AutoTransposition_instance;
   }
   function PrologStrictCompatibility() {
     PrologStrictCompatibility_instance = this;
@@ -3227,7 +3261,8 @@
   function PrologStrictCompatibility_getInstance() {
     if (PrologStrictCompatibility_instance === null) {
       new PrologStrictCompatibility();
-    }return PrologStrictCompatibility_instance;
+    }
+    return PrologStrictCompatibility_instance;
   }
   function ConversionUtils() {
     ConversionUtils_instance = this;
@@ -3279,7 +3314,8 @@
   function ConversionUtils_getInstance() {
     if (ConversionUtils_instance === null) {
       new ConversionUtils();
-    }return ConversionUtils_instance;
+    }
+    return ConversionUtils_instance;
   }
   function StrictRules() {
     StrictRules_instance = this;
@@ -3319,7 +3355,8 @@
   function StrictRules_getInstance() {
     if (StrictRules_instance === null) {
       new StrictRules();
-    }return StrictRules_instance;
+    }
+    return StrictRules_instance;
   }
   function Axioms() {
     Axioms_instance = this;
@@ -3355,7 +3392,8 @@
   function Axioms_getInstance() {
     if (Axioms_instance === null) {
       new Axioms();
-    }return Axioms_instance;
+    }
+    return Axioms_instance;
   }
   function Premises() {
     Premises_instance = this;
@@ -3391,7 +3429,8 @@
   function Premises_getInstance() {
     if (Premises_instance === null) {
       new Premises();
-    }return Premises_instance;
+    }
+    return Premises_instance;
   }
   function DefeasibleRules() {
     DefeasibleRules_instance = this;
@@ -3441,7 +3480,8 @@
   function DefeasibleRules_getInstance() {
     if (DefeasibleRules_instance === null) {
       new DefeasibleRules();
-    }return DefeasibleRules_instance;
+    }
+    return DefeasibleRules_instance;
   }
   function Bps() {
     Bps_instance = this;
@@ -3478,7 +3518,8 @@
   function Bps_getInstance() {
     if (Bps_instance === null) {
       new Bps();
-    }return Bps_instance;
+    }
+    return Bps_instance;
   }
   function ExtractStrictIds() {
     ExtractStrictIds_instance = this;
@@ -3507,7 +3548,8 @@
   function ExtractStrictIds_getInstance() {
     if (ExtractStrictIds_instance === null) {
       new ExtractStrictIds();
-    }return ExtractStrictIds_instance;
+    }
+    return ExtractStrictIds_instance;
   }
   function RuleToClause() {
     RuleToClause_instance = this;
@@ -3534,7 +3576,8 @@
           case 3:
             block$result = Clause.Companion.of(Struct.Companion.of('rl', [it.get_za3lpa$(2)]), [item]);
             break block$break;
-          default:throw IllegalArgumentException_init();
+          default:
+            throw IllegalArgumentException_init();
         }
       }
        while (false);
@@ -3551,7 +3594,8 @@
   function RuleToClause_getInstance() {
     if (RuleToClause_instance === null) {
       new RuleToClause();
-    }return RuleToClause_instance;
+    }
+    return RuleToClause_instance;
   }
   function StructuredModeBase() {
     LazyRawPrologContent.call(this);
@@ -3611,7 +3655,8 @@
   function QueryMode_getInstance() {
     if (QueryMode_instance === null) {
       new QueryMode();
-    }return QueryMode_instance;
+    }
+    return QueryMode_instance;
   }
   function AmbiguityBlocking() {
     AmbiguityBlocking_instance = this;
@@ -3634,7 +3679,8 @@
   function AmbiguityBlocking_getInstance() {
     if (AmbiguityBlocking_instance === null) {
       new AmbiguityBlocking();
-    }return AmbiguityBlocking_instance;
+    }
+    return AmbiguityBlocking_instance;
   }
   function DebugBase() {
     LazyRawPrologContent.call(this);
@@ -3731,7 +3777,8 @@
   function OrderingPrinciple_getInstance() {
     if (OrderingPrinciple_instance === null) {
       new OrderingPrinciple();
-    }return OrderingPrinciple_instance;
+    }
+    return OrderingPrinciple_instance;
   }
   function OrderingComparator() {
     OrderingComparator_instance = this;
@@ -3754,7 +3801,8 @@
   function OrderingComparator_getInstance() {
     if (OrderingComparator_instance === null) {
       new OrderingComparator();
-    }return OrderingComparator_instance;
+    }
+    return OrderingComparator_instance;
   }
   function UtilsBase() {
     LazyRawPrologContent.call(this);
@@ -3777,7 +3825,7 @@
       var tmp$_2 = to(AppendOptimized_getInstance().signature, AppendOptimized_getInstance());
       var tmp$_3 = to(AssertAll_getInstance().signature, AssertAll_getInstance());
       var $this = ArgumentHash_getInstance();
-      return tmp$_1.aliased(tmp$, mapOf_0([tmp$_2, tmp$_3, to($this.signature, $this.wrappedImplementation)]), tmp$_0);
+      return tmp$_1.aliased(tmp$, mapOf_0([tmp$_2, tmp$_3, to($this.signature, $this.wrappedImplementation), to(Contains_getInstance().signature, Contains_getInstance()), to(ContainsAny_getInstance().signature, ContainsAny_getInstance())]), tmp$_0);
     }
   });
   Object.defineProperty(UtilsBase.prototype, 'baseFlags', {
@@ -3835,7 +3883,8 @@
             throw this.exception_0;
           case 2:
             return this.result_0;
-          default:this.state_0 = 1;
+          default:
+            this.state_0 = 1;
             throw new Error('State Machine Unreachable execution');
         }
       } catch (e) {
@@ -3864,11 +3913,14 @@
     var res = request.arguments.get_za3lpa$(2);
     if (!Kotlin.isType(list1, List)) {
       throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.LIST, list1);
-    }if (!Kotlin.isType(list2, List)) {
+    }
+    if (!Kotlin.isType(list2, List)) {
       throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.LIST, list2);
-    }if (!Kotlin.isType(res, Var)) {
+    }
+    if (!Kotlin.isType(res, Var)) {
       throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.VARIABLE, res);
-    }return sequence(AppendOptimized$solve$lambda(request, res, list1, list2));
+    }
+    return sequence(AppendOptimized$solve$lambda(request, res, list1, list2));
   };
   AppendOptimized.$metadata$ = {
     kind: Kind_OBJECT,
@@ -3879,7 +3931,8 @@
   function AppendOptimized_getInstance() {
     if (AppendOptimized_instance === null) {
       new AppendOptimized();
-    }return AppendOptimized_instance;
+    }
+    return AppendOptimized_instance;
   }
   function AssertAll() {
     AssertAll_instance = this;
@@ -3925,7 +3978,8 @@
             throw this.exception_0;
           case 2:
             return this.result_0;
-          default:this.state_0 = 1;
+          default:
+            this.state_0 = 1;
             throw new Error('State Machine Unreachable execution');
         }
       } catch (e) {
@@ -3952,7 +4006,8 @@
     var list = request.arguments.get_za3lpa$(0);
     if (!Kotlin.isType(list, List)) {
       throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.LIST, list);
-    }arg2pScope(AssertAll$solve$lambda(list, request));
+    }
+    arg2pScope(AssertAll$solve$lambda(list, request));
     return sequence(AssertAll$solve$lambda_0(request));
   };
   AssertAll.$metadata$ = {
@@ -3964,7 +4019,8 @@
   function AssertAll_getInstance() {
     if (AssertAll_instance === null) {
       new AssertAll();
-    }return AssertAll_instance;
+    }
+    return AssertAll_instance;
   }
   function ArgumentHash() {
     ArgumentHash_instance = this;
@@ -3982,7 +4038,219 @@
   function ArgumentHash_getInstance() {
     if (ArgumentHash_instance === null) {
       new ArgumentHash();
-    }return ArgumentHash_instance;
+    }
+    return ArgumentHash_instance;
+  }
+  function Contains() {
+    Contains_instance = this;
+    this.signature = new Signature('contains', 2);
+  }
+  function Coroutine$Contains$solve$lambda(closure$request_0, closure$list_0, closure$elem_0, $receiver_0, controller, continuation_0) {
+    CoroutineImpl.call(this, continuation_0);
+    this.$controller = controller;
+    this.exceptionState_0 = 1;
+    this.local$closure$request = closure$request_0;
+    this.local$closure$list = closure$list_0;
+    this.local$closure$elem = closure$elem_0;
+    this.local$$receiver = $receiver_0;
+  }
+  Coroutine$Contains$solve$lambda.$metadata$ = {
+    kind: Kotlin.Kind.CLASS,
+    simpleName: null,
+    interfaces: [CoroutineImpl]
+  };
+  Coroutine$Contains$solve$lambda.prototype = Object.create(CoroutineImpl.prototype);
+  Coroutine$Contains$solve$lambda.prototype.constructor = Coroutine$Contains$solve$lambda;
+  Coroutine$Contains$solve$lambda.prototype.doResume = function () {
+    do
+      try {
+        switch (this.state_0) {
+          case 0:
+            var tmp$ = this.local$closure$request;
+            var $receiver = this.local$closure$list.toList();
+            var any$result;
+            any$break: do {
+              var tmp$_0;
+              if (Kotlin.isType($receiver, Collection) && $receiver.isEmpty()) {
+                any$result = false;
+                break any$break;
+              }
+              tmp$_0 = $receiver.iterator();
+              while (tmp$_0.hasNext()) {
+                var element = tmp$_0.next();
+                var closure$elem = this.local$closure$elem;
+                if (Unificator.Companion.default.match(element, closure$elem)) {
+                  any$result = true;
+                  break any$break;
+                }
+              }
+              any$result = false;
+            }
+             while (false);
+            this.state_0 = 2;
+            this.result_0 = this.local$$receiver.yield_11rb$(tmp$.replyWithCondition(any$result, void 0, []), this);
+            if (this.result_0 === COROUTINE_SUSPENDED)
+              return COROUTINE_SUSPENDED;
+            continue;
+          case 1:
+            throw this.exception_0;
+          case 2:
+            return this.result_0;
+          default:
+            this.state_0 = 1;
+            throw new Error('State Machine Unreachable execution');
+        }
+      } catch (e) {
+        if (this.state_0 === 1) {
+          this.exceptionState_0 = this.state_0;
+          throw e;
+        } else {
+          this.state_0 = this.exceptionState_0;
+          this.exception_0 = e;
+        }
+      }
+     while (true);
+  };
+  function Contains$solve$lambda(closure$request_0, closure$list_0, closure$elem_0) {
+    return function ($receiver_0, continuation_0, suspended) {
+      var instance = new Coroutine$Contains$solve$lambda(closure$request_0, closure$list_0, closure$elem_0, $receiver_0, this, continuation_0);
+      if (suspended)
+        return instance;
+      else
+        return instance.doResume(null);
+    };
+  }
+  Contains.prototype.solve = function (request) {
+    var elem = request.arguments.get_za3lpa$(0);
+    var list = request.arguments.get_za3lpa$(1);
+    if (!Kotlin.isType(list, List)) {
+      throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.LIST, list);
+    }
+    return sequence(Contains$solve$lambda(request, list, elem));
+  };
+  Contains.$metadata$ = {
+    kind: Kind_OBJECT,
+    simpleName: 'Contains',
+    interfaces: [Primitive]
+  };
+  var Contains_instance = null;
+  function Contains_getInstance() {
+    if (Contains_instance === null) {
+      new Contains();
+    }
+    return Contains_instance;
+  }
+  function ContainsAny() {
+    ContainsAny_instance = this;
+    this.signature = new Signature('contains_any', 2);
+  }
+  function Coroutine$ContainsAny$solve$lambda(closure$request_0, closure$list_0, closure$elemList_0, $receiver_0, controller, continuation_0) {
+    CoroutineImpl.call(this, continuation_0);
+    this.$controller = controller;
+    this.exceptionState_0 = 1;
+    this.local$closure$request = closure$request_0;
+    this.local$closure$list = closure$list_0;
+    this.local$closure$elemList = closure$elemList_0;
+    this.local$$receiver = $receiver_0;
+  }
+  Coroutine$ContainsAny$solve$lambda.$metadata$ = {
+    kind: Kotlin.Kind.CLASS,
+    simpleName: null,
+    interfaces: [CoroutineImpl]
+  };
+  Coroutine$ContainsAny$solve$lambda.prototype = Object.create(CoroutineImpl.prototype);
+  Coroutine$ContainsAny$solve$lambda.prototype.constructor = Coroutine$ContainsAny$solve$lambda;
+  Coroutine$ContainsAny$solve$lambda.prototype.doResume = function () {
+    do
+      try {
+        switch (this.state_0) {
+          case 0:
+            var tmp$ = this.local$closure$request;
+            var $receiver = this.local$closure$list.toSequence();
+            var any$result;
+            any$break: do {
+              var tmp$_0;
+              tmp$_0 = $receiver.iterator();
+              loop_label: while (tmp$_0.hasNext()) {
+                var element = tmp$_0.next();
+                var $receiver_0 = this.local$closure$elemList.toSequence();
+                var any$result_0;
+                any$break_0: do {
+                  var tmp$_1;
+                  tmp$_1 = $receiver_0.iterator();
+                  while (tmp$_1.hasNext()) {
+                    var element_0 = tmp$_1.next();
+                    if (Unificator.Companion.default.match(element, element_0)) {
+                      any$result_0 = true;
+                      break any$break_0;
+                    }
+                  }
+                  any$result_0 = false;
+                }
+                 while (false);
+                if (any$result_0) {
+                  any$result = true;
+                  break any$break;
+                }
+              }
+              any$result = false;
+            }
+             while (false);
+            this.state_0 = 2;
+            this.result_0 = this.local$$receiver.yield_11rb$(tmp$.replyWithCondition(any$result, void 0, []), this);
+            if (this.result_0 === COROUTINE_SUSPENDED)
+              return COROUTINE_SUSPENDED;
+            continue;
+          case 1:
+            throw this.exception_0;
+          case 2:
+            return this.result_0;
+          default:
+            this.state_0 = 1;
+            throw new Error('State Machine Unreachable execution');
+        }
+      } catch (e) {
+        if (this.state_0 === 1) {
+          this.exceptionState_0 = this.state_0;
+          throw e;
+        } else {
+          this.state_0 = this.exceptionState_0;
+          this.exception_0 = e;
+        }
+      }
+     while (true);
+  };
+  function ContainsAny$solve$lambda(closure$request_0, closure$list_0, closure$elemList_0) {
+    return function ($receiver_0, continuation_0, suspended) {
+      var instance = new Coroutine$ContainsAny$solve$lambda(closure$request_0, closure$list_0, closure$elemList_0, $receiver_0, this, continuation_0);
+      if (suspended)
+        return instance;
+      else
+        return instance.doResume(null);
+    };
+  }
+  ContainsAny.prototype.solve = function (request) {
+    var elemList = request.arguments.get_za3lpa$(0);
+    var list = request.arguments.get_za3lpa$(1);
+    if (!Kotlin.isType(list, List)) {
+      throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.LIST, list);
+    }
+    if (!Kotlin.isType(elemList, List)) {
+      throw TypeError.Companion.forGoal(request.context, request.signature, TypeError$Expected.LIST, list);
+    }
+    return sequence(ContainsAny$solve$lambda(request, list, elemList));
+  };
+  ContainsAny.$metadata$ = {
+    kind: Kind_OBJECT,
+    simpleName: 'ContainsAny',
+    interfaces: [Primitive]
+  };
+  var ContainsAny_instance = null;
+  function ContainsAny_getInstance() {
+    if (ContainsAny_instance === null) {
+      new ContainsAny();
+    }
+    return ContainsAny_instance;
   }
   function MetaInterpreterLib() {
     MetaInterpreterLib_instance = this;
@@ -4039,7 +4307,8 @@
   function MetaInterpreterLib_getInstance() {
     if (MetaInterpreterLib_instance === null) {
       new MetaInterpreterLib();
-    }return MetaInterpreterLib_instance;
+    }
+    return MetaInterpreterLib_instance;
   }
   function graph($receiver, context) {
     var it = arguments_0($receiver, context);
@@ -4083,7 +4352,12 @@
   function attacks$lambda$lambda(it) {
     return it.isYes;
   }
-  function attacks$lambda$lambda_0(closure$arguments, this$) {
+  function attacks$lambda$lambda_0(this$) {
+    return function (it) {
+      return new Pair(ensureNotNull(it.substitution.get_11rb$(this$.X)), ensureNotNull(it.substitution.get_11rb$(this$.Y)));
+    };
+  }
+  function attacks$lambda$lambda_1(closure$arguments) {
     return function (solution) {
       var $receiver = closure$arguments;
       var first$result;
@@ -4092,11 +4366,11 @@
         tmp$ = $receiver.iterator();
         while (tmp$.hasNext()) {
           var element = tmp$.next();
-          var this$_0 = this$;
-          if (Unificator.Companion.default.match(element.termRepresentation(), ensureNotNull(solution.substitution.get_11rb$(this$_0.X)))) {
+          if (element.hashCode() === solution.first.hashCode()) {
             first$result = element;
             break first$break;
-          }}
+          }
+        }
         throw new NoSuchElementException_init('Collection contains no element matching the predicate.');
       }
        while (false);
@@ -4108,11 +4382,11 @@
         tmp$_1 = $receiver_0.iterator();
         while (tmp$_1.hasNext()) {
           var element_0 = tmp$_1.next();
-          var this$_1 = this$;
-          if (Unificator.Companion.default.match(element_0.termRepresentation(), ensureNotNull(solution.substitution.get_11rb$(this$_1.Y)))) {
+          if (element_0.hashCode() === solution.second.hashCode()) {
             first$result_0 = element_0;
             break first$break;
-          }}
+          }
+        }
         throw new NoSuchElementException_init('Collection contains no element matching the predicate.');
       }
        while (false);
@@ -4121,7 +4395,7 @@
   }
   function attacks$lambda(this$attacks, closure$context, closure$arguments) {
     return function ($receiver) {
-      return map(filter(this$attacks.solve($receiver.stringInvoke('context_check', closure$context, [$receiver.stringInvoke('attack', $receiver._, [$receiver.X, $receiver.Y, $receiver._])])), attacks$lambda$lambda), attacks$lambda$lambda_0(closure$arguments, $receiver));
+      return map(map(filter(this$attacks.solve($receiver.stringInvoke('context_check', closure$context, [$receiver.stringInvoke('attack', $receiver._, [$receiver.X, $receiver.Y, $receiver._])])), attacks$lambda$lambda), attacks$lambda$lambda_0($receiver)), attacks$lambda$lambda_1(closure$arguments));
     };
   }
   function attacks($receiver, context, arguments_0) {
@@ -4129,15 +4403,15 @@
       return emptyList();
     return toList(prolog(attacks$lambda($receiver, context, arguments_0)));
   }
-  function supports$lambda$lambda$lambda(it) {
+  function supports$lambda$lambda(it) {
     return it.isYes;
   }
-  function supports$lambda$lambda$lambda_0(this$) {
+  function supports$lambda$lambda_0(this$) {
     return function (it) {
-      return ensureNotNull(it.substitution.get_11rb$(this$.X));
+      return new Pair(ensureNotNull(it.substitution.get_11rb$(this$.X)), ensureNotNull(it.substitution.get_11rb$(this$.Y)));
     };
   }
-  function supports$lambda$lambda$lambda_1(closure$arguments, closure$argument) {
+  function supports$lambda$lambda_1(closure$arguments) {
     return function (solution) {
       var $receiver = closure$arguments;
       var first$result;
@@ -4146,65 +4420,85 @@
         tmp$ = $receiver.iterator();
         while (tmp$.hasNext()) {
           var element = tmp$.next();
-          if (Unificator.Companion.default.match(element.termRepresentation(), solution)) {
+          if (element.hashCode() === solution.second.hashCode()) {
             first$result = element;
             break first$break;
-          }}
+          }
+        }
         throw new NoSuchElementException_init('Collection contains no element matching the predicate.');
       }
        while (false);
-      var $receiver_0 = new Support(first$result, closure$argument);
-      closure$argument.supports.add_11rb$($receiver_0.supporter);
-      return $receiver_0;
+      var $receiver_0 = first$result;
+      var $receiver_1 = closure$arguments;
+      var first$result_0;
+      first$break: do {
+        var tmp$_0;
+        tmp$_0 = $receiver_1.iterator();
+        while (tmp$_0.hasNext()) {
+          var element_0 = tmp$_0.next();
+          if (element_0.hashCode() === solution.first.hashCode()) {
+            first$result_0 = element_0;
+            break first$break;
+          }
+        }
+        throw new NoSuchElementException_init('Collection contains no element matching the predicate.');
+      }
+       while (false);
+      var $receiver_2 = new Support(first$result_0, $receiver_0);
+      $receiver_0.supports.add_11rb$($receiver_2.supporter);
+      return $receiver_2;
     };
   }
-  function supports$lambda$lambda(this$supports, closure$context, closure$argument, closure$arguments) {
+  function supports$lambda(this$supports, closure$context, closure$arguments) {
     return function ($receiver) {
-      return toList(map(map(filter(this$supports.solve($receiver.stringInvoke('context_check', closure$context, [$receiver.stringInvoke('support', $receiver.X, [closure$argument.termRepresentation()])])), supports$lambda$lambda$lambda), supports$lambda$lambda$lambda_0($receiver)), supports$lambda$lambda$lambda_1(closure$arguments, closure$argument)));
+      return toList(map(map(filter(this$supports.solve($receiver.stringInvoke('context_check', closure$context, [$receiver.stringInvoke('support', $receiver.X, [$receiver.Y])])), supports$lambda$lambda), supports$lambda$lambda_0($receiver)), supports$lambda$lambda_1(closure$arguments)));
     };
   }
   function supports($receiver, context, arguments_0) {
-    var destination = ArrayList_init_0();
-    var tmp$;
-    tmp$ = arguments_0.iterator();
-    while (tmp$.hasNext()) {
-      var element = tmp$.next();
-      var list = prolog(supports$lambda$lambda($receiver, context, element, arguments_0));
-      addAll(destination, list);
-    }
-    return destination;
+    return prolog(supports$lambda($receiver, context, arguments_0));
   }
   function labels$checkFunctor$lambda$lambda(it) {
     return it.isYes;
   }
-  function labels$checkFunctor$lambda$lambda_0(closure$functor) {
-    return function (it) {
-      return closure$functor;
+  function labels$checkFunctor$lambda$lambda_0(closure$arguments, this$, closure$functor) {
+    return function (res) {
+      var $receiver = closure$arguments;
+      var first$result;
+      first$break: do {
+        var tmp$;
+        tmp$ = $receiver.iterator();
+        while (tmp$.hasNext()) {
+          var element = tmp$.next();
+          var this$_0 = this$;
+          var tmp$_0 = element.hashCode();
+          var $receiver_0 = res.substitution.get_11rb$(this$_0.X);
+          var tmp$_1;
+          if (tmp$_0 === ((tmp$_1 = $receiver_0 != null ? hashCode($receiver_0) : null) != null ? tmp$_1 : 0)) {
+            first$result = element;
+            break first$break;
+          }
+        }
+        throw new NoSuchElementException_init('Collection contains no element matching the predicate.');
+      }
+       while (false);
+      return new LabelledArgument(first$result, closure$functor);
     };
   }
-  function labels$checkFunctor$lambda(this$labels, closure$context, closure$functor, closure$argument) {
+  function labels$checkFunctor$lambda(this$labels, closure$context, closure$functor, closure$arguments) {
     return function ($receiver) {
-      return firstOrNull(map(filter(this$labels.solve($receiver.stringInvoke('context_check', closure$context, [$receiver.stringInvoke(closure$functor, closure$argument.termRepresentation(), [])])), labels$checkFunctor$lambda$lambda), labels$checkFunctor$lambda$lambda_0(closure$functor)));
+      return toList(map(filter(this$labels.solve($receiver.stringInvoke('context_check', closure$context, [$receiver.stringInvoke(closure$functor, $receiver.X, [])])), labels$checkFunctor$lambda$lambda), labels$checkFunctor$lambda$lambda_0(closure$arguments, $receiver, closure$functor)));
     };
   }
-  function labels$checkFunctor(this$labels, closure$context) {
-    return function (functor, argument) {
-      return prolog(labels$checkFunctor$lambda(this$labels, closure$context, functor, argument));
+  function labels$checkFunctor(this$labels, closure$context, closure$arguments) {
+    return function (functor) {
+      return prolog(labels$checkFunctor$lambda(this$labels, closure$context, functor, closure$arguments));
     };
   }
   function labels($receiver, context, arguments_0) {
-    var checkFunctor = labels$checkFunctor($receiver, context);
-    var destination = ArrayList_init(collectionSizeOrDefault(arguments_0, 10));
-    var tmp$;
-    tmp$ = arguments_0.iterator();
-    while (tmp$.hasNext()) {
-      var item = tmp$.next();
-      var tmp$_0, tmp$_1;
-      destination.add_11rb$(new LabelledArgument(item, (tmp$_1 = (tmp$_0 = checkFunctor('in', item)) != null ? tmp$_0 : checkFunctor('out', item)) != null ? tmp$_1 : 'und'));
-    }
-    return destination;
+    var checkFunctor = labels$checkFunctor($receiver, context, arguments_0);
+    return plus(plus(checkFunctor('in'), checkFunctor('out')), checkFunctor('und'));
   }
-  function Argument(rules, topRule, conclusion, groundings, defeasibleRules, defeasiblePremises, lastDefeasibleRules) {
+  function Argument(rules, topRule, conclusion, groundings, defeasibleRules, defeasiblePremises, lastDefeasibleRules, term) {
     Argument$Companion_getInstance();
     if (groundings === void 0)
       groundings = emptyList();
@@ -4214,6 +4508,8 @@
       defeasiblePremises = emptyList();
     if (lastDefeasibleRules === void 0)
       lastDefeasibleRules = emptyList();
+    if (term === void 0)
+      term = null;
     this.rules = rules;
     this.topRule = topRule;
     this.conclusion = conclusion;
@@ -4221,16 +4517,22 @@
     this.defeasibleRules = defeasibleRules;
     this.defeasiblePremises = defeasiblePremises;
     this.lastDefeasibleRules = lastDefeasibleRules;
+    this.term_0 = term;
     this.identifier = '';
     this.supports = ArrayList_init_0();
   }
+  Argument.prototype.hashCode = function () {
+    var $receiver = this.term_0;
+    var tmp$;
+    return (tmp$ = $receiver != null ? hashCode($receiver) : null) != null ? tmp$ : 0;
+  };
   Object.defineProperty(Argument.prototype, 'descriptor', {
     configurable: true,
     get: function () {
       var tmp$, tmp$_0, tmp$_1;
       tmp$_1 = this.identifier + ' : ';
       if (equals(this.topRule, 'none'))
-        tmp$_0 = (tmp$ = firstOrNull_0(this.rules)) != null ? tmp$ : '';
+        tmp$_0 = (tmp$ = firstOrNull(this.rules)) != null ? tmp$ : '';
       else {
         var $receiver = this.supports;
         var destination = ArrayList_init(collectionSizeOrDefault($receiver, 10));
@@ -4253,7 +4555,8 @@
     }
   });
   Argument.prototype.termRepresentation = function () {
-    return parse_1(Struct.Companion, '[' + this.rules + ', ' + this.topRule + ', [' + this.conclusion + '], ' + this.groundings + ', [' + this.lastDefeasibleRules + ', ' + this.defeasibleRules + ', ' + this.defeasiblePremises + ']]');
+    var tmp$;
+    return (tmp$ = this.term_0) != null ? tmp$ : parse_1(Struct.Companion, '[' + this.rules + ', ' + this.topRule + ', [' + this.conclusion + '], ' + this.groundings + ', [' + this.lastDefeasibleRules + ', ' + this.defeasibleRules + ', ' + this.defeasiblePremises + ']]');
   };
   Argument.prototype.toString = function () {
     return 'argument(' + this.termRepresentation() + ')';
@@ -4322,7 +4625,7 @@
     var argDefeasiblePremises = Argument$Companion$of$argDefeasiblePremises(termAsList, toStringList);
     var argLastDefeasibleRules = Argument$Companion$of$argLastDefeasibleRules(termAsList, toStringList);
     var it = termAsList(term);
-    return new Argument(argRules(it), argTopRule(it), argConclusion(it), argGroundings(it), argDefeasibleRules(it), argDefeasiblePremises(it), argLastDefeasibleRules(it));
+    return new Argument(argRules(it), argTopRule(it), argConclusion(it), argGroundings(it), argDefeasibleRules(it), argDefeasiblePremises(it), argLastDefeasibleRules(it), term);
   };
   Argument$Companion.$metadata$ = {
     kind: Kind_OBJECT,
@@ -4333,7 +4636,8 @@
   function Argument$Companion_getInstance() {
     if (Argument$Companion_instance === null) {
       new Argument$Companion();
-    }return Argument$Companion_instance;
+    }
+    return Argument$Companion_instance;
   }
   Argument.$metadata$ = {
     kind: Kind_CLASS,
@@ -4361,22 +4665,14 @@
   Argument.prototype.component7 = function () {
     return this.lastDefeasibleRules;
   };
-  Argument.prototype.copy_2b7ur7$ = function (rules, topRule, conclusion, groundings, defeasibleRules, defeasiblePremises, lastDefeasibleRules) {
-    return new Argument(rules === void 0 ? this.rules : rules, topRule === void 0 ? this.topRule : topRule, conclusion === void 0 ? this.conclusion : conclusion, groundings === void 0 ? this.groundings : groundings, defeasibleRules === void 0 ? this.defeasibleRules : defeasibleRules, defeasiblePremises === void 0 ? this.defeasiblePremises : defeasiblePremises, lastDefeasibleRules === void 0 ? this.lastDefeasibleRules : lastDefeasibleRules);
+  Argument.prototype.component8_0 = function () {
+    return this.term_0;
   };
-  Argument.prototype.hashCode = function () {
-    var result = 0;
-    result = result * 31 + Kotlin.hashCode(this.rules) | 0;
-    result = result * 31 + Kotlin.hashCode(this.topRule) | 0;
-    result = result * 31 + Kotlin.hashCode(this.conclusion) | 0;
-    result = result * 31 + Kotlin.hashCode(this.groundings) | 0;
-    result = result * 31 + Kotlin.hashCode(this.defeasibleRules) | 0;
-    result = result * 31 + Kotlin.hashCode(this.defeasiblePremises) | 0;
-    result = result * 31 + Kotlin.hashCode(this.lastDefeasibleRules) | 0;
-    return result;
+  Argument.prototype.copy_fhhptr$ = function (rules, topRule, conclusion, groundings, defeasibleRules, defeasiblePremises, lastDefeasibleRules, term) {
+    return new Argument(rules === void 0 ? this.rules : rules, topRule === void 0 ? this.topRule : topRule, conclusion === void 0 ? this.conclusion : conclusion, groundings === void 0 ? this.groundings : groundings, defeasibleRules === void 0 ? this.defeasibleRules : defeasibleRules, defeasiblePremises === void 0 ? this.defeasiblePremises : defeasiblePremises, lastDefeasibleRules === void 0 ? this.lastDefeasibleRules : lastDefeasibleRules, term === void 0 ? this.term_0 : term);
   };
   Argument.prototype.equals = function (other) {
-    return this === other || (other !== null && (typeof other === 'object' && (Object.getPrototypeOf(this) === Object.getPrototypeOf(other) && (Kotlin.equals(this.rules, other.rules) && Kotlin.equals(this.topRule, other.topRule) && Kotlin.equals(this.conclusion, other.conclusion) && Kotlin.equals(this.groundings, other.groundings) && Kotlin.equals(this.defeasibleRules, other.defeasibleRules) && Kotlin.equals(this.defeasiblePremises, other.defeasiblePremises) && Kotlin.equals(this.lastDefeasibleRules, other.lastDefeasibleRules)))));
+    return this === other || (other !== null && (typeof other === 'object' && (Object.getPrototypeOf(this) === Object.getPrototypeOf(other) && (Kotlin.equals(this.rules, other.rules) && Kotlin.equals(this.topRule, other.topRule) && Kotlin.equals(this.conclusion, other.conclusion) && Kotlin.equals(this.groundings, other.groundings) && Kotlin.equals(this.defeasibleRules, other.defeasibleRules) && Kotlin.equals(this.defeasiblePremises, other.defeasiblePremises) && Kotlin.equals(this.lastDefeasibleRules, other.lastDefeasibleRules) && Kotlin.equals(this.term_0, other.term_0)))));
   };
   function Attack(attacker, target, type, on) {
     if (type === void 0)
@@ -4457,7 +4753,8 @@
   function Graph$Companion_getInstance() {
     if (Graph$Companion_instance === null) {
       new Graph$Companion();
-    }return Graph$Companion_instance;
+    }
+    return Graph$Companion_instance;
   }
   Graph.$metadata$ = {
     kind: Kind_CLASS,
@@ -4683,7 +4980,8 @@
   function EngineInterface_getInstance() {
     if (EngineInterface_instance === null) {
       new EngineInterface();
-    }return EngineInterface_instance;
+    }
+    return EngineInterface_instance;
   }
   function AbstractMode() {
     AbstractMode_instance = this;
@@ -4704,7 +5002,8 @@
   function AbstractMode_getInstance() {
     if (AbstractMode_instance === null) {
       new AbstractMode();
-    }return AbstractMode_instance;
+    }
+    return AbstractMode_instance;
   }
   function ArgumentationGraphBuilder() {
     ArgumentationGraphBuilder_instance = this;
@@ -4725,7 +5024,8 @@
   function ArgumentationGraphBuilder_getInstance() {
     if (ArgumentationGraphBuilder_instance === null) {
       new ArgumentationGraphBuilder();
-    }return ArgumentationGraphBuilder_instance;
+    }
+    return ArgumentationGraphBuilder_instance;
   }
   function AttackRestrictionHandler() {
     AttackRestrictionHandler_instance = this;
@@ -4746,7 +5046,8 @@
   function AttackRestrictionHandler_getInstance() {
     if (AttackRestrictionHandler_instance === null) {
       new AttackRestrictionHandler();
-    }return AttackRestrictionHandler_instance;
+    }
+    return AttackRestrictionHandler_instance;
   }
   function BpMetaGraphHandler() {
     BpMetaGraphHandler_instance = this;
@@ -4767,7 +5068,8 @@
   function BpMetaGraphHandler_getInstance() {
     if (BpMetaGraphHandler_instance === null) {
       new BpMetaGraphHandler();
-    }return BpMetaGraphHandler_instance;
+    }
+    return BpMetaGraphHandler_instance;
   }
   function DefeasiblePreferencesHandler() {
     DefeasiblePreferencesHandler_instance = this;
@@ -4788,7 +5090,8 @@
   function DefeasiblePreferencesHandler_getInstance() {
     if (DefeasiblePreferencesHandler_instance === null) {
       new DefeasiblePreferencesHandler();
-    }return DefeasiblePreferencesHandler_instance;
+    }
+    return DefeasiblePreferencesHandler_instance;
   }
   function GenericDefeasiblePreferencesHandler() {
     GenericDefeasiblePreferencesHandler_instance = this;
@@ -4809,7 +5112,8 @@
   function GenericDefeasiblePreferencesHandler_getInstance() {
     if (GenericDefeasiblePreferencesHandler_instance === null) {
       new GenericDefeasiblePreferencesHandler();
-    }return GenericDefeasiblePreferencesHandler_instance;
+    }
+    return GenericDefeasiblePreferencesHandler_instance;
   }
   function StrictPreferencesHandler() {
     StrictPreferencesHandler_instance = this;
@@ -4830,7 +5134,8 @@
   function StrictPreferencesHandler_getInstance() {
     if (StrictPreferencesHandler_instance === null) {
       new StrictPreferencesHandler();
-    }return StrictPreferencesHandler_instance;
+    }
+    return StrictPreferencesHandler_instance;
   }
   function BpCompleteLabeller() {
     BpCompleteLabeller_instance = this;
@@ -4851,7 +5156,8 @@
   function BpCompleteLabeller_getInstance() {
     if (BpCompleteLabeller_instance === null) {
       new BpCompleteLabeller();
-    }return BpCompleteLabeller_instance;
+    }
+    return BpCompleteLabeller_instance;
   }
   function BpLabeller() {
     BpLabeller_instance = this;
@@ -4872,7 +5178,8 @@
   function BpLabeller_getInstance() {
     if (BpLabeller_instance === null) {
       new BpLabeller();
-    }return BpLabeller_instance;
+    }
+    return BpLabeller_instance;
   }
   function BpPartialLabeller() {
     BpPartialLabeller_instance = this;
@@ -4893,7 +5200,8 @@
   function BpPartialLabeller_getInstance() {
     if (BpPartialLabeller_instance === null) {
       new BpPartialLabeller();
-    }return BpPartialLabeller_instance;
+    }
+    return BpPartialLabeller_instance;
   }
   function CompleteLabeller() {
     CompleteLabeller_instance = this;
@@ -4914,7 +5222,8 @@
   function CompleteLabeller_getInstance() {
     if (CompleteLabeller_instance === null) {
       new CompleteLabeller();
-    }return CompleteLabeller_instance;
+    }
+    return CompleteLabeller_instance;
   }
   function GroundedLabeller() {
     GroundedLabeller_instance = this;
@@ -4935,7 +5244,8 @@
   function GroundedLabeller_getInstance() {
     if (GroundedLabeller_instance === null) {
       new GroundedLabeller();
-    }return GroundedLabeller_instance;
+    }
+    return GroundedLabeller_instance;
   }
   function GroundedLabellerOptimized() {
     GroundedLabellerOptimized_instance = this;
@@ -4956,7 +5266,8 @@
   function GroundedLabellerOptimized_getInstance() {
     if (GroundedLabellerOptimized_instance === null) {
       new GroundedLabellerOptimized();
-    }return GroundedLabellerOptimized_instance;
+    }
+    return GroundedLabellerOptimized_instance;
   }
   function StatementLabeller() {
     StatementLabeller_instance = this;
@@ -4977,7 +5288,8 @@
   function StatementLabeller_getInstance() {
     if (StatementLabeller_instance === null) {
       new StatementLabeller();
-    }return StatementLabeller_instance;
+    }
+    return StatementLabeller_instance;
   }
   function RuleParser() {
     RuleParser_instance = this;
@@ -4998,7 +5310,8 @@
   function RuleParser_getInstance() {
     if (RuleParser_instance === null) {
       new RuleParser();
-    }return RuleParser_instance;
+    }
+    return RuleParser_instance;
   }
   function AbstractMode_0() {
     AbstractMode_instance_0 = this;
@@ -5013,7 +5326,8 @@
   function AbstractMode_getInstance_0() {
     if (AbstractMode_instance_0 === null) {
       new AbstractMode_0();
-    }return AbstractMode_instance_0;
+    }
+    return AbstractMode_instance_0;
   }
   function ArgumentationEngineInterface() {
     ArgumentationEngineInterface_instance = this;
@@ -5028,11 +5342,12 @@
   function ArgumentationEngineInterface_getInstance() {
     if (ArgumentationEngineInterface_instance === null) {
       new ArgumentationEngineInterface();
-    }return ArgumentationEngineInterface_instance;
+    }
+    return ArgumentationEngineInterface_instance;
   }
   function ArgumentationGraph() {
     ArgumentationGraph_instance = this;
-    this.theoryCode = trimIndent('\n    buildArgumentationGraph :-\n        buildArguments,\n        buildAttacks.\n    buildArguments :-\n    \tbuildArgumentsFromPremises,\n    \tbuildArgumentsFromEmptyRules,\n    \tfindall([RuleID, RuleBody, RuleHead], (\n    \t    parser::classic_rule(RuleID, RuleBody, RuleHead),\n    \t    \\+ emptyRule([RuleID, RuleBody, RuleHead])\n        ), Rules),\n    \tbuildArgumentsFromRules(b, Rules, Rules, n).\n    buildArgumentsFromPremises :-\n        findall(\n            _,\n            (\n                parser::classic_rule(PremiseID, Premise),\n                checkStrict(PremiseID, DefPrem),\n                ground(Premise),\n                context_assert(argument([[PremiseID], none, Premise, [], [[], [], DefPrem]])),\n                context_assert(conc(Premise) :- argument([[PremiseID], none, Premise, [], [[], [], DefPrem]])),\n                context_assert(newConc(a, Premise)),\n                utils::hash(argument([[PremiseID], none, Premise, [], [[], [], DefPrem]]), Id),\n                context_assert(arg(Id) :- argument([[PremiseID], none, Premise, [], [[], [], DefPrem]]))\n            ),\n            _\n        ).\n    buildArgumentsFromEmptyRules :-\n        findall(\n            _,\n            (\n                emptyRule([RuleID, RulePrem, RuleHead]),\n                checkStrict(RuleID, DefRule),\n                ground(RuleHead),\n                context_assert(argument([[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]])),\n                context_assert(conc(Premise) :- argument([[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]])),\n                context_assert(newConc(a, Premise)),\n                utils::hash(argument([[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]]), Id),\n                context_assert(arg(Id) :- argument([[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]]))\n            ),\n            _\n        ).\n    emptyRule([RuleID, Body, RuleHead]) :-\n        parser::classic_rule(RuleID, Body, RuleHead),\n        \\+ (member(X, Body), X \\= ~(_), X \\= prolog(_)),\n        checkPrologClauses(Body).\n    checkPrologClauses([]) :- !.\n    checkPrologClauses([~(_)|T]) :- checkPrologClauses(T), !.\n    checkPrologClauses([prolog(Check)|T]) :-\n        (callable(Check) -> call(Check); Check),\n        checkPrologClauses(T).\n    clean(Tn, Rules) :-\n        invert(Tn, Tx),\n        context_retract(newConc(Tx, _)),\n        buildArgumentsFromRules(Tx, Rules, Rules, n).\n    check_new(Tn, H) :-\n        copy_term(H, [_, RuleBody, _]),\n        member(prolog(_), RuleBody), !.\n    check_new(Tn, H) :-\n        copy_term(H, [_, RuleBody, _]),\n        member(X, RuleBody),\n        invert(Tn, Tx),\n        context_check(newConc(Tx, [X])).\n    invert(a, b).\n    invert(b, a).\n    buildArgumentsFromRules(_, Rules, [], n).\n    buildArgumentsFromRules(Tn, Rules, [], y) :- clean(Tn, Rules).\n    buildArgumentsFromRules(Tn, Rules, [H|T], _) :-\n        once(check_new(Tn, H)),\n        copy_term(H, HH),\n        findall(true, buildArgumentsFromRule(Tn, HH), R),\n        R \\== [],\n        buildArgumentsFromRules(Tn, Rules, T, y), !.\n    buildArgumentsFromRules(Tn, Rules, [_|T], X) :-\n        buildArgumentsFromRules(Tn, Rules, T, X).\n    buildArgumentsFromRule(Tn, [RuleID, RuleBody, RuleHead]) :-\n    \truleBodyIsSupported(RuleBody, [], [], SupportRules, ArgSupports),\n    \t\\+ member(RuleID, SupportRules),\n    \tground(RuleHead),\n    \tutils::sort([RuleID|SupportRules], SortedPremises),\n    \t\\+ context_check(argument([SortedPremises, RuleID, RuleHead, RuleBody, _])),\n    \tbuildArgumentInfo(ArgSupports, RuleID, Info),\n        NewArgument = [SortedPremises, RuleID, RuleHead, RuleBody, Info],\n        context_assert(conc(RuleHead) :- argument(NewArgument)),\n        context_assert(newConc(Tn, RuleHead)),\n    \tcontext_assert(argument(NewArgument)),\n    \tutils::hash(argument(NewArgument), Id),\n    \tcontext_assert(arg(Id) :- argument(NewArgument)),\n    \tsupports(NewArgument, ArgSupports).\n    supports(Argument, Supports) :-\n        findall(_, (\n            member(S, Supports),\n            context_assert(support(S, Argument))\n        ), _).\n    checkStrict(Id, [Id]) :- \\+ parser::check_strict(Id).\n    checkStrict(Id, []) :- parser::check_strict(Id).\n    buildArgumentInfo(Supports, RuleId, [LastDefRules, DefRules, DefPrem]) :-\n        defeasibleRules(RuleId, Supports, DefRules),\n        ordinaryPremises(Supports, DefPrem),\n        lastDefeasibleRules(Supports, RuleId, LastDefRules).\n    ordinaryPremises(Supports, DefPrem) :-\n        findall(Def, member([_, _, _, _, [_, _, Def]], Supports), Prem),\n        utils::appendLists(Prem, TempPrem),\n        utils::sortDistinct(TempPrem, DefPrem).\n    defeasibleRules(RuleId, Supports, DefRules) :-\n    \tfindall(Def, member([_, _, _, _, [_, Def, _]], Supports), UnsortedRules),\n    \tcheckStrict(RuleId, DefRule),\n    \tutils::appendLists([DefRule|UnsortedRules], TempRules),\n    \tutils::sortDistinct(TempRules, DefRules).\n    lastDefeasibleRules(_, TopRule, [TopRule]) :-\n        TopRule \\== none, \\+ parser::check_strict(TopRule).\n    lastDefeasibleRules(Supports, TopRule, LastRules) :-\n    \tparser::check_strict(TopRule),\n    \tfindall(Def, member([_, _, _, _, [Def, _, _]], Supports), Res),\n    \tutils::appendLists(Res, TempLastRules),\n    \tutils::sortDistinct(TempLastRules, LastRules).\n    ruleBodyIsSupported([], ResultPremises, ResultSupports, ResultPremises, ResultSupports).\n    ruleBodyIsSupported([~(_)|Others], Premises, Supports, ResultPremises, ResultSupports) :-\n    \truleBodyIsSupported(Others, Premises, Supports, ResultPremises, ResultSupports), !.\n    ruleBodyIsSupported([prolog(Check)|Others], Premises, Supports, ResultPremises, ResultSupports) :-\n    \t(callable(Check) -> call(Check); Check),\n    \truleBodyIsSupported(Others, Premises, Supports, ResultPremises, ResultSupports), !.\n    ruleBodyIsSupported([Statement|Others], Premises, Supports, ResultPremises, ResultSupports) :-\n        context_check(clause(conc([Statement]), argument([ArgumentID, RuleID, [Statement], Body, Info]))),\n    \tappend(ArgumentID, Premises, NewPremises),\n    \truleBodyIsSupported(Others, NewPremises, [[ArgumentID, RuleID, [Statement], Body, Info]|Supports], ResultPremises, ResultSupports).\n    findPossibleAttackers([_, _, Head, _, _], Conf) :-\n        conflict(Conf, Head, Guard).\n    findPossibleAttackers([_, _, Head, _, _], Conf) :-\n        conflict(Conf, Head).\n    findPossibleAttackers([_, _, _, Prem, _], [Conf]) :-\n        member(~(Conf), Prem).\n    findPossibleAttackers([_, RuleID, _, _, _], [undercut(RuleID)]).\n    buildAttacks :-\n    \tbuildDirectAttacks,\n    \tbuildTransitiveAttacks.\n    buildDirectAttacks :-\n        findall(_, buildDirectAttack, _).\n    buildDirectAttack :-\n        context_check(argument(A)),\n        findPossibleAttackers(A, BB),\n    \tcontext_check(clause(conc(BB), argument(B))),\n    \tA \\== B,\n        attacks(T, B, A),\n    \t\\+ context_check(attack(T, B, A, A)),\n    \tcontext_assert(attack(T, B, A, A)),\n    \tutils::hash(argument(A), IdA),\n    \tutils::hash(argument(B), IdB),\n    \tcontext_assert(att(IdB, IdA) :- attack(T, B, A, A)),\n    \tfail.\n    buildDirectAttack.\n    buildTransitiveAttacks :-\n    \tcontext_check(attack(T, A, B, D)),\n    \tcontext_check(support(B, C)),\n    \t\\+ context_check(attack(T, A, C, D)), !,\n    \tcontext_assert(attack(T, A, C, D)),\n        utils::hash(argument(A), IdA),\n        utils::hash(argument(C), IdC),\n        context_assert(att(IdA, IdC) :- attack(T, B, C, D)),\n        buildTransitiveAttacks.\n    buildTransitiveAttacks.\n    attacks(rebut, A, B) :- rebuts(A, B), !.\n    attacks(contrary_rebut, A, B) :- contraryRebuts(A, B), !.\n    attacks(undermine, A, B) :- undermines(A, B), !.\n    attacks(contrary_undermine, A, B) :- contraryUndermines(A, B), !.\n    attacks(undercut, A, B) :- undercuts(A, B), !.\n    expanded_conflict(HeadA, HeadB) :-\n        conflict(HeadA, HeadB).\n    expanded_conflict(HeadA, HeadB) :-\n        conflict(HeadA, HeadB, Guard),\n        (callable(Guard) -> call(Guard); Guard).\n    rebuts([IDPremisesA, RuleA, RuleHeadA, _, _], [IDPremisesB, RuleB, RuleHeadB, _, Info]) :-\n    \tRuleB \\== none,\n        Info \\== [[], [], []],\n    \texpanded_conflict(RuleHeadA, RuleHeadB).\n    contraryRebuts([IDPremisesA, RuleA, [RuleHeadA], _, _], [IDPremisesB, RuleB, RuleHeadB, Body, Info]) :-\n    \tRuleA \\== none,\n    \tRuleB \\== none,\n    \tmember(~(RuleHeadA), Body).\n    undermines([IDPremisesA, RuleA, RuleHeadA, _, _], [[IDPremiseB], none, RuleHeadB, _, Info]) :-\n    \tInfo \\== [[], [], []],\n    \texpanded_conflict(RuleHeadA, RuleHeadB).\n    contraryUndermines([IDPremisesA, none, [RuleHeadA], _, _], [IDPremisesB, RuleB, RuleHeadB, Body, Info]) :-\n    \tRuleB \\== none,\n    \tmember(~(RuleHeadA), Body).\n    undercuts([_, _, [undercut(RuleB)], _, _], [_, RuleB, _, _, [[RuleB], _, _]]).\n    check(-Atom).\n    conflict([Atom], [-Atom]) :- \\+ check(Atom).\n    conflict([-Atom], [Atom]).\n    conflict([o(Atom)], [o(-Atom)]) :- \\+ check(Atom).\n    conflict([o(-Atom)], [o(Atom)]).\n    conflict([p(Atom)], [o(-Atom)]) :- \\+ check(Atom).\n    conflict([o(-Atom)], [p(Atom)]).\n    conflict([p(-Atom)], [o(Atom)]).\n    conflict([o(Atom)], [p(-Atom)]) :- \\+ check(Atom).\n    conflict([sup(X, Y)], [sup(Y, X)]).\n        ');
+    this.theoryCode = trimIndent('\n    buildArgumentationGraph :-\n        buildArguments,\n        buildAttacks.\n    buildArguments :-\n    \tbuildArgumentsFromPremises,\n    \tbuildArgumentsFromEmptyRules,\n    \tfindall([RuleID, RuleBody, RuleHead], (\n    \t    parser::classic_rule(RuleID, RuleBody, RuleHead),\n    \t    \\+ emptyRule([RuleID, RuleBody, RuleHead])\n        ), Rules),\n        findall(X, context_check(newConc(a, [X])), N),\n    \tbuildArgumentsFromRules(N, b, Rules, Rules, n).\n    buildArgumentsFromPremises :-\n        findall(\n            _,\n            (\n                parser::classic_rule(PremiseID, Premise),\n                checkStrict(PremiseID, DefPrem),\n                ground(Premise),\n                context_assert(argument([[PremiseID], none, Premise, [], [[], [], DefPrem]])),\n                context_assert(conc(Premise) :- argument([[PremiseID], none, Premise, [], [[], [], DefPrem]])),\n                context_assert(newConc(a, Premise)),\n                utils::hash(argument([[PremiseID], none, Premise, [], [[], [], DefPrem]]), Id),\n                context_assert(arg(Id) :- argument([[PremiseID], none, Premise, [], [[], [], DefPrem]]))\n            ),\n            _\n        ).\n    buildArgumentsFromEmptyRules :-\n        findall(\n            _,\n            (\n                emptyRule([RuleID, RulePrem, RuleHead]),\n                checkStrict(RuleID, DefRule),\n                ground(RuleHead),\n                context_assert(argument([[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]])),\n                context_assert(conc(RuleHead) :- argument([[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]])),\n                context_assert(newConc(a, RuleHead)),\n                utils::hash(argument([[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]]), Id),\n                context_assert(arg(Id) :- argument([[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]]))\n            ),\n            _\n        ).\n    emptyRule([RuleID, Body, RuleHead]) :-\n        parser::classic_rule(RuleID, Body, RuleHead),\n        \\+ (member(X, Body), X \\= ~(_), X \\= prolog(_)),\n        checkPrologClauses(Body).\n    checkPrologClauses([]) :- !.\n    checkPrologClauses([~(_)|T]) :- checkPrologClauses(T), !.\n    checkPrologClauses([prolog(Check)|T]) :-\n        (callable(Check) -> call(Check); Check),\n        checkPrologClauses(T).\n    clean(Tn, Rules) :-\n        invert(Tn, Tx),\n        context_retract(newConc(Tx, _)),\n        findall(X, context_check(newConc(Tn, [X])), N),\n        buildArgumentsFromRules(N, Tx, Rules, Rules, n).\n    invert(a, b).\n    invert(b, a).\n    buildArgumentsFromRules(_, _, Rules, [], n) :- !.\n    buildArgumentsFromRules(_, Tn, Rules, [], y) :- !, clean(Tn, Rules).\n    buildArgumentsFromRules(N, Tn, Rules, [[Id, Body, Conc]|T], _) :-\n        utils::contains_any(Body, N),\n        findall(true, buildArgumentsFromRule(Tn, [Id, Body, Conc]), R),\n        R \\== [],\n        buildArgumentsFromRules(N, Tn, Rules, T, y), !.\n    buildArgumentsFromRules(N, Tn, Rules, [_|T], X) :-\n        buildArgumentsFromRules(N, Tn, Rules, T, X).\n    buildArgumentsFromRule(Tn, [RuleID, RuleBody, RuleHead]) :-\n    \truleBodyIsSupported(RuleID, RuleHead, RuleBody, RuleBody, [[], [], [], []], Argument),\n        context_assert(newConc(Tn, RuleHead)).\n    checkStrict(Id, []) :- parser::check_strict(Id), !.\n    checkStrict(Id, [Id]).\n    defRules(Id, Def, Def) :- parser::check_strict(Id), !.\n    defRules(Id, Def, [Id|Def]).\n    lastDefRules(Id, LDef, LDef) :- parser::check_strict(Id), !.\n    lastDefRules(Id, LDef, [Id]) :- Id \\== none, \\+ parser::check_strict(Id).\n    argumentInfo(RuleId, LDef, Def, Prem, [FLDef, FDef, FPrem]) :-\n        utils::sortDistinct(Prem, FPrem),\n        defRules(RuleId, Def, NDef),\n        utils::sortDistinct(NDef, FDef),\n        lastDefRules(RuleId, LDef, NLDef),\n        utils::sortDistinct(NLDef, FLDef).\n    ruleBodyIsSupported(RuleID, RuleHead, RuleBody, [], [TAll, TLDef, TDef, TPrem], Argument) :-\n        ground(RuleHead),\n        \\+ context_check(clause(conc(RuleHead), argument([_, RuleID, RuleHead, RuleBody, _]))),\n        utils::appendLists(TAll, All),\n        \\+ utils::contains(RuleID, All),\n        utils::appendLists(TLDef, LDef),\n        utils::appendLists(TDef, Def),\n        utils::appendLists(TPrem, Prem),\n        argumentInfo(RuleID, LDef, Def, Prem, Info),\n        utils::sort([RuleID|All], Rules),\n        Argument = [Rules, RuleID, RuleHead, RuleBody, Info],\n        context_assert(conc(RuleHead) :- argument(Argument)),\n        context_assert(argument(Argument)),\n        utils::hash(argument(Argument), Id),\n        context_assert(arg(Id) :- argument(Argument)).\n    ruleBodyIsSupported(RuleID, RuleHead, RuleBody, [~(_)|Others], Info, Argument) :-\n    \truleBodyIsSupported(RuleID, RuleHead, RuleBody, Others, Info, Argument).\n    ruleBodyIsSupported(RuleID, RuleHead, RuleBody, [prolog(Check)|Others], Info, Argument) :-\n    \t(callable(Check) -> call(Check); Check),\n    \truleBodyIsSupported(RuleID, RuleHead, RuleBody, Others, Info, Argument).\n    ruleBodyIsSupported(RuleId, RuleHead, RuleBody, [Statement|Others], [All, LDef, Def, Prem], Argument) :-\n        context_check(clause(conc([Statement]), argument([ArgumentID, RuleID, [Statement], Body, [NLDef, NDef, NPrem]]))),\n    \truleBodyIsSupported(RuleId, RuleHead, RuleBody, Others, [[ArgumentID|All], [NLDef|LDef], [NDef|Def], [NPrem|Prem]], Argument),\n    \tcontext_assert(support([ArgumentID, RuleID, [Statement], Body, [NLDef, NDef, NPrem]], Argument)).\n    findPossibleAttackers([_, _, Head, _, _], Conf) :-\n        conflict(Conf, Head, Guard).\n    findPossibleAttackers([_, _, Head, _, _], Conf) :-\n        conflict(Conf, Head).\n    findPossibleAttackers([_, _, _, Prem, _], [Conf]) :-\n        member(~(Conf), Prem).\n    findPossibleAttackers([_, RuleID, _, _, _], [undercut(RuleID)]).\n    buildAttacks :-\n    \tbuildDirectAttacks,\n    \tbuildTransitiveAttacks.\n    buildDirectAttacks :-\n        findall(_, buildDirectAttack, _).\n    buildDirectAttack :-\n        context_check(argument(A)),\n        findPossibleAttackers(A, BB),\n    \tcontext_check(clause(conc(BB), argument(B))),\n    \tA \\== B,\n        attacks(T, B, A),\n    \t\\+ context_check(attack(T, B, A, A)),\n    \tcontext_assert(attack(T, B, A, A)),\n    \tutils::hash(argument(A), IdA),\n    \tutils::hash(argument(B), IdB),\n    \tcontext_assert(att(IdB, IdA) :- attack(T, B, A, A)),\n    \tfail.\n    buildDirectAttack.\n    buildTransitiveAttacks :-\n    \tcontext_check(attack(T, A, B, D)),\n    \tcontext_check(support(B, C)),\n    \t\\+ context_check(attack(T, A, C, D)), !,\n    \tcontext_assert(attack(T, A, C, D)),\n        utils::hash(argument(A), IdA),\n        utils::hash(argument(C), IdC),\n        context_assert(att(IdA, IdC) :- attack(T, B, C, D)),\n        buildTransitiveAttacks.\n    buildTransitiveAttacks.\n    attacks(rebut, A, B) :- rebuts(A, B), !.\n    attacks(contrary_rebut, A, B) :- contraryRebuts(A, B), !.\n    attacks(undermine, A, B) :- undermines(A, B), !.\n    attacks(contrary_undermine, A, B) :- contraryUndermines(A, B), !.\n    attacks(undercut, A, B) :- undercuts(A, B), !.\n    expanded_conflict(HeadA, HeadB) :-\n        conflict(HeadA, HeadB).\n    expanded_conflict(HeadA, HeadB) :-\n        conflict(HeadA, HeadB, Guard),\n        (callable(Guard) -> call(Guard); Guard).\n    rebuts([IDPremisesA, RuleA, RuleHeadA, _, _], [IDPremisesB, RuleB, RuleHeadB, _, Info]) :-\n    \tRuleB \\== none,\n        Info \\== [[], [], []],\n    \texpanded_conflict(RuleHeadA, RuleHeadB).\n    contraryRebuts([IDPremisesA, RuleA, [RuleHeadA], _, _], [IDPremisesB, RuleB, RuleHeadB, Body, Info]) :-\n    \tRuleA \\== none,\n    \tRuleB \\== none,\n    \tutils::contains(~(RuleHeadA), Body).\n    undermines([IDPremisesA, RuleA, RuleHeadA, _, _], [[IDPremiseB], none, RuleHeadB, _, Info]) :-\n    \tInfo \\== [[], [], []],\n    \texpanded_conflict(RuleHeadA, RuleHeadB).\n    contraryUndermines([IDPremisesA, none, [RuleHeadA], _, _], [IDPremisesB, RuleB, RuleHeadB, Body, Info]) :-\n    \tRuleB \\== none,\n    \tutils::contains(~(RuleHeadA), Body).\n    undercuts([_, _, [undercut(RuleB)], _, _], [_, RuleB, _, _, [[RuleB], _, _]]).\n    check(-Atom).\n    conflict([Atom], [-Atom]) :- \\+ check(Atom).\n    conflict([-Atom], [Atom]).\n    conflict([o(Atom)], [o(-Atom)]) :- \\+ check(Atom).\n    conflict([o(-Atom)], [o(Atom)]).\n    conflict([p(Atom)], [o(-Atom)]) :- \\+ check(Atom).\n    conflict([o(-Atom)], [p(Atom)]).\n    conflict([p(-Atom)], [o(Atom)]).\n    conflict([o(Atom)], [p(-Atom)]) :- \\+ check(Atom).\n    conflict([sup(X, Y)], [sup(Y, X)]).\n        ');
   }
   ArgumentationGraph.$metadata$ = {
     kind: Kind_OBJECT,
@@ -5043,7 +5358,8 @@
   function ArgumentationGraph_getInstance() {
     if (ArgumentationGraph_instance === null) {
       new ArgumentationGraph();
-    }return ArgumentationGraph_instance;
+    }
+    return ArgumentationGraph_instance;
   }
   function AttackRestriction() {
     AttackRestriction_instance = this;
@@ -5058,7 +5374,8 @@
   function AttackRestriction_getInstance() {
     if (AttackRestriction_instance === null) {
       new AttackRestriction();
-    }return AttackRestriction_instance;
+    }
+    return AttackRestriction_instance;
   }
   function Bp() {
     Bp_instance = this;
@@ -5073,7 +5390,8 @@
   function Bp_getInstance() {
     if (Bp_instance === null) {
       new Bp();
-    }return Bp_instance;
+    }
+    return Bp_instance;
   }
   function BpGrounded() {
     BpGrounded_instance = this;
@@ -5088,7 +5406,8 @@
   function BpGrounded_getInstance() {
     if (BpGrounded_instance === null) {
       new BpGrounded();
-    }return BpGrounded_instance;
+    }
+    return BpGrounded_instance;
   }
   function BpGroundedComplete() {
     BpGroundedComplete_instance = this;
@@ -5103,7 +5422,8 @@
   function BpGroundedComplete_getInstance() {
     if (BpGroundedComplete_instance === null) {
       new BpGroundedComplete();
-    }return BpGroundedComplete_instance;
+    }
+    return BpGroundedComplete_instance;
   }
   function BpGroundedPartial() {
     BpGroundedPartial_instance = this;
@@ -5118,7 +5438,8 @@
   function BpGroundedPartial_getInstance() {
     if (BpGroundedPartial_instance === null) {
       new BpGroundedPartial();
-    }return BpGroundedPartial_instance;
+    }
+    return BpGroundedPartial_instance;
   }
   function Complete() {
     Complete_instance = this;
@@ -5133,7 +5454,8 @@
   function Complete_getInstance() {
     if (Complete_instance === null) {
       new Complete();
-    }return Complete_instance;
+    }
+    return Complete_instance;
   }
   function Debug() {
     Debug_instance = this;
@@ -5148,7 +5470,8 @@
   function Debug_getInstance() {
     if (Debug_instance === null) {
       new Debug();
-    }return Debug_instance;
+    }
+    return Debug_instance;
   }
   function DefPreferences() {
     DefPreferences_instance = this;
@@ -5163,7 +5486,8 @@
   function DefPreferences_getInstance() {
     if (DefPreferences_instance === null) {
       new DefPreferences();
-    }return DefPreferences_instance;
+    }
+    return DefPreferences_instance;
   }
   function GenericDefPreferences() {
     GenericDefPreferences_instance = this;
@@ -5178,7 +5502,8 @@
   function GenericDefPreferences_getInstance() {
     if (GenericDefPreferences_instance === null) {
       new GenericDefPreferences();
-    }return GenericDefPreferences_instance;
+    }
+    return GenericDefPreferences_instance;
   }
   function Grounded() {
     Grounded_instance = this;
@@ -5193,7 +5518,8 @@
   function Grounded_getInstance() {
     if (Grounded_instance === null) {
       new Grounded();
-    }return Grounded_instance;
+    }
+    return Grounded_instance;
   }
   function GroundedOptimized() {
     GroundedOptimized_instance = this;
@@ -5208,7 +5534,8 @@
   function GroundedOptimized_getInstance() {
     if (GroundedOptimized_instance === null) {
       new GroundedOptimized();
-    }return GroundedOptimized_instance;
+    }
+    return GroundedOptimized_instance;
   }
   function Preferences() {
     Preferences_instance = this;
@@ -5223,7 +5550,8 @@
   function Preferences_getInstance() {
     if (Preferences_instance === null) {
       new Preferences();
-    }return Preferences_instance;
+    }
+    return Preferences_instance;
   }
   function QueryMode_0() {
     QueryMode_instance_0 = this;
@@ -5238,7 +5566,8 @@
   function QueryMode_getInstance_0() {
     if (QueryMode_instance_0 === null) {
       new QueryMode_0();
-    }return QueryMode_instance_0;
+    }
+    return QueryMode_instance_0;
   }
   function RuleTranslator() {
     RuleTranslator_instance = this;
@@ -5253,7 +5582,8 @@
   function RuleTranslator_getInstance() {
     if (RuleTranslator_instance === null) {
       new RuleTranslator();
-    }return RuleTranslator_instance;
+    }
+    return RuleTranslator_instance;
   }
   function StatementLabelling() {
     StatementLabelling_instance = this;
@@ -5268,7 +5598,8 @@
   function StatementLabelling_getInstance() {
     if (StatementLabelling_instance === null) {
       new StatementLabelling();
-    }return StatementLabelling_instance;
+    }
+    return StatementLabelling_instance;
   }
   function SuperiorityRelation() {
     SuperiorityRelation_instance = this;
@@ -5283,7 +5614,8 @@
   function SuperiorityRelation_getInstance() {
     if (SuperiorityRelation_instance === null) {
       new SuperiorityRelation();
-    }return SuperiorityRelation_instance;
+    }
+    return SuperiorityRelation_instance;
   }
   function Utils() {
     Utils_instance = this;
@@ -5298,7 +5630,8 @@
   function Utils_getInstance() {
     if (Utils_instance === null) {
       new Utils();
-    }return Utils_instance;
+    }
+    return Utils_instance;
   }
   function StructuredMode() {
     StructuredMode_instance = this;
@@ -5319,7 +5652,8 @@
   function StructuredMode_getInstance() {
     if (StructuredMode_instance === null) {
       new StructuredMode();
-    }return StructuredMode_instance;
+    }
+    return StructuredMode_instance;
   }
   function Debug_0() {
     Debug_instance_0 = this;
@@ -5340,7 +5674,8 @@
   function Debug_getInstance_0() {
     if (Debug_instance_0 === null) {
       new Debug_0();
-    }return Debug_instance_0;
+    }
+    return Debug_instance_0;
   }
   function SuperiorityRelation_0() {
     SuperiorityRelation_instance_0 = this;
@@ -5361,7 +5696,8 @@
   function SuperiorityRelation_getInstance_0() {
     if (SuperiorityRelation_instance_0 === null) {
       new SuperiorityRelation_0();
-    }return SuperiorityRelation_instance_0;
+    }
+    return SuperiorityRelation_instance_0;
   }
   function Utils_0() {
     Utils_instance_0 = this;
@@ -5382,7 +5718,8 @@
   function Utils_getInstance_0() {
     if (Utils_instance_0 === null) {
       new Utils_0();
-    }return Utils_instance_0;
+    }
+    return Utils_instance_0;
   }
   Object.defineProperty(Arg2pSolver, 'Companion', {
     get: Arg2pSolver$Companion_getInstance
@@ -5545,6 +5882,12 @@
   Object.defineProperty(package$utils, 'ArgumentHash', {
     get: ArgumentHash_getInstance
   });
+  Object.defineProperty(package$utils, 'Contains', {
+    get: Contains_getInstance
+  });
+  Object.defineProperty(package$utils, 'ContainsAny', {
+    get: ContainsAny_getInstance
+  });
   var package$meta = package$core.meta || (package$core.meta = {});
   Object.defineProperty(package$meta, 'MetaInterpreterLib', {
     get: MetaInterpreterLib_getInstance
@@ -5808,21 +6151,17 @@
   PrologWithArgumentation.prototype.unifyWithOccurCheck = PrologScopeWithTheories.prototype.unifyWithOccurCheck;
   PrologWithArgumentation.prototype.var1 = PrologScopeWithTheories.prototype.var1;
   PrologWithArgumentation.prototype.write1 = PrologScopeWithTheories.prototype.write1;
-  PrologWithArgumentation.prototype.neq2 = PrologScopeWithTheories.prototype.neq2;
-  PrologWithArgumentation.prototype.nid2 = PrologScopeWithTheories.prototype.nid2;
-  PrologWithArgumentation.prototype.power = PrologScopeWithTheories.prototype.power;
-  PrologWithArgumentation.prototype.eq2 = PrologScopeWithTheories.prototype.eq2;
-  PrologWithArgumentation.prototype.arithNeq2 = PrologScopeWithTheories.prototype.arithNeq2;
-  PrologWithArgumentation.prototype.id2 = PrologScopeWithTheories.prototype.id2;
-  PrologWithArgumentation.prototype.arithEq2 = PrologScopeWithTheories.prototype.arithEq2;
-  PrologWithArgumentation.prototype.pow = PrologScopeWithTheories.prototype.pow;
   PrologWithArgumentation.prototype.anyAnd = PrologScopeWithTheories.prototype.anyAnd;
+  PrologWithArgumentation.prototype.arithEq2 = PrologScopeWithTheories.prototype.arithEq2;
+  PrologWithArgumentation.prototype.arithNeq2 = PrologScopeWithTheories.prototype.arithNeq2;
   PrologWithArgumentation.prototype.substitutionContainsKey = PrologScopeWithTheories.prototype.substitutionContainsKey;
   PrologWithArgumentation.prototype.substitutionContainsValue = PrologScopeWithTheories.prototype.substitutionContainsValue;
   PrologWithArgumentation.prototype.anyDiv = PrologScopeWithTheories.prototype.anyDiv;
+  PrologWithArgumentation.prototype.eq2 = PrologScopeWithTheories.prototype.eq2;
   PrologWithArgumentation.prototype.anyEqualsTo = PrologScopeWithTheories.prototype.anyEqualsTo;
   PrologWithArgumentation.prototype.anyGreaterThan = PrologScopeWithTheories.prototype.anyGreaterThan;
   PrologWithArgumentation.prototype.anyGreaterThanOrEqualsTo = PrologScopeWithTheories.prototype.anyGreaterThanOrEqualsTo;
+  PrologWithArgumentation.prototype.id2 = PrologScopeWithTheories.prototype.id2;
   PrologWithArgumentation.prototype.anyIf = PrologScopeWithTheories.prototype.anyIf;
   PrologWithArgumentation.prototype.anyIfVararg = PrologScopeWithTheories.prototype.anyIfVararg;
   PrologWithArgumentation.prototype.anyImpliedBy = PrologScopeWithTheories.prototype.anyImpliedBy;
@@ -5835,6 +6174,8 @@
   PrologWithArgumentation.prototype.anyMatches = PrologScopeWithTheories.prototype.anyMatches;
   PrologWithArgumentation.prototype.anyMguWith = PrologScopeWithTheories.prototype.anyMguWith;
   PrologWithArgumentation.prototype.anyMinus = PrologScopeWithTheories.prototype.anyMinus;
+  PrologWithArgumentation.prototype.neq2 = PrologScopeWithTheories.prototype.neq2;
+  PrologWithArgumentation.prototype.nid2 = PrologScopeWithTheories.prototype.nid2;
   PrologWithArgumentation.prototype.anyNonGreaterThan = PrologScopeWithTheories.prototype.anyNonGreaterThan;
   PrologWithArgumentation.prototype.anyNonLowerThan = PrologScopeWithTheories.prototype.anyNonLowerThan;
   PrologWithArgumentation.prototype.anyNotEqualsTo = PrologScopeWithTheories.prototype.anyNotEqualsTo;