cleaning up

Tests/test_NAL/test_NAL1.py

@@ -66,7 +66,7 @@ def test_deduction(self):
         tasks_derived = process_two_premises(
             '<bird --> animal>. %1.00;0.90%', 
             '<robin --> bird>. %1.00;0.90%', 
-            10
+            20
         )
         self.assertTrue(
             output_contains(tasks_derived, '<robin --> animal>. %1.00;0.81%')
@@ -96,7 +96,7 @@ def test_abduction(self):
         tasks_derived = process_two_premises(
             '<sport --> competition>. %1.00;0.90%', 
             '<chess --> competition>. %0.90;0.90%', 
-            5
+            10
         )
         self.assertTrue(
             output_contains(tasks_derived, '<sport --> chess>. %1.00;0.42%')
@@ -159,7 +159,7 @@ def test_exemplification(self):
         tasks_derived = process_two_premises(
             '<robin --> bird>. %1.00;0.90%', 
             '<bird --> animal>. %1.00;0.90%', 
-            100
+            20
         )
         self.assertTrue(
             output_contains(tasks_derived, '<animal --> robin>. %1.00;0.45%')

Tests/test_NAL/test_NAL3.py

@@ -150,8 +150,8 @@ def test_compound_decomposition_intensional_intersection(self):
         '''
         tasks_derived = process_two_premises(
             '<robin --> (|,bird,swimmer)>. %1.00;0.90%', 
-            '<robin --> swimmer>. %0.00;0.90%', 
-            200
+            '(--, <robin --> swimmer>). %1.00;0.90%', 
+            100
         )
         self.assertTrue(
             output_contains(tasks_derived, '<robin --> bird>. %1.00;0.81%')
@@ -160,9 +160,9 @@ def test_compound_decomposition_intensional_intersection(self):
         nars.reset()
 
         tasks_derived = process_two_premises(
-            '<robin --> swimmer>. %0.00;0.90%', 
+            '(--, <robin --> swimmer>). %1.00;0.90%', 
             '<robin --> (|,bird,swimmer)>. %1.00;0.90%', 
-            200
+            100
         )
         self.assertTrue(
             output_contains(tasks_derived, '<robin --> bird>. %1.00;0.81%')
@@ -186,24 +186,24 @@ def test_compound_decomposition_extensional_difference(self):
         ''outputMustContain('<robin --> mammal>. %0.00;0.81%')
         '''
         tasks_derived = process_two_premises(
-            '<robin --> swimmer>. %0.00;0.90%', 
-            '<robin --> (-,mammal,swimmer)>. %0.00;0.90%', 
-            200
+            '(--, <robin --> swimmer>). %1.00;0.90%', 
+            '(--, <robin --> (-,mammal,swimmer)>). %1.00;0.90%', 
+            100
         )
         self.assertTrue(
-            output_contains(tasks_derived, '<robin --> mammal>. %0.00;0.81%')
+            output_contains(tasks_derived, '(--, <robin --> mammal>). %1.00;0.81%')
         )
 
         nars.reset()
 
         tasks_derived = process_two_premises(
-            '<robin --> (-,mammal,swimmer)>. %0.00;0.90%', 
-            '<robin --> swimmer>. %0.00;0.90%', 
-            200
+            '(--, <robin --> (-,mammal,swimmer)>). %1.00;0.90%', 
+            '(--, <robin --> swimmer>). %1.00;0.90%', 
+            100
         )
         self.assertTrue(
-            output_contains(tasks_derived, '<robin --> mammal>. %0.00;0.81%')
-        )       
+            output_contains(tasks_derived, '(--, <robin --> mammal>). %1.00;0.81%')
+        )      
 
         pass
 

pynars/NARS/DataStructures/_py/Concept.py

@@ -85,10 +85,10 @@ def get_belief(self) -> Belief:
 
             # return projectedBelief;     // return the first satisfying belief
             raise
-        # if self.belief_table.empty:
-        #     for term_link in self.term_links:
-        #         if not term_link.target.belief_table.empty:
-        #             return term_link.target.belief_table.first()
+        if self.belief_table.empty:
+            for term_link in self.term_links:
+                if not term_link.target.belief_table.empty:
+                    return term_link.target.belief_table.first()
         return self.belief_table.first()
 
     # def match_candidate(self, sentence: Sentence) -> Task | Belief: