@tuprolog/2p-full 3.0.6 → 3.0.8

package/2p-theory.js

@@ -22,106 +22,106 @@
   'use strict';
   //region block: imports
   var imul = Math.imul;
-  var protoOf = kotlin_kotlin.$_$.s8;
-  var asIterable = kotlin_kotlin.$_$.x9;
-  var any = kotlin_kotlin.$_$.w9;
+  var protoOf = kotlin_kotlin.$_$.u8;
+  var asIterable = kotlin_kotlin.$_$.z9;
+  var any = kotlin_kotlin.$_$.y9;
   var asSequence = kotlin_kotlin.$_$.r2;
-  var getKClassFromExpression = kotlin_kotlin.$_$.p9;
-  var joinToString = kotlin_kotlin.$_$.u3;
-  var initMetadataForClass = kotlin_kotlin.$_$.b8;
+  var getKClassFromExpression = kotlin_kotlin.$_$.r9;
+  var joinToString = kotlin_kotlin.$_$.v3;
+  var initMetadataForClass = kotlin_kotlin.$_$.d8;
   var Unit_instance = kotlin_kotlin.$_$.r;
-  var toList = kotlin_kotlin.$_$.hb;
-  var none = kotlin_kotlin.$_$.va;
+  var toList = kotlin_kotlin.$_$.kb;
+  var none = kotlin_kotlin.$_$.ya;
   var VOID = kotlin_kotlin.$_$.b;
-  var emptyList = kotlin_kotlin.$_$.k3;
+  var emptyList = kotlin_kotlin.$_$.l3;
   var asIterable_0 = kotlin_kotlin.$_$.l2;
-  var ArrayList_init_$Create$ = kotlin_kotlin.$_$.t;
+  var ArrayList_init_$Create$ = kotlin_kotlin.$_$.u;
   var Companion_instance = kotlin_it_unibo_tuprolog_core.$_$.w;
   var itemWiseEquals = kotlin_it_unibo_tuprolog_utils.$_$.e1;
-  var getKClass = kotlin_kotlin.$_$.q9;
+  var getKClass = kotlin_kotlin.$_$.s9;
   var itemWiseHashCode = kotlin_it_unibo_tuprolog_utils.$_$.f1;
   var itemWiseHashCode_0 = kotlin_it_unibo_tuprolog_utils.$_$.g1;
-  var initMetadataForCompanion = kotlin_kotlin.$_$.c8;
-  var initMetadataForInterface = kotlin_kotlin.$_$.e8;
-  var first = kotlin_kotlin.$_$.o3;
-  var toString = kotlin_kotlin.$_$.v8;
-  var hashCode = kotlin_kotlin.$_$.a8;
-  var equals = kotlin_kotlin.$_$.t7;
-  var defineProp = kotlin_kotlin.$_$.s7;
-  var objectCreate = kotlin_kotlin.$_$.r8;
+  var initMetadataForCompanion = kotlin_kotlin.$_$.e8;
+  var initMetadataForInterface = kotlin_kotlin.$_$.g8;
+  var first = kotlin_kotlin.$_$.p3;
+  var toString = kotlin_kotlin.$_$.x8;
+  var hashCode = kotlin_kotlin.$_$.c8;
+  var equals = kotlin_kotlin.$_$.v7;
+  var defineProp = kotlin_kotlin.$_$.u7;
+  var objectCreate = kotlin_kotlin.$_$.t8;
   var IllegalArgumentException_init_$Create$ = kotlin_kotlin.$_$.j1;
   var asReversed = kotlin_kotlin.$_$.o2;
-  var isInterface = kotlin_kotlin.$_$.k8;
-  var KProperty1 = kotlin_kotlin.$_$.t9;
-  var getPropertyCallableRef = kotlin_kotlin.$_$.y7;
-  var constructCallableReference = kotlin_kotlin.$_$.r7;
-  var lazy = kotlin_kotlin.$_$.pe;
-  var CoroutineImpl = kotlin_kotlin.$_$.j6;
-  var THROW_CCE = kotlin_kotlin.$_$.fe;
-  var SequenceScope = kotlin_kotlin.$_$.u9;
-  var get_COROUTINE_SUSPENDED = kotlin_kotlin.$_$.i6;
-  var initMetadataForLambda = kotlin_kotlin.$_$.f8;
-  var sequence = kotlin_kotlin.$_$.bb;
-  var listOf = kotlin_kotlin.$_$.h4;
+  var isInterface = kotlin_kotlin.$_$.m8;
+  var KProperty1 = kotlin_kotlin.$_$.v9;
+  var getPropertyCallableRef = kotlin_kotlin.$_$.a8;
+  var constructCallableReference = kotlin_kotlin.$_$.t7;
+  var lazy = kotlin_kotlin.$_$.re;
+  var CoroutineImpl = kotlin_kotlin.$_$.l6;
+  var THROW_CCE = kotlin_kotlin.$_$.he;
+  var SequenceScope = kotlin_kotlin.$_$.w9;
+  var get_COROUTINE_SUSPENDED = kotlin_kotlin.$_$.k6;
+  var initMetadataForLambda = kotlin_kotlin.$_$.h8;
+  var sequence = kotlin_kotlin.$_$.eb;
+  var listOf = kotlin_kotlin.$_$.i4;
   var mergeSequences = kotlin_it_unibo_tuprolog_utils.$_$.i1;
-  var sequenceOf = kotlin_kotlin.$_$.za;
-  var flatten = kotlin_kotlin.$_$.ka;
-  var initMetadataForObject = kotlin_kotlin.$_$.g8;
+  var sequenceOf = kotlin_kotlin.$_$.cb;
+  var flatten = kotlin_kotlin.$_$.na;
+  var initMetadataForObject = kotlin_kotlin.$_$.i8;
   var compareTo = kotlin_it_unibo_tuprolog_utils.$_$.j;
   var LongIndexed = kotlin_it_unibo_tuprolog_utils.$_$.k;
   var component1 = kotlin_it_unibo_tuprolog_utils.$_$.h;
   var component2 = kotlin_it_unibo_tuprolog_utils.$_$.i;
   var Companion_instance_0 = kotlin_it_unibo_tuprolog_utils.$_$.d;
   var copyToArray = kotlin_kotlin.$_$.g3;
-  var plus = kotlin_kotlin.$_$.b5;
-  var ArrayList_init_$Create$_0 = kotlin_kotlin.$_$.u;
-  var minOrNull = kotlin_kotlin.$_$.l4;
-  var map = kotlin_kotlin.$_$.ta;
-  var ensureNotNull = kotlin_kotlin.$_$.le;
-  var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.w;
-  var sum = kotlin_kotlin.$_$.cb;
+  var plus = kotlin_kotlin.$_$.c5;
+  var ArrayList_init_$Create$_0 = kotlin_kotlin.$_$.v;
+  var minOrNull = kotlin_kotlin.$_$.m4;
+  var map = kotlin_kotlin.$_$.wa;
+  var ensureNotNull = kotlin_kotlin.$_$.ne;
+  var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.x;
+  var sum = kotlin_kotlin.$_$.fb;
   var Collection = kotlin_kotlin.$_$.b2;
-  var filter = kotlin_kotlin.$_$.ga;
-  var emptySequence = kotlin_kotlin.$_$.da;
+  var filter = kotlin_kotlin.$_$.ia;
+  var emptySequence = kotlin_kotlin.$_$.fa;
   var dequeOf = kotlin_it_unibo_tuprolog_utils.$_$.z;
   var addFirst = kotlin_it_unibo_tuprolog_utils.$_$.r;
   var buffered = kotlin_it_unibo_tuprolog_utils.$_$.s;
   var collectionSizeOrDefault = kotlin_kotlin.$_$.w2;
   var dequeOf_0 = kotlin_it_unibo_tuprolog_utils.$_$.x;
   var Companion_instance_1 = kotlin_it_unibo_tuprolog_utils.$_$.b;
-  var flatMap = kotlin_kotlin.$_$.ja;
-  var sequenceOf_0 = kotlin_kotlin.$_$.ab;
-  var firstOrNull = kotlin_kotlin.$_$.ha;
-  var NotImplementedError = kotlin_kotlin.$_$.ae;
-  var take = kotlin_kotlin.$_$.eb;
+  var flatMap = kotlin_kotlin.$_$.la;
+  var sequenceOf_0 = kotlin_kotlin.$_$.db;
+  var firstOrNull = kotlin_kotlin.$_$.ja;
+  var NotImplementedError = kotlin_kotlin.$_$.ce;
+  var take = kotlin_kotlin.$_$.hb;
   var IllegalStateException_init_$Create$ = kotlin_kotlin.$_$.n1;
-  var get_ONE = kotlin_kotlin.$_$.q6;
-  var add = kotlin_kotlin.$_$.r6;
-  var subtract = kotlin_kotlin.$_$.e7;
+  var get_ONE = kotlin_kotlin.$_$.s6;
+  var add = kotlin_kotlin.$_$.t6;
+  var subtract = kotlin_kotlin.$_$.g7;
   var UnsupportedOperationException_init_$Create$ = kotlin_kotlin.$_$.z1;
   var Companion_instance_2 = kotlin_it_unibo_tuprolog_core.$_$.v;
   var Companion_getInstance = kotlin_it_unibo_tuprolog_core.$_$.c1;
   var Companion_getInstance_0 = kotlin_it_unibo_tuprolog_core.$_$.x;
-  var numberRangeToNumber = kotlin_kotlin.$_$.n8;
-  var plus_0 = kotlin_kotlin.$_$.ya;
+  var numberRangeToNumber = kotlin_kotlin.$_$.p8;
+  var plus_0 = kotlin_kotlin.$_$.bb;
   var getTag = kotlin_it_unibo_tuprolog_utils.$_$.o;
   var containsTag = kotlin_it_unibo_tuprolog_utils.$_$.n;
   var Companion_getInstance_1 = kotlin_it_unibo_tuprolog_unify.$_$.a;
   var Companion_instance_3 = kotlin_it_unibo_tuprolog_core.$_$.p;
-  var first_0 = kotlin_kotlin.$_$.p3;
-  var filterNotNull = kotlin_kotlin.$_$.ea;
+  var first_0 = kotlin_kotlin.$_$.q3;
+  var filterNotNull = kotlin_kotlin.$_$.ga;
   var Taggable = kotlin_it_unibo_tuprolog_utils.$_$.p;
-  var filterNot = kotlin_kotlin.$_$.fa;
+  var filterNot = kotlin_kotlin.$_$.ha;
   var asSequence_0 = kotlin_kotlin.$_$.s2;
-  var fromInt = kotlin_kotlin.$_$.w6;
-  var emptyMap = kotlin_kotlin.$_$.l3;
-  var toList_0 = kotlin_kotlin.$_$.t5;
-  var listOf_0 = kotlin_kotlin.$_$.g4;
-  var none_0 = kotlin_kotlin.$_$.v4;
+  var fromInt = kotlin_kotlin.$_$.y6;
+  var emptyMap = kotlin_kotlin.$_$.m3;
+  var toList_0 = kotlin_kotlin.$_$.v5;
+  var listOf_0 = kotlin_kotlin.$_$.h4;
+  var none_0 = kotlin_kotlin.$_$.w4;
   var dequeOf_1 = kotlin_it_unibo_tuprolog_utils.$_$.y;
-  var Pair = kotlin_kotlin.$_$.de;
-  var toMutableList = kotlin_kotlin.$_$.z5;
-  var toMutableList_0 = kotlin_kotlin.$_$.ib;
+  var Pair = kotlin_kotlin.$_$.fe;
+  var toMutableList = kotlin_kotlin.$_$.b6;
+  var toMutableList_0 = kotlin_kotlin.$_$.lb;
   var addFirst_0 = kotlin_it_unibo_tuprolog_utils.$_$.q;
   var addAll = kotlin_kotlin.$_$.h2;
   //endregion
@@ -162,7 +162,7 @@
     return this.f1();
   }
   function plus_1(traversed) {
-    return Companion_instance_7.l1r(this.xr(), this.z1p(), plus(this.h1r(), traversed));
+    return Companion_instance_7.l1r(this.vr(), this.z1p(), plus(this.h1r(), traversed));
   }
   initMetadataForInterface(IndexedClause, 'IndexedClause', VOID, VOID, [LongIndexed]);
   initMetadataForClass(IndexedClause$Companion$wrap$1, VOID, VOID, VOID, [IndexedClause]);
@@ -508,7 +508,7 @@
   protoOf(Success).f1o = function () {
     return this.w1o_1;
   };
-  protoOf(Success).c13 = function () {
+  protoOf(Success).b13 = function () {
     return true;
   };
   protoOf(Success).y1o = function () {
@@ -566,7 +566,7 @@
   };
   function RetrieveResult() {
   }
-  protoOf(RetrieveResult).c13 = function () {
+  protoOf(RetrieveResult).b13 = function () {
     return false;
   };
   protoOf(RetrieveResult).z1o = function () {
@@ -660,7 +660,7 @@
   function ReteClauseQueue$_get_hashCodeCache_$ref_rnll9p() {
     return constructCallableReference(function (p0) {
       return _get_hashCodeCache__ny3r0q(p0);
-    }, 1, 0, 31);
+    }, 1, 0, 32);
   }
   function ReteClauseQueue(rete) {
     AbstractReteClauseCollection.call(this, rete);
@@ -751,14 +751,14 @@
     this.u1p_1 = $clause;
     CoroutineImpl.call(this, resultContinuation);
   }
-  protoOf(AbstractReteNode$removeAllLazily$slambda).ms = function ($this$sequence, $completion) {
-    var tmp = this.ns($this$sequence, $completion);
+  protoOf(AbstractReteNode$removeAllLazily$slambda).ks = function ($this$sequence, $completion) {
+    var tmp = this.ls($this$sequence, $completion);
     tmp.r8_1 = Unit_instance;
     tmp.s8_1 = null;
     return tmp.x8();
   };
   protoOf(AbstractReteNode$removeAllLazily$slambda).o9 = function (p1, $completion) {
-    return this.ms(p1 instanceof SequenceScope ? p1 : THROW_CCE(), $completion);
+    return this.ks(p1 instanceof SequenceScope ? p1 : THROW_CCE(), $completion);
   };
   protoOf(AbstractReteNode$removeAllLazily$slambda).x8 = function () {
     var suspendResult = this.r8_1;
@@ -782,7 +782,7 @@
               it.x1p();
               this.w1p_1.l3();
               this.p8_1 = 2;
-              suspendResult = this.v1p_1.te(it, this);
+              suspendResult = this.v1p_1.se(it, this);
               if (suspendResult === get_COROUTINE_SUSPENDED()) {
                 return suspendResult;
               }
@@ -814,7 +814,7 @@
       }
      while (true);
   };
-  protoOf(AbstractReteNode$removeAllLazily$slambda).ns = function ($this$sequence, completion) {
+  protoOf(AbstractReteNode$removeAllLazily$slambda).ls = function ($this$sequence, completion) {
     var i = new AbstractReteNode$removeAllLazily$slambda(this.s1p_1, this.t1p_1, this.u1p_1, completion);
     i.v1p_1 = $this$sequence;
     return i;
@@ -822,7 +822,7 @@
   function AbstractReteNode$removeAllLazily$slambda_0($source, this$0, $clause, resultContinuation) {
     var i = new AbstractReteNode$removeAllLazily$slambda($source, this$0, $clause, resultContinuation);
     return constructCallableReference(function ($this$sequence, $completion) {
-      return i.ms($this$sequence, $completion);
+      return i.ks($this$sequence, $completion);
     }, 1);
   }
   function AbstractReteNode(unificator) {
@@ -838,13 +838,13 @@
     return constructCallableReference(function (p0, p1) {
       p0.b1q(p1);
       return Unit_instance;
-    }, 2, 0, 32, 'assertA');
+    }, 2, 0, 33, 'assertA');
   }
   function ReteNode$assertZ$ref() {
     return constructCallableReference(function (p0, p1) {
       p0.c1q(p1);
       return Unit_instance;
-    }, 2, 0, 33, 'assertZ');
+    }, 2, 0, 34, 'assertZ');
   }
   function Companion_1() {
   }
