diff --git a/nars_core/nars/inference/RuleTables.java b/nars_core/nars/inference/RuleTables.java
index e97ab504aaf1f3a19346e3ae045b677cc34a5648..55931bb8a65e57f97a7a869560e2a050178ff7e8 100644
--- a/nars_core/nars/inference/RuleTables.java
+++ b/nars_core/nars/inference/RuleTables.java
@@ -105,14 +105,10 @@ public class RuleTables {
             }*/
             
             //too restrictive, its checked for non-deductive inference rules in derivedTask (also for single prem)
-            if(Stamp.baseOverlap(task.sentence.stamp.evidentialBase, belief.stamp.evidentialBase)) {
-                nal.evidentalOverlap = true;
-                if(!task.sentence.isEternal() || !belief.isEternal()) {
-                    return; //only allow for eternal reasoning for now to prevent derived event floods
-                }
-                //return; //preparisons are made now to support this nicely
+            nal.evidentalOverlap = Stamp.baseOverlap(task.sentence.stamp.evidentialBase, belief.stamp.evidentialBase);
+            if(nal.evidentalOverlap && (!task.sentence.isEternal() || !belief.isEternal())) {
+                return; //only allow for eternal reasoning for now to prevent derived event floods
             }
-            //comment out for recursive examples, this is for the future, it generates a lot of potentially useless tasks
             
             nal.emit(Events.BeliefReason.class, belief, beliefTerm, taskTerm, nal);