@@ -883,13 +883,13 @@
             this.p8_1 = 1;
             continue $sm;
           case 1:
-            if (!this.p1q_1.ex()) {
+            if (!this.p1q_1.dx()) {
               this.p8_1 = 3;
               continue $sm;
             }
 
             this.p8_1 = 2;
-            suspendResult = this.o1q_1.te(this.p1q_1, this);
+            suspendResult = this.o1q_1.se(this.p1q_1, this);
             if (suspendResult === get_COROUTINE_SUSPENDED()) {
               return suspendResult;
             }
@@ -901,7 +901,7 @@
             continue $sm;
           case 3:
             this.p8_1 = 4;
-            suspendResult = this.o1q_1.te(this.p1q_1, this);
+            suspendResult = this.o1q_1.se(this.p1q_1, this);
             if (suspendResult === get_COROUTINE_SUSPENDED()) {
               return suspendResult;
             }
@@ -938,11 +938,11 @@
   }
   protoOf(Utils).s1q = function (_this__u8e3s4, nestingLevel) {
     // Inline function 'kotlin.let' call
-    return takeFirstAfterSkipping(firstArguments(this, _this__u8e3s4), nestingLevel).castToStruct().sw();
+    return takeFirstAfterSkipping(firstArguments(this, _this__u8e3s4), nestingLevel).castToStruct().rw();
   };
   protoOf(Utils).t1q = function (_this__u8e3s4, nestingLevel) {
     // Inline function 'kotlin.let' call
-    return takeFirstAfterSkipping(firstArguments(this, _this__u8e3s4), nestingLevel).castToStruct().yw();
+    return takeFirstAfterSkipping(firstArguments(this, _this__u8e3s4), nestingLevel).castToStruct().xw();
   };
   protoOf(Utils).u1q = function (_this__u8e3s4, nestingLevel) {
     return takeFirstAfterSkipping(firstArguments(this, _this__u8e3s4), nestingLevel);
@@ -975,7 +975,7 @@
     return this.c1r(asSequence(iterable));
   };
   protoOf(Utils).e1r = function (a, b) {
-    return a == null && b == null ? null : a == null ? b : b == null ? a : a.st(b) < 0 ? a : b;
+    return a == null && b == null ? null : a == null ? b : b == null ? a : a.rt(b) < 0 ? a : b;
   };
   var Utils_instance;
   function Utils_getInstance() {
@@ -985,8 +985,8 @@
     this.g1r_1 = $indexedClause;
     this.f1r_1 = listOf($traversed.slice());
   }
-  protoOf(IndexedClause$Companion$wrap$1).xr = function () {
-    return this.g1r_1.xr();
+  protoOf(IndexedClause$Companion$wrap$1).vr = function () {
+    return this.g1r_1.vr();
   };
   protoOf(IndexedClause$Companion$wrap$1).f1 = function () {
     return this.g1r_1.f1();
@@ -1003,7 +1003,7 @@
     }
   };
   protoOf(IndexedClause$Companion$wrap$1).d = function (other) {
-    return this.st((!(other == null) ? isInterface(other, LongIndexed) : false) ? other : THROW_CCE());
+    return this.rt((!(other == null) ? isInterface(other, LongIndexed) : false) ? other : THROW_CCE());
   };
   function Companion_2() {
   }
@@ -1011,10 +1011,10 @@
     return new IndexedClause$Companion$wrap$1(traversed, indexedClause);
   };
   protoOf(Companion_2).k1r = function (index, clause, traversed) {
-    return this.j1r(Companion_instance_0.rt(index, clause), traversed.slice());
+    return this.j1r(Companion_instance_0.qt(index, clause), traversed.slice());
   };
   protoOf(Companion_2).l1r = function (index, clause, traversed) {
-    var tmp = Companion_instance_0.rt(index, clause);
+    var tmp = Companion_instance_0.qt(index, clause);
     // Inline function 'kotlin.collections.toTypedArray' call
     var tmp$ret$0 = copyToArray(traversed);
     return this.j1r(tmp, tmp$ret$0.slice());
@@ -1029,8 +1029,8 @@
     this.m1r_1 = $indexed;
     this.n1r_1 = $index;
   }
-  protoOf(SituatedIndexedClause$Companion$of$1).xr = function () {
-    return this.m1r_1.xr();
+  protoOf(SituatedIndexedClause$Companion$of$1).vr = function () {
+    return this.m1r_1.vr();
   };
   protoOf(SituatedIndexedClause$Companion$of$1).f1 = function () {
     return this.m1r_1.f1();
@@ -1050,12 +1050,12 @@
       return true;
     if (!(!(other == null) ? isInterface(other, SituatedIndexedClause) : false))
       return false;
-    if (!(this.xr() === other.xr()))
+    if (!(this.vr() === other.vr()))
       return false;
     return true;
   };
   protoOf(SituatedIndexedClause$Companion$of$1).d = function (other) {
-    return this.st((!(other == null) ? isInterface(other, LongIndexed) : false) ? other : THROW_CCE());
+    return this.rt((!(other == null) ? isInterface(other, LongIndexed) : false) ? other : THROW_CCE());
   };
   function Companion_3() {
   }
@@ -1070,8 +1070,8 @@
   }
   function SituatedIndexedClause$compareTo$ref() {
     return constructCallableReference(function (p0, p1) {
-      return p0.st(p1);
-    }, 2, 0, 34, 'compareTo');
+      return p0.rt(p1);
+    }, 2, 0, 35, 'compareTo');
   }
   function AbstractIndexingLeaf(unificator) {
     AbstractReteNode.call(this, unificator);
@@ -1118,7 +1118,7 @@
     if (actualIndex === -1) {
       tmp = null;
     } else {
-      tmp = index.x(actualIndex);
+      tmp = index.t(actualIndex);
     }
     return tmp;
   }
@@ -1127,7 +1127,7 @@
     return map(tmp, AtomIndex$extractGlobalSequence$lambda);
   }
   function nestedFirstArgument($this, $receiver) {
-    return Utils_instance.u1q(ensureNotNull($receiver.ez()), $this.y1r_1 + 1 | 0);
+    return Utils_instance.u1q(ensureNotNull($receiver.dz()), $this.y1r_1 + 1 | 0);
   }
   function asInnerAtom($this, $receiver) {
     return nestedFirstArgument($this, $receiver).castToAtom();
@@ -1220,7 +1220,7 @@
   };
   protoOf(AtomIndex).d1o = function (clause) {
     var tmp;
-    if (nestedFirstArgument(this, clause).tw()) {
+    if (nestedFirstArgument(this, clause).sw()) {
       var tmp0_safe_receiver = this.z1r_1.j2(asInnerAtom(this, clause));
       var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
       var tmp_0;
@@ -1282,7 +1282,7 @@
   };
   protoOf(AtomIndex).s1r = function (clause) {
     var tmp;
-    if (nestedFirstArgument(this, clause).tw()) {
+    if (nestedFirstArgument(this, clause).sw()) {
       // Inline function 'kotlin.let' call
       var it = this.z1r_1.j2(asInnerAtom(this, clause));
       var tmp_0;
@@ -1299,7 +1299,7 @@
   };
   protoOf(AtomIndex).t1r = function (clause) {
     var tmp;
-    if (nestedFirstArgument(this, clause).tw()) {
+    if (nestedFirstArgument(this, clause).sw()) {
       var tmp0_safe_receiver = this.z1r_1.j2(asInnerAtom(this, clause));
       var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
       var tmp_0;
@@ -1320,7 +1320,7 @@
   };
   protoOf(AtomIndex).u1r = function (clause) {
     var tmp;
-    if (nestedFirstArgument(this, clause).tw()) {
+    if (nestedFirstArgument(this, clause).sw()) {
       var partialIndex = this.z1r_1.j2(asInnerAtom(this, clause));
       tmp = partialIndex == null ? emptySequence() : this.a1q(partialIndex, clause);
     } else {
@@ -1389,13 +1389,13 @@
     return tmp;
   }
   function nestedFunctor($this, $receiver) {
-    return Utils_instance.t1q(ensureNotNull($receiver.ez()), $this.c1s_1);
+    return Utils_instance.t1q(ensureNotNull($receiver.dz()), $this.c1s_1);
   }
   function nestedFunctor_0($this, $receiver) {
-    return Utils_instance.t1q(ensureNotNull($receiver.z1p().ez()), $this.c1s_1);
+    return Utils_instance.t1q(ensureNotNull($receiver.z1p().dz()), $this.c1s_1);
   }
   function isGlobal($this, $receiver) {
-    return Utils_instance.u1q(ensureNotNull($receiver.ez()), $this.c1s_1).ux();
+    return Utils_instance.u1q(ensureNotNull($receiver.dz()), $this.c1s_1).tx();
   }
   function regenerateCache($this) {
     var tmp;
@@ -1432,7 +1432,7 @@
     return constructCallableReference(function () {
       var tmp0 = p0;
       return regenerateCache(tmp0);
-    }, 0, 0, 35, 'regenerateCache', [p0]);
+    }, 0, 0, 36, 'regenerateCache', [p0]);
   }
   function CompoundIndex$_get_size_$lambda_91vt0k(it) {
     return it.s();
@@ -1462,7 +1462,7 @@
     tmp.d1s_1 = LinkedHashMap_init_$Create$();
     var tmp_0 = this;
     var tmp_1 = Companion_instance_1;
-    tmp_0.e1s_1 = tmp_1.ir(CompoundIndex$regenerateCache$ref(this));
+    tmp_0.e1s_1 = tmp_1.gr(CompoundIndex$regenerateCache$ref(this));
   }
   protoOf(CompoundIndex).s = function () {
     var tmp = asSequence(this.d1s_1.l2());
@@ -1676,7 +1676,7 @@
     return tmp;
   };
   protoOf(CompoundIndex).e1q = function () {
-    this.e1s_1.kr();
+    this.e1s_1.ir();
   };
   function DirectiveIndex$retractFirst$lambda(it) {
     return it.z1p();
@@ -1793,7 +1793,7 @@
     if (actualIndex === -1) {
       tmp = null;
     } else {
-      tmp = index.x(actualIndex);
+      tmp = index.t(actualIndex);
     }
     return tmp;
   }
@@ -1802,7 +1802,7 @@
     return map(tmp, NumericIndex$extractGlobalSequence$lambda);
   }
   function nestedFirstArgument_0($this, $receiver) {
-    return Utils_instance.u1q(ensureNotNull($receiver.ez()), $this.k1s_1 + 1 | 0);
+    return Utils_instance.u1q(ensureNotNull($receiver.dz()), $this.k1s_1 + 1 | 0);
   }
   function asInnerNumeric($this, $receiver) {
     return nestedFirstArgument_0($this, $receiver).castToNumeric();
@@ -1895,7 +1895,7 @@
   };
   protoOf(NumericIndex).d1o = function (clause) {
     var tmp;
-    if (nestedFirstArgument_0(this, clause).yx()) {
+    if (nestedFirstArgument_0(this, clause).xx()) {
       var tmp0_safe_receiver = this.l1s_1.j2(asInnerNumeric(this, clause));
       var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
       var tmp_0;
@@ -1956,7 +1956,7 @@
     tmp.l(Companion_instance_8.q1r(clause.i1r(this), this));
   };
   protoOf(NumericIndex).s1r = function (clause) {
-    if (nestedFirstArgument_0(this, clause).yx()) {
+    if (nestedFirstArgument_0(this, clause).xx()) {
       // Inline function 'kotlin.let' call
       var it = this.l1s_1.j2(asInnerNumeric(this, clause));
       var tmp;
@@ -1972,7 +1972,7 @@
   };
   protoOf(NumericIndex).t1r = function (clause) {
     var tmp;
-    if (nestedFirstArgument_0(this, clause).yx()) {
+    if (nestedFirstArgument_0(this, clause).xx()) {
       var tmp0_safe_receiver = this.l1s_1.j2(asInnerNumeric(this, clause));
       var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : asSequence(tmp0_safe_receiver);
       var tmp_0;
@@ -1993,7 +1993,7 @@
   };
   protoOf(NumericIndex).u1r = function (clause) {
     var tmp;
-    if (nestedFirstArgument_0(this, clause).yx()) {
+    if (nestedFirstArgument_0(this, clause).xx()) {
       var partialIndex = this.l1s_1.j2(asInnerNumeric(this, clause));
       tmp = partialIndex == null ? emptySequence() : buffered(this.a1q(partialIndex, clause));
     } else {
@@ -2037,7 +2037,7 @@
     if (actualIndex === -1) {
       tmp = null;
     } else {
-      tmp = index.x(actualIndex);
+      tmp = index.t(actualIndex);
     }
     return tmp;
   }
@@ -2176,20 +2176,20 @@
     return dequeOf_0(tmp);
   }
   function nestedFirstArgument_1($this, $receiver) {
-    return Utils_instance.u1q(ensureNotNull($receiver.ez()), $this.a1t_1 + 1 | 0);
+    return Utils_instance.u1q(ensureNotNull($receiver.dz()), $this.a1t_1 + 1 | 0);
   }
   function assertByFirstParameter($this, clause) {
     var innerFirst = nestedFirstArgument_1($this, clause.z1p());
-    return innerFirst.yx() ? $this.b1t_1 : innerFirst.tw() ? $this.c1t_1 : innerFirst.ux() ? $this.d1t_1 : $this.e1t_1;
+    return innerFirst.xx() ? $this.b1t_1 : innerFirst.sw() ? $this.c1t_1 : innerFirst.tx() ? $this.d1t_1 : $this.e1t_1;
   }
   function isGlobal_0($this, $receiver) {
-    return Utils_instance.u1q(ensureNotNull($receiver.ez()), $this.a1t_1 + 1 | 0).ux();
+    return Utils_instance.u1q(ensureNotNull($receiver.dz()), $this.a1t_1 + 1 | 0).tx();
   }
   function FamilyArityReteNode$regenerateCache$ref(p0) {
     return constructCallableReference(function () {
       var tmp0 = p0;
       return regenerateCache_0(tmp0);
-    }, 0, 0, 36, 'regenerateCache', [p0]);
+    }, 0, 0, 37, 'regenerateCache', [p0]);
   }
   function FamilyArityReteNode$_get_size_$lambda_sxz8zo(it) {
     return it.s();
@@ -2222,7 +2222,7 @@
     this.e1t_1 = new CompoundIndex(unificator, this.z1s_1, this.a1t_1 + 1 | 0);
     var tmp = this;
     var tmp_0 = Companion_instance_1;
-    tmp.f1t_1 = tmp_0.ir(FamilyArityReteNode$regenerateCache$ref(this));
+    tmp.f1t_1 = tmp_0.gr(FamilyArityReteNode$regenerateCache$ref(this));
   }
   protoOf(FamilyArityReteNode).l1o = function (clause) {
     var tmp;
@@ -2307,11 +2307,11 @@
   protoOf(FamilyArityReteNode).l1t = function (clause) {
     var innerFirst = nestedFirstArgument_1(this, clause);
     var tmp;
-    if (innerFirst.yx()) {
+    if (innerFirst.xx()) {
       tmp = Utils_instance.v1q([this.d1t_1.u1r(clause), this.b1t_1.u1r(clause)]);
-    } else if (innerFirst.tw()) {
+    } else if (innerFirst.sw()) {
       tmp = Utils_instance.v1q([this.d1t_1.u1r(clause), this.c1t_1.u1r(clause)]);
-    } else if (innerFirst.ux()) {
+    } else if (innerFirst.tx()) {
       tmp = Utils_instance.v1q([this.d1t_1.u1r(clause), this.b1t_1.u1r(clause), this.c1t_1.u1r(clause), this.e1t_1.u1r(clause)]);
     } else {
       tmp = Utils_instance.v1q([this.d1t_1.u1r(clause), this.e1t_1.u1r(clause)]);
@@ -2320,26 +2320,26 @@
   };
   protoOf(FamilyArityReteNode).k1t = function (clause) {
     var innerFirst = nestedFirstArgument_1(this, clause);
-    return innerFirst.yx() ? Utils_instance.y1q([this.d1t_1.u1r(clause), this.b1t_1.u1r(clause)]) : innerFirst.tw() ? Utils_instance.y1q([this.d1t_1.u1r(clause), this.c1t_1.u1r(clause)]) : innerFirst.ux() ? Utils_instance.y1q([this.d1t_1.u1r(clause), this.b1t_1.u1r(clause), this.c1t_1.u1r(clause), this.e1t_1.u1r(clause)]) : Utils_instance.y1q([this.d1t_1.u1r(clause), this.e1t_1.u1r(clause)]);
+    return innerFirst.xx() ? Utils_instance.y1q([this.d1t_1.u1r(clause), this.b1t_1.u1r(clause)]) : innerFirst.sw() ? Utils_instance.y1q([this.d1t_1.u1r(clause), this.c1t_1.u1r(clause)]) : innerFirst.tx() ? Utils_instance.y1q([this.d1t_1.u1r(clause), this.b1t_1.u1r(clause), this.c1t_1.u1r(clause), this.e1t_1.u1r(clause)]) : Utils_instance.y1q([this.d1t_1.u1r(clause), this.e1t_1.u1r(clause)]);
   };
   protoOf(FamilyArityReteNode).j1t = function (clause) {
     var innerFirst = nestedFirstArgument_1(this, clause);
-    return innerFirst.yx() ? Utils_instance.v1q([this.d1t_1.t1r(clause), this.b1t_1.t1r(clause)]) : innerFirst.tw() ? Utils_instance.v1q([this.d1t_1.t1r(clause), this.c1t_1.t1r(clause)]) : innerFirst.ux() ? Utils_instance.v1q([this.d1t_1.t1r(clause), this.b1t_1.t1r(clause), this.c1t_1.t1r(clause), this.e1t_1.t1r(clause)]) : Utils_instance.v1q([this.d1t_1.t1r(clause), this.e1t_1.t1r(clause)]);
+    return innerFirst.xx() ? Utils_instance.v1q([this.d1t_1.t1r(clause), this.b1t_1.t1r(clause)]) : innerFirst.sw() ? Utils_instance.v1q([this.d1t_1.t1r(clause), this.c1t_1.t1r(clause)]) : innerFirst.tx() ? Utils_instance.v1q([this.d1t_1.t1r(clause), this.b1t_1.t1r(clause), this.c1t_1.t1r(clause), this.e1t_1.t1r(clause)]) : Utils_instance.v1q([this.d1t_1.t1r(clause), this.e1t_1.t1r(clause)]);
   };
   protoOf(FamilyArityReteNode).i1t = function (clause) {
     var innerFirst = nestedFirstArgument_1(this, clause);
-    return innerFirst.yx() ? Utils_instance.y1q([this.d1t_1.t1r(clause), this.b1t_1.t1r(clause)]) : innerFirst.tw() ? Utils_instance.y1q([this.d1t_1.t1r(clause), this.c1t_1.t1r(clause)]) : innerFirst.ux() ? Utils_instance.y1q([this.d1t_1.t1r(clause), this.b1t_1.t1r(clause), this.c1t_1.t1r(clause), this.e1t_1.t1r(clause)]) : Utils_instance.y1q([this.d1t_1.t1r(clause), this.e1t_1.t1r(clause)]);
+    return innerFirst.xx() ? Utils_instance.y1q([this.d1t_1.t1r(clause), this.b1t_1.t1r(clause)]) : innerFirst.sw() ? Utils_instance.y1q([this.d1t_1.t1r(clause), this.c1t_1.t1r(clause)]) : innerFirst.tx() ? Utils_instance.y1q([this.d1t_1.t1r(clause), this.b1t_1.t1r(clause), this.c1t_1.t1r(clause), this.e1t_1.t1r(clause)]) : Utils_instance.y1q([this.d1t_1.t1r(clause), this.e1t_1.t1r(clause)]);
   };
   protoOf(FamilyArityReteNode).g1t = function (clause) {
     var innerFirst = nestedFirstArgument_1(this, clause);
     var tmp;
-    if (innerFirst.yx()) {
+    if (innerFirst.xx()) {
       var tmp0_elvis_lhs = this.d1t_1.s1r(clause);
       tmp = tmp0_elvis_lhs == null ? this.b1t_1.s1r(clause) : tmp0_elvis_lhs;
-    } else if (innerFirst.tw()) {
+    } else if (innerFirst.sw()) {
       var tmp1_elvis_lhs = this.d1t_1.s1r(clause);
       tmp = tmp1_elvis_lhs == null ? this.c1t_1.s1r(clause) : tmp1_elvis_lhs;
-    } else if (innerFirst.ux()) {
+    } else if (innerFirst.tx()) {
       var tmp2_elvis_lhs = this.d1t_1.s1r(clause);
       var tmp3_elvis_lhs = tmp2_elvis_lhs == null ? this.b1t_1.s1r(clause) : tmp2_elvis_lhs;
       var tmp4_elvis_lhs = tmp3_elvis_lhs == null ? this.c1t_1.s1r(clause) : tmp3_elvis_lhs;
@@ -2353,11 +2353,11 @@
   protoOf(FamilyArityReteNode).h1t = function (clause) {
     var innerFirst = nestedFirstArgument_1(this, clause);
     var tmp;
-    if (innerFirst.yx()) {
+    if (innerFirst.xx()) {
       tmp = Utils_instance.e1r(this.b1t_1.s1r(clause), this.d1t_1.s1r(clause));
-    } else if (innerFirst.tw()) {
+    } else if (innerFirst.sw()) {
       tmp = Utils_instance.e1r(this.c1t_1.s1r(clause), this.d1t_1.s1r(clause));
-    } else if (innerFirst.ux()) {
+    } else if (innerFirst.tx()) {
       tmp = Utils_instance.e1r(Utils_instance.e1r(this.b1t_1.s1r(clause), this.c1t_1.s1r(clause)), Utils_instance.e1r(this.d1t_1.s1r(clause), this.e1t_1.s1r(clause)));
     } else {
       tmp = Utils_instance.e1r(this.d1t_1.s1r(clause), this.e1t_1.s1r(clause));
@@ -2365,14 +2365,14 @@
     return tmp;
   };
   protoOf(FamilyArityReteNode).e1q = function () {
-    this.f1t_1.kr();
+    this.f1t_1.ir();
   };
   function isGlobal_1($this, $receiver) {
-    return $receiver.gx() && Utils_instance.u1q($receiver.castToRule().ez(), $this.o1t_1).ux();
+    return $receiver.fx() && Utils_instance.u1q($receiver.castToRule().dz(), $this.o1t_1).tx();
   }
   function nestedArity($this, $receiver) {
     var tmp0_safe_receiver = $receiver.asRule();
-    var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.ez();
+    var tmp1_safe_receiver = tmp0_safe_receiver == null ? null : tmp0_safe_receiver.dz();
     var tmp2_elvis_lhs = tmp1_safe_receiver == null ? null : Utils_instance.s1q(tmp1_safe_receiver, $this.o1t_1);
     var tmp;
     if (tmp2_elvis_lhs == null) {
@@ -2385,7 +2385,7 @@
     return tmp;
   }
   function nestedArity_0($this, $receiver) {
-    return Utils_instance.s1q(ensureNotNull($receiver.z1p().ez()), $this.o1t_1);
+    return Utils_instance.s1q(ensureNotNull($receiver.z1p().dz()), $this.o1t_1);
   }
   function regenerateCache_1($this) {
     var tmp;
@@ -2422,7 +2422,7 @@
     return constructCallableReference(function () {
       var tmp0 = p0;
       return regenerateCache_1(tmp0);
-    }, 0, 0, 37, 'regenerateCache', [p0]);
+    }, 0, 0, 38, 'regenerateCache', [p0]);
   }
   function FunctorIndexingNode$_get_size_$lambda_vcufvm(it) {
     return it.s();
@@ -2441,7 +2441,7 @@
     tmp.p1t_1 = LinkedHashMap_init_$Create$();
     var tmp_0 = this;
     var tmp_1 = Companion_instance_1;
-    tmp_0.q1t_1 = tmp_1.ir(FunctorIndexingNode$regenerateCache$ref(this));
+    tmp_0.q1t_1 = tmp_1.gr(FunctorIndexingNode$regenerateCache$ref(this));
   }
   protoOf(FunctorIndexingNode).s = function () {
     var tmp = asSequence(this.p1t_1.l2());
@@ -2646,7 +2646,7 @@
     return tmp;
   };
   protoOf(FunctorIndexingNode).e1q = function () {
-    this.q1t_1.kr();
+    this.q1t_1.ir();
   };
   function FunctorNode(unificator) {
     AbstractReteNode.call(this, unificator);
@@ -2679,7 +2679,7 @@
     return constructCallableReference(function () {
       var tmp0 = p0;
       return regenerateCache_2(tmp0);
-    }, 0, 0, 38, 'regenerateCache', [p0]);
+    }, 0, 0, 39, 'regenerateCache', [p0]);
   }
   function RootNode$_get_directives_$lambda_9lfp1g(it) {
     return it.f1().castToDirective();
@@ -2712,7 +2712,7 @@
     this.s1t_1 = isOrdered;
     var tmp = this;
     var tmp_0 = Companion_instance_1;
-    tmp.t1t_1 = tmp_0.ir(RootNode$regenerateCache$ref(this));
+    tmp.t1t_1 = tmp_0.gr(RootNode$regenerateCache$ref(this));
     this.u1t_1 = new RuleNode(this.r1t_1, this.s1t_1);
     this.v1t_1 = new DirectiveIndex(this.r1t_1, this.s1t_1);
     this.w1t_1 = 0n;
@@ -2749,7 +2749,7 @@
   };
   protoOf(RootNode).d1o = function (clause) {
     var tmp;
-    if (clause.hx()) {
+    if (clause.gx()) {
       tmp = this.v1t_1.d1o(clause);
     } else {
       tmp = this.u1t_1.d1o(clause);
@@ -2758,7 +2758,7 @@
   };
   protoOf(RootNode).l1o = function (clause) {
     var tmp;
-    if (clause.hx()) {
+    if (clause.gx()) {
       tmp = this.v1t_1.l1o(clause);
     } else {
       tmp = this.u1t_1.l1o(clause);
@@ -2767,7 +2767,7 @@
   };
   protoOf(RootNode).n1o = function (clause) {
     var tmp;
-    if (clause.hx()) {
+    if (clause.gx()) {
       tmp = this.v1t_1.n1o(clause);
     } else {
       tmp = this.u1t_1.n1o(clause);
@@ -2780,8 +2780,8 @@
   protoOf(RootNode).h1p = function (clause) {
     var indexed = assignLowerIndex(this, clause);
     if (this.s1t_1) {
-      this.t1t_1.lr(RootNode$assertA$lambda(clause));
-      if (clause.hx()) {
+      this.t1t_1.jr(RootNode$assertA$lambda(clause));
+      if (clause.gx()) {
         this.v1t_1.b1q(indexed);
       } else {
         this.u1t_1.b1q(indexed);
@@ -2792,8 +2792,8 @@
   };
   protoOf(RootNode).i1o = function (clause) {
     var indexed = assignHigherIndex(this, clause);
-    this.t1t_1.lr(RootNode$assertZ$lambda(clause));
-    if (clause.hx()) {
+    this.t1t_1.jr(RootNode$assertZ$lambda(clause));
+    if (clause.gx()) {
       this.v1t_1.c1q(indexed);
     } else {
       this.u1t_1.c1q(indexed);
@@ -2803,10 +2803,10 @@
     return asSequence(this.t1t_1.f1());
   };
   protoOf(RootNode).e1q = function () {
-    this.t1t_1.kr();
+    this.t1t_1.ir();
   };
   function nestedFunctor_1($this, $receiver) {
-    return Utils_instance.t1q(ensureNotNull($receiver.ez()), 0);
+    return Utils_instance.t1q(ensureNotNull($receiver.dz()), 0);
   }
   function nestedFunctor_2($this, $receiver) {
     return nestedFunctor_1($this, $receiver.z1p());
@@ -2846,7 +2846,7 @@
     return constructCallableReference(function () {
       var tmp0 = p0;
       return regenerateCache_3(tmp0);
-    }, 0, 0, 39, 'regenerateCache', [p0]);
+    }, 0, 0, 40, 'regenerateCache', [p0]);
   }
   function RuleNode$_get_size_$lambda_xjenvf(it) {
     return it.s();
@@ -2859,7 +2859,7 @@
     tmp.a1u_1 = LinkedHashMap_init_$Create$();
     var tmp_0 = this;
     var tmp_1 = Companion_instance_1;
-    tmp_0.b1u_1 = tmp_1.ir(RuleNode$regenerateCache$ref(this));
+    tmp_0.b1u_1 = tmp_1.gr(RuleNode$regenerateCache$ref(this));
   }
   protoOf(RuleNode).d1o = function (clause) {
     var tmp0_safe_receiver = this.a1u_1.j2(nestedFunctor_1(this, clause));
@@ -2953,14 +2953,14 @@
     return asSequence(this.b1u_1.f1());
   };
   protoOf(RuleNode).e1q = function () {
-    this.b1u_1.kr();
+    this.b1u_1.ir();
   };
   function selectArity($this, clause) {
-    return $this.f1u_1.j2(Utils_instance.s1q(ensureNotNull(clause.ez()), $this.e1u_1));
+    return $this.f1u_1.j2(Utils_instance.s1q(ensureNotNull(clause.dz()), $this.e1u_1));
   }
   function chooseAssertionBranch($this, clause, op) {
     // Inline function 'kotlin.let' call
-    var it = Utils_instance.s1q(ensureNotNull(clause.z1p().ez()), $this.e1u_1);
+    var it = Utils_instance.s1q(ensureNotNull(clause.z1p().dz()), $this.e1u_1);
     var tmp;
     if (it === 0) {
       // Inline function 'kotlin.collections.getOrPut' call
@@ -3026,7 +3026,7 @@
     return constructCallableReference(function () {
       var tmp0 = p0;
       return regenerateCache_4(tmp0);
-    }, 0, 0, 40, 'regenerateCache', [p0]);
+    }, 0, 0, 41, 'regenerateCache', [p0]);
   }
   function TopLevelFunctorReteNode$_get_size_$lambda_6i36rr(it) {
     return it.s();
@@ -3040,7 +3040,7 @@
     tmp.f1u_1 = LinkedHashMap_init_$Create$();
     var tmp_0 = this;
     var tmp_1 = Companion_instance_1;
-    tmp_0.g1u_1 = tmp_1.ir(TopLevelFunctorReteNode$regenerateCache$ref(this));
+    tmp_0.g1u_1 = tmp_1.gr(TopLevelFunctorReteNode$regenerateCache$ref(this));
   }
   protoOf(TopLevelFunctorReteNode).s = function () {
     var tmp = asSequence(this.f1u_1.l2());
@@ -3106,7 +3106,7 @@
     return asSequence(this.g1u_1.f1());
   };
   protoOf(TopLevelFunctorReteNode).e1q = function () {
-    this.g1u_1.kr();
+    this.g1u_1.ir();
   };
   function ZeroArityReteNode$retractFirst$lambda(it) {
     return it.z1p();
@@ -3173,7 +3173,7 @@
   function AbstractTheory(tags) {
     this.k1u_1 = tags;
   }
-  protoOf(AbstractTheory).du = function () {
+  protoOf(AbstractTheory).cu = function () {
     return this.k1u_1;
   };
   protoOf(AbstractTheory).l1u = function () {
@@ -3215,19 +3215,19 @@
   };
   protoOf(AbstractTheory).p1u = function (indicator) {
     // Inline function 'kotlin.require' call
-    if (!indicator.oz()) {
+    if (!indicator.nz()) {
       var message = 'The provided indicator is not well formed: ' + indicator.toString();
       throw IllegalArgumentException_init_$Create$(toString(message));
     }
     var tmp = Companion_instance_2;
     var tmp_0 = Companion_getInstance_0();
-    var tmp_1 = ensureNotNull(indicator.h11());
+    var tmp_1 = ensureNotNull(indicator.g11());
     // Inline function 'kotlin.collections.map' call
-    var this_0 = numberRangeToNumber(1, ensureNotNull(indicator.i11()));
+    var this_0 = numberRangeToNumber(1, ensureNotNull(indicator.h11()));
     // Inline function 'kotlin.collections.mapTo' call
     var destination = ArrayList_init_$Create$(collectionSizeOrDefault(this_0, 10));
-    var inductionVariable = this_0.ni_1;
-    var last = this_0.oi_1;
+    var inductionVariable = this_0.mi_1;
+    var last = this_0.ni_1;
     if (inductionVariable <= last)
       do {
         var item = inductionVariable;
@@ -3244,11 +3244,11 @@
   };
   protoOf(AbstractTheory).r1u = function (indicator) {
     // Inline function 'kotlin.require' call
-    if (!indicator.oz()) {
+    if (!indicator.nz()) {
       var message = 'The provided indicator is not well formed: ' + indicator.toString();
       throw IllegalArgumentException_init_$Create$(toString(message));
     }
-    return this.retractAllByHead(Companion_getInstance_0().template(ensureNotNull(indicator.h11()), ensureNotNull(indicator.i11()))).s1u();
+    return this.retractAllByHead(Companion_getInstance_0().template(ensureNotNull(indicator.g11()), ensureNotNull(indicator.h11()))).s1u();
   };
   protoOf(AbstractTheory).abolish = function (indicator) {
     return this.r1u(indicator);
@@ -3383,7 +3383,7 @@
     return this.g1v(clauses);
   };
   protoOf(AbstractTheory).x1u = function (clauses, tags, unificator, $super) {
-    tags = tags === VOID ? this.du() : tags;
+    tags = tags === VOID ? this.cu() : tags;
     unificator = unificator === VOID ? this.v1n() : unificator;
     return $super === VOID ? this.h1v(clauses, tags, unificator) : $super.h1v.call(this, clauses, tags, unificator);
   };
@@ -3872,7 +3872,7 @@
       var _iterator__ex2g4s = clauses.n();
       while (_iterator__ex2g4s.q()) {
         var element = _iterator__ex2g4s.r();
-        if (!element.oz()) {
+        if (!element.nz()) {
           tmp$ret$0 = false;
           break $l$block;
         }
@@ -3886,14 +3886,14 @@
     }
   }
   function TheoryUtils$actualCheck$lambda(it) {
-    return it.oz();
+    return it.nz();
   }
   function TheoryUtils() {
   }
   protoOf(TheoryUtils).r1o = function (clause) {
     // Inline function 'kotlin.also' call
     // Inline function 'kotlin.require' call
-    if (!clause.oz()) {
+    if (!clause.nz()) {
       var message = 'ClauseDatabase can contain only well formed clauses: ' + ("this isn't " + clause.toString());
       throw IllegalArgumentException_init_$Create$(toString(message));
     }
@@ -4030,7 +4030,7 @@
   function IndexedTheory$_get_hashCodeCache_$ref_4wtmhh() {
     return constructCallableReference(function (p0) {
       return _get_hashCodeCache__ny3r0q_0(p0);
-    }, 1, 0, 41);
+    }, 1, 0, 42);
   }
   function IndexedTheory$sizeCache$delegate$lambda(this$0) {
     return function () {
@@ -4040,7 +4040,7 @@
   function IndexedTheory$_get_sizeCache_$ref_fqi1u9() {
     return constructCallableReference(function (p0) {
       return _get_sizeCache__6eswog(p0);
-    }, 1, 0, 42);
+    }, 1, 0, 43);
   }
   function IndexedTheory(queue, tags) {
     AbstractIndexedTheory.call(this, queue, tags);
@@ -4055,7 +4055,7 @@
   protoOf(IndexedTheory).b1w = function (clause) {
     var newTheory = Companion_instance_4.ofIterable(this.v1n(), this.f1o());
     var retracted = newTheory.retrieveFirst(clause);
-    return retracted.z1o() ? new Failure_0(this) : new Success_0(new IndexedTheory(retracted.x1o(), this.du()), ensureNotNull(retracted.f1o()));
+    return retracted.z1o() ? new Failure_0(this) : new Success_0(new IndexedTheory(retracted.x1o(), this.cu()), ensureNotNull(retracted.f1o()));
   };
   protoOf(IndexedTheory).retract = function (clause) {
     return this.b1w(clause);
@@ -4079,15 +4079,15 @@
     while (_iterator__ex2g4s.q()) {
       var clause = _iterator__ex2g4s.r();
       var result = newTheory.u1o(clause);
-      if (result.c13()) {
-        removed.w(ensureNotNull(result.f1o()));
+      if (result.b13()) {
+        removed.x(ensureNotNull(result.f1o()));
       }
     }
     var tmp;
     if (removed.i()) {
       tmp = new Failure_0(this);
     } else {
-      tmp = new Success_0(new IndexedTheory(newTheory, this.du()), removed);
+      tmp = new Success_0(new IndexedTheory(newTheory, this.cu()), removed);
     }
     return tmp;
   };
@@ -4097,7 +4097,7 @@
   protoOf(IndexedTheory).n1o = function (clause) {
     var newTheory = Companion_instance_4.ofIterable(this.v1n(), this.f1o());
     var retracted = newTheory.m1o(clause);
-    return retracted.z1o() ? new Failure_0(this) : new Success_0(new IndexedTheory(retracted.x1o(), this.du()), ensureNotNull(retracted.f1o()));
+    return retracted.z1o() ? new Failure_0(this) : new Success_0(new IndexedTheory(retracted.x1o(), this.cu()), ensureNotNull(retracted.f1o()));
   };
   protoOf(IndexedTheory).retractAll = function (clause) {
     return this.n1o(clause);
@@ -4108,9 +4108,9 @@
   protoOf(IndexedTheory).s = function () {
     return _get_sizeCache__6eswog(this);
   };
-  protoOf(IndexedTheory).a13 = function (tags) {
+  protoOf(IndexedTheory).z12 = function (tags) {
     var tmp;
-    if (tags === this.du()) {
+    if (tags === this.cu()) {
       tmp = this;
     } else {
       tmp = new IndexedTheory(this.k1w(), tags);
@@ -4118,7 +4118,7 @@
     return tmp;
   };
   protoOf(IndexedTheory).resetTags = function (tags) {
-    return this.a13(tags);
+    return this.z12(tags);
   };
   function ListedTheory_init_$Init$(unificator, clauses, tags, $this) {
     tags = tags === VOID ? emptyMap() : tags;
@@ -4160,7 +4160,7 @@
   function ListedTheory$_get_hashCodeCache_$ref_jbnoxj() {
     return constructCallableReference(function (p0) {
       return _get_hashCodeCache__ny3r0q_1(p0);
-    }, 1, 0, 43);
+    }, 1, 0, 44);
   }
   function ListedTheory$sizeCache$delegate$lambda(this$0) {
     return function () {
@@ -4170,7 +4170,7 @@
   function ListedTheory$_get_sizeCache_$ref_3h5dr1() {
     return constructCallableReference(function (p0) {
       return _get_sizeCache__6eswog_0(p0);
-    }, 1, 0, 44);
+    }, 1, 0, 45);
   }
   function ListedTheory(unificator, clauses, tags) {
     AbstractListedTheory.call(this, unificator, clauses, tags);
@@ -4212,7 +4212,7 @@
         }
       }
       var newTheory = destination_0;
-      tmp = new Success_0(new ListedTheory(this.v1n(), newTheory, this.du()), listOf_0(toBeActuallyRetracted));
+      tmp = new Success_0(new ListedTheory(this.v1n(), newTheory, this.cu()), listOf_0(toBeActuallyRetracted));
     }
     return tmp;
   };
@@ -4263,7 +4263,7 @@
     if (removed.i()) {
       tmp_0 = new Failure_0(this);
     } else {
-      tmp_0 = new Success_0(new ListedTheory(this.v1n(), residual, this.du()), removed);
+      tmp_0 = new Success_0(new ListedTheory(this.v1n(), residual, this.cu()), removed);
     }
     return tmp_0;
   };
@@ -4303,7 +4303,7 @@
       var partitionedClauses = new Pair(first, second);
       var newTheory = partitionedClauses.second;
       var toBeActuallyRetracted = partitionedClauses.first;
-      tmp = new Success_0(new ListedTheory(this.v1n(), newTheory, this.du()), toBeActuallyRetracted);
+      tmp = new Success_0(new ListedTheory(this.v1n(), newTheory, this.cu()), toBeActuallyRetracted);
     }
     return tmp;
   };
@@ -4316,11 +4316,11 @@
   protoOf(ListedTheory).s = function () {
     return _get_sizeCache__6eswog_0(this);
   };
-  protoOf(ListedTheory).a13 = function (tags) {
-    return tags === this.du() ? this : new ListedTheory(this.v1n(), this.f1o(), tags);
+  protoOf(ListedTheory).z12 = function (tags) {
+    return tags === this.cu() ? this : new ListedTheory(this.v1n(), this.f1o(), tags);
   };
   protoOf(ListedTheory).resetTags = function (tags) {
-    return this.a13(tags);
+    return this.z12(tags);
   };
   protoOf(ListedTheory).y1u = function (theory) {
     return this.a1o() ? theory.toImmutableTheory() : theory.a1o() ? this : protoOf(AbstractListedTheory).y1u.call(this, theory);
@@ -4346,7 +4346,7 @@
     return MutableIndexedTheory_init_$Init$_0(unificator, clauses, tags, objectCreate(protoOf(MutableIndexedTheory)));
   }
   function toRetractResult($this, $receiver) {
-    return $receiver.c13() ? new Success_0($this, ensureNotNull($receiver.f1o())) : new Failure_0($this);
+    return $receiver.b13() ? new Success_0($this, ensureNotNull($receiver.f1o())) : new Failure_0($this);
   }
   function MutableIndexedTheory$retract$lambda(this$0) {
     return function (it) {
@@ -4354,7 +4354,7 @@
     };
   }
   function MutableIndexedTheory$retract$lambda_0(it) {
-    return it.c13();
+    return it.b13();
   }
   function MutableIndexedTheory$retract$lambda_1(it) {
     return asSequence(ensureNotNull(it.f1o()));
@@ -4499,11 +4499,11 @@
   protoOf(MutableIndexedTheory).toImmutableTheory = function () {
     return this.l1u();
   };
-  protoOf(MutableIndexedTheory).a13 = function (tags) {
-    return tags === this.du() ? this : new MutableIndexedTheory(this.a1x_1, tags);
+  protoOf(MutableIndexedTheory).z12 = function (tags) {
+    return tags === this.cu() ? this : new MutableIndexedTheory(this.a1x_1, tags);
   };
   protoOf(MutableIndexedTheory).resetTags = function (tags) {
-    return this.a13(tags);
+    return this.z12(tags);
   };
   protoOf(MutableIndexedTheory).k1v = function () {
     return this.x1u(asSequence(this.f1o()));
@@ -4706,11 +4706,11 @@
   protoOf(MutableListedTheory).toImmutableTheory = function () {
     return this.l1u();
   };
-  protoOf(MutableListedTheory).a13 = function (tags) {
-    return tags === this.du() ? this : new MutableListedTheory(this.v1n(), this.e1x_1, tags);
+  protoOf(MutableListedTheory).z12 = function (tags) {
+    return tags === this.cu() ? this : new MutableListedTheory(this.v1n(), this.e1x_1, tags);
   };
   protoOf(MutableListedTheory).resetTags = function (tags) {
-    return this.a13(tags);
+    return this.z12(tags);
   };
   protoOf(MutableListedTheory).k1v = function () {
     return this.x1u(asSequence(this.e1x_1));
@@ -4757,14 +4757,14 @@
   protoOf(ReteClauseQueue).d1o = get;
   protoOf(IndexedClause$Companion$wrap$1).z1p = get_innerClause;
   protoOf(IndexedClause$Companion$wrap$1).i1r = plus_1;
-  protoOf(IndexedClause$Companion$wrap$1).st = compareTo;
-  protoOf(IndexedClause$Companion$wrap$1).ae = component1;
-  protoOf(IndexedClause$Companion$wrap$1).be = component2;
+  protoOf(IndexedClause$Companion$wrap$1).rt = compareTo;
+  protoOf(IndexedClause$Companion$wrap$1).zd = component1;
+  protoOf(IndexedClause$Companion$wrap$1).ae = component2;
   protoOf(SituatedIndexedClause$Companion$of$1).z1p = get_innerClause;
   protoOf(SituatedIndexedClause$Companion$of$1).i1r = plus_1;
-  protoOf(SituatedIndexedClause$Companion$of$1).st = compareTo;
-  protoOf(SituatedIndexedClause$Companion$of$1).ae = component1;
-  protoOf(SituatedIndexedClause$Companion$of$1).be = component2;
+  protoOf(SituatedIndexedClause$Companion$of$1).rt = compareTo;
+  protoOf(SituatedIndexedClause$Companion$of$1).zd = component1;
+  protoOf(SituatedIndexedClause$Companion$of$1).ae = component2;
   protoOf(AbstractTheory).l1v = get_isMutable;
   protoOf(AbstractTheory).z1n = get_rules;
   protoOf(AbstractTheory).y1n = get_directives;