Fixes for tests/QC-precommit/pln-inf-ctl.metta

Author: TeamSPoon

prolog/metta_lang/metta_compiler.pl

@@ -264,6 +264,9 @@
 as_p1_exec(ispeEn(ERet,ECode,_),ERet) :- !, call(ECode).
 as_p1_exec(ispeEnN(ERet,ECode,_,_),ERet) :- !, call(ECode).
 as_p1_exec(ispeEnNC(ERet,ECode,_,_,CCode),ERet) :- !, call(CCode),call(ECode).
+as_p1_exec(rtrace(T),TRet) :- !, rtrace(as_p1_exec(T,TRet)).
+as_p1_exec(call(P1,T),TRet) :- !, call(P1,as_p1_exec(T,TRet)).
+%as_p1_exec(X,Y) :- as_p1_expr(X,S),eval(S,Y).
 as_p1_exec(X,X) :- !.
 
 as_p1_expr(X,X) :- \+ compound(X), !.
@@ -272,6 +275,8 @@
 as_p1_expr(ispeEn(_,_,NRet),NRet).
 as_p1_expr(ispeEnN(_,_,NRet,NCode),NRet) :- !, call(NCode).
 as_p1_expr(ispeEnNC(_,_,NRet,NCode,CCode),NRet) :- !,call(CCode),call(NCode).
+as_p1_expr(rtrace(T),TRet) :- !, rtrace(as_p1_expr(T,TRet)).
+as_p1_expr(call(P1,T),TRet) :- !, call(P1,as_p1_expr(T,TRet)).
 as_p1_expr(X,X) :- !.
 
 create_p1(URet,[],[ispu,URet]) :- !.
@@ -516,16 +521,16 @@
    subst001(X,E,_,XX),unnumbervars_wco(XX,XXX).
 unnumbervars_wco(X,X).
 
-% max_integer_in_term(+Term, -Max)
-max_integer_in_term(Term, Start, Max) :-
+% max_var_integer_in_term(+Term, -Max)
+max_var_integer_in_term(Term, Start, Max) :-
         Box = box(Start),  % Correct initialization
-        forall( ( sub_term_safely(Int, Term), integer(Int), ( box(Int) @> Box )),
+        forall( ( sub_term_safely(CmpdVar, Term), compound(CmpdVar), CmpdVar = '$VAR'(Int), integer(Int), ( box(Int) @> Box )),
             nb_setarg(1, Box, Int)),
         arg(1, Box, Max),!.
 
 number_vars_wo_conficts(X,XX):-
    copy_term(X,XX),
-   woct(max_integer_in_term(XX,0,N)),
+   woct(max_var_integer_in_term(XX,0,N)),
    succ(N,N2),
    numbervars(XX,N2,_,[attvar(skip)]).
 
@@ -1990,7 +1995,7 @@
    create_prefixed_name('mc_',LenArgs,Fn,FnWPrefix),
    sum_list(LenArgs,LenArgsTotal),
    LenArgsTotalPlus1 is LenArgsTotal+1,
-   functor(Info,FnWPrefix,LenArgsTotalPlus1),
+   functor_chkd(Info,FnWPrefix,LenArgsTotalPlus1),
    skip_redef_head(user,Info),!.
 
 into_fa(Fn/[Arity],Fn,Arity):- must_be(number,Arity).
@@ -2034,7 +2039,7 @@
   label_arg_types(F,N2,Args).
 
 % label_arg_n_type(F,0,A):- !, label_type_assignment(A,F).
-label_arg_n_type(F,N,A):- compound(F),functor(F,Fn,Add),Is is Add+N, !, label_arg_n_type(Fn,Is,A).
+label_arg_n_type(F,N,A):- compound(F),functor_chkd(F,Fn,Add),Is is Add+N, !, label_arg_n_type(Fn,Is,A).
 label_arg_n_type(F,N,A):- add_type_to(A,arg(F,N)),!.
 
 add_type_to(V,T):- is_list(T), !, maplist(add_type_to(V),T).
@@ -2361,7 +2366,7 @@
 in_type_set(Set,Type):- Set==Type,!.
 in_type_set(Set,Type):- compound(Set),arg(_,Set,Arg),in_type_set(Arg,Type).
 
-b_put_set(Set,Type):- functor(Set,_,Arg),!,b_put_nset(Set,Arg,Type).
+b_put_set(Set,Type):- functor_chkd(Set,_,Arg),!,b_put_nset(Set,Arg,Type).
 b_put_nset(Set,_,Type):- in_type_set(Set,Type),!.
 b_put_nset(Set,N,Type):- arg(N,Set,Arg),
    (compound(Arg)->b_put_set(Arg,Type);b_setarg(N,Set,[Type|Arg])).
@@ -2428,15 +2433,15 @@
 append_sets(RefsL,Refs):- flatten(RefsL,Flat),list_to_set(Flat,Refs).
 compiled_info_s(S,Refs):-
    findall(Ref,(compiler_data(F/A),compiled_refs(S,F,A,Ref)),RefsL),append_sets(RefsL,Refs1),
-   findall(Ref,(current_predicate(S/A),functor(P,S,A),clause(P,_,Ref)),Refs2),append_sets([Refs1,Refs2],Refs).
+   findall(Ref,(current_predicate(S/A),functor_chkd(P,S,A),clause(P,_,Ref)),Refs2),append_sets([Refs1,Refs2],Refs).
 compiled_info_f(F,Refs):- compiled_info_s(F,Refs1), compiled_info_p(F,Refs2),append_sets([Refs1,Refs2],Refs).
 compiled_info_p(F,Refs):-
-   findall(Ref,(current_predicate(F/A),functor(P,F,A),current_module(M),
+   findall(Ref,(current_predicate(F/A),functor_chkd(P,F,A),current_module(M),
     \+ \+ predicate_property(M:P,_), \+ predicate_property(M:P,imported_from(_)),
     clause(M:P,_,Ref)),Refs).
 
 compiled_refs(Symbol,F,A,Info):-
- functor(P,F,A),clause(P,B,Ref), (\+ compiler_data_no_call(F/A) -> call(B)), symbol_in(2,Symbol,P),
+ functor_chkd(P,F,A),clause(P,B,Ref), (\+ compiler_data_no_call(F/A) -> call(B)), symbol_in(2,Symbol,P),
    (B==true->Info=Ref;Info=P).
 
 
@@ -2478,7 +2483,7 @@
     transpile_call_prefix(Fn,Arity,CFn),
 
  ((current_predicate(CFn/Arity) -> true ;
-  must_det_lls((( functor(CallP,CFn,Arity),
+  must_det_lls((( functor_chkd(CallP,CFn,Arity),
     CallP @.. [CFn|Args],
     transpile_impl_prefix(Fn,Arity,IFn),
     CallI @.. [IFn|Args],
@@ -2504,7 +2509,7 @@
 prefix_impl_preds('mc__1_',F,A):- is_transpile_call_prefix(F,A,Fn),current_predicate(Fn/A), \+ prefix_impl_preds_pp(_,F,A).
 prefix_impl_preds('mi__1_',F,A):- is_transpile_impl_prefix(F,A,Fn),current_predicate(Fn/A), \+ prefix_impl_preds_pp(_,F,A).
 
-prefix_impl_preds_pp(Prefix,F,A):- predicate_property('mc__1_2_:'(_,_,_),file(File)),predicate_property(Preds,file(File)),functor(Preds,Fn,A),
+prefix_impl_preds_pp(Prefix,F,A):- predicate_property('mc__1_2_:'(_,_,_),file(File)),predicate_property(Preds,file(File)),functor_chkd(Preds,Fn,A),
     ((transpile_impl_prefix(Prefix);transpile_call_prefix(Prefix)),atom_list_concat([Prefix,_FNArity,'_',F],Fn)).
 
 maplist_and_conj(_,A,B):- fullvar(A),!,B=A.
@@ -2543,7 +2548,7 @@
 extract_caller(H:-_,CallerInt,CallerSz):- !, extract_caller(H,CallerInt,CallerSz).
 extract_caller([=,H,_],CallerInt,CallerSz):-  !, extract_caller(H,CallerInt,CallerSz).
 extract_caller(P,F,A):- \+ callable(P),!, F=P,A=0.
-extract_caller(P,F,A):- \+ is_list(P), functor(P,F,A).
+extract_caller(P,F,A):- \+ is_list(P), functor_chkd(P,F,A).
 
 
 maybe_lazy_list(_,_,_,[],[]):-!.
@@ -2908,7 +2913,7 @@
     transpile_call_prefix(Fn,CFn),
     %trace,
 ((current_predicate(CFn/Arity) -> true ;
-  must_det_lls((( functor(CallP,CFn,Arity),
+  must_det_lls((( functor_chkd(CallP,CFn,Arity),
     CallP @.. [CFn|Args],
     transpile_impl_prefix(Fn,IFn),
     CallI @.. [IFn|Args],
@@ -2922,7 +2927,7 @@
 prefix_impl_preds('mc__',F,A):- is_transpile_call_prefix(F,Fn),current_predicate(Fn/A), \+ prefix_impl_preds_pp(_,F,A).
 prefix_impl_preds('mi__',F,A):- is_transpile_impl_prefix(F,Fn),current_predicate(Fn/A), \+ prefix_impl_preds_pp(_,F,A).
 
-prefix_impl_preds_pp(Prefix,F,A):- predicate_property('mc__:'(_,_,_),file(File)),predicate_property(Preds,file(File)),functor(Preds,Fn,A),
+prefix_impl_preds_pp(Prefix,F,A):- predicate_property('mc__:'(_,_,_),file(File)),predicate_property(Preds,file(File)),functor_chkd(Preds,Fn,A),
     ((transpile_impl_prefix(Prefix);transpile_call_prefix(Prefix)),atom_concat(Prefix,F,Fn)).
 
 maplist_and_conj(_,A,B):- fullvar(A),!,B=A.
@@ -2961,7 +2966,7 @@
 extract_caller(H:-_,CallerInt,CallerSz):- !, extract_caller(H,CallerInt,CallerSz).
 extract_caller([=,H,_],CallerInt,CallerSz):-  !, extract_caller(H,CallerInt,CallerSz).
 extract_caller(P,F,A):- \+ callable(P),!, F=P,A=0.
-extract_caller(P,F,A):- \+ is_list(P), functor(P,F,A).
+extract_caller(P,F,A):- \+ is_list(P), functor_chkd(P,F,A).
 
 
 maybe_lazy_list(_,_,_,[],[]):-!.
@@ -3017,18 +3022,18 @@
      catch(quietly(as_tf(apply(F,List),R)),error(existence_error(procedure,F/_),_),
         quietly(catch(eval_args([F|List],R),_, R=[F|List])))).
 
-%u_assign([V|VI],[V|VO]):- nonvar(V),is_metta_data_functor(_Eq,V),!,maplist(eval_args,VI,VO).
+%u_assign([V|VI],[V|VO]):- nonvar(V),is_metta_data_functor_chkd(_Eq,V),!,maplist(eval_args,VI,VO).
 
 u_assign_c((F:-List),R):- !, R = (F:-List).
 
 /*
 u_assign_c(Cmp,RR):-
-  functor(Cmp,F,_),
+  functor_chkd(Cmp,F,_),
   current_predicate(F,_),
   debug(todo,'u_assign_c INTERP: ~q',[Cmp]),!,
   call(Cmp,RR).*/
 u_assign_c(FList,RR):-
-  functor(FList,F,_), % (F == 'car-atom' -> trace ; true),
+  functor_chkd(FList,F,_), % (F == 'car-atom' -> trace ; true),
   (catch(quietlY(call(FList,R)),error(existence_error(procedure,F/_),_),
      catch(quietlY(as_tf(FList,R)),error(existence_error(procedure,F/_),_),
       ((p2m(FList,[F0|List0]),catch(eval_args([F0|List0],R),_, R=~[F0|List0])))))),!,
@@ -3397,7 +3402,7 @@
    compile_flow_control2(HeadIs, LazyVars, RetResult, ResultLazy, Convert, Converted).
 
 compile_flow_control2(HeadIs, LazyVars, _Result, ResultLazy, Convert, Converted) :- fail,
-   functor(Convert,Func,PA),
+   functor_chkd(Convert,Func,PA),
    functional_predicate_arg(Func,PA,Nth),
    Convert =~ [Func|PredArgs],
    nth1(Nth,PredArgs,Result,FuncArgs),
@@ -3430,7 +3435,7 @@
   strip_m(HH,HHH),HHH=@=H2,
   strip_m(BB,BBB),BBB=@=B,!.
 
-%get_clause_pred(UAC,F,A):- expand_to_hb(UAC,H,_),strip_m(H,HH),functor(HH,F,A).
+%get_clause_pred(UAC,F,A):- expand_to_hb(UAC,H,_),strip_m(H,HH),functor_chkd(HH,F,A).
 
 
 % :- dynamic(needs_tabled/2).
@@ -3753,7 +3758,7 @@
 pi(PI):- PI is pi.
 
 % Retrieve Head of the List
-'car-atom'(List, Head):- eval_H(['car-atom', List], Head).
+% 'car-atom'(List, Head):- eval_H(['car-atom', List], Head).
 
 
 % Mapping any current predicate F/A to a function, if it's not tricky
@@ -3767,7 +3772,7 @@
 predicate_arity(F,A):- current_predicate(F/A).
 % Certain constructs should not be converted to functions.
 not_function(P):- atom(P),!,not_function(P,0).
-not_function(P):- callable(P),!,functor(P,F,A),not_function(F,A).
+not_function(P):- callable(P),!,functor_chkd(P,F,A),not_function(F,A).
 not_function(F,A):- is_arity_0(F,FF),!,not_function(FF,A).
 not_function(!,0).
 not_function(print,1).
@@ -3784,7 +3789,7 @@
 not_function('True',0).
 not_function(F,A):- predicate_arity(F,A),AA is A+1, \+ decl_functional_predicate_arg(F,AA,_).
 
-needs_call_fr(P):- is_function(P,_Nth),functor(P,F,A),AA is A+1, \+ current_predicate(F/AA).
+needs_call_fr(P):- is_function(P,_Nth),functor_chkd(P,F,A),AA is A+1, \+ current_predicate(F/AA).
 
 is_control_structure(F,A):- atom(F), atom_concat('if-',_,F),A>2.
 
@@ -3803,7 +3808,7 @@
 is_function(AsFunction, Nth) :- is_arity_0(AsFunction,_), !,Nth=1.
 is_function(AsFunction, Nth) :-
     callable(AsFunction),
-    functor(AsFunction, Functor, A),
+    functor_chkd(AsFunction, Functor, A),
     \+ not_function(Functor, A),
     AA is A + 1,
     functional_predicate_arg_maybe(Functor, AA, Nth).
@@ -4139,9 +4144,9 @@
    nonvar(AsFunction),
    compound(AsFunction),
    \+ is_arity_0(AsFunction,_),
-   functor(AsFunction,F,A),
+   functor_chkd(AsFunction,F,A),
    HeadIs\=@=AsFunction,
-   \+ (compound(HeadIs), (is_arity_0(HeadIs,HF);functor(HeadIs,HF,_))-> HF==F),
+   \+ (compound(HeadIs), (is_arity_0(HeadIs,HF);functor_chkd(HeadIs,HF,_))-> HF==F),
    (into_x_assign(AsFunction, Result,AsPred)
        -> true
        ; (AA is A+1,
@@ -4284,15 +4289,15 @@
 % Converts a given predicate AsPred to its equivalent function term AsFunction
 pred_to_funct(AsPred, AsFunction, Result) :-
     compound(AsPred), % Checks if AsPred is a compound term
-    functor(AsPred, F, A), % Retrieves the functor F and arity A of AsPred
+    functor_chkd(AsPred, F, A), % Retrieves the functor F and arity A of AsPred
     functional_predicate_arg(F, A, Nth),!, % Finds the Nth argument where the result should be
     arg(Nth, AsPred, Result), % Retrieves the result from the Nth argument of AsPred
     remove_funct_arg(AsPred, Nth, AsFunction). % Constructs the function AsFunction by removing the Nth argument from AsPred
 
 % If not found in functional_predicate_arg/3, it tries to construct AsFunction by removing the last argument from AsPred
 pred_to_funct(AsPred, AsFunction, Result) :-
     compound(AsPred), !,
-    functor(AsPred, _, Nth),
+    functor_chkd(AsPred, _, Nth),
     arg(Nth, AsPred, Result),
     remove_funct_arg(AsPred, Nth, AsFunction).
 
@@ -4314,7 +4319,7 @@
     findall(Head, member((Head:-_), HeadBodiesList), Heads),
     % Find the least general head among the collected Heads
     least_general_head(Heads, LeastHead),
-    functor(LeastHead,F,A),functor(NewHead,F,A),
+    functor_chkd(LeastHead,F,A),functor_chkd(NewHead,F,A),
     % Transform and combine bodies according to the new head found
     transform_and_combine_bodies(HeadBodiesList, NewHead, NewCombinedBodies)),
     \+ \+ (
@@ -4339,9 +4344,9 @@
 % This predicate is conceptual and will require more complex processing depending on the actual structures of the heads.
 generalization(Head1, Head2, GeneralizedHead) :-
     % Ensure the functor names and arities are the same between Head1 and Head2.
-    functor(Head1, Name, Arity),
-    functor(Head2, Name, Arity),
-    functor(GeneralizedHead, Name, Arity),
+    functor_chkd(Head1, Name, Arity),
+    functor_chkd(Head2, Name, Arity),
+    functor_chkd(GeneralizedHead, Name, Arity),
     % Generalize the arguments of the heads.
     generalize_args(Arity, Head1, Head2, GeneralizedHead).
 

prolog/metta_lang/metta_compiler_lib.pl

@@ -682,13 +682,13 @@
 
 
 
-:- initialization(setup_library_call(builtin, 'metta-equals', [2], '@doc', '@doc', [x(noeval,eager,[]), x(noeval,eager,[])], x(doeval,eager,[boolean])), program).
+transpiler_predicate_store(builtin, 'metta-equals', [2], '@doc', '@doc', [x(noeval,eager,[]), x(noeval,eager,[])], x(doeval,eager,[boolean])).
 'mc__1_2_metta-equals'(A,B,TF):- as_tf(A=@=B,TF).
 
-:- initialization(setup_library_call(builtin, 'metta-unify', [2], '@doc', '@doc', [x(noeval,eager,[]), x(noeval,eager,[])], x(doeval,eager,[boolean])), program).
+transpiler_predicate_store(builtin, 'metta-unify', [2], '@doc', '@doc', [x(noeval,eager,[]), x(noeval,eager,[])], x(doeval,eager,[boolean])).
 'mc__1_2_metta-unify'(A,B,TF):- as_tf(unify_with_occurs_check(A,B),TF).
 
-:- initialization(setup_library_call(builtin, 'decons-ht', [3], '@doc', '@doc', [x(noeval,eager,[]),x(noeval,eager,[]),x(noeval,eager,[])],x(doeval,eager,[boolean])), program).
+transpiler_predicate_store(builtin, 'decons-ht', [3], '@doc', '@doc', [x(noeval,eager,[]),x(noeval,eager,[]),x(noeval,eager,[])],x(doeval,eager,[boolean])).
 'mc__1_3_decons-ht'(E,H,T,TF):- check_type_error( \+ iz_conz(E), 'decons-ht'(E,H,T)),  as_tf(unify_with_occurs_check(E,[H|T]),TF).
 
 transpiler_predicate_nary_store(builtin, 'py-atom-call', 1, ['Atom'], 'Atom', 'Atom', [x(doeval,eager,[])], x(doeval,eager,[]), x(doeval,eager,[])).

prolog/metta_lang/metta_debug.pl

@@ -804,6 +804,8 @@
 
 sub_var_safely(Sub,Source):- assertion(acyclic_term(Source)),woct(sub_var(Sub,Source)).
 sub_term_safely(Sub,Source):- assertion(acyclic_term(Source)),woct(sub_term(Sub,Source)).
+functor_chkd(P,F,A):- compound(P),!,compound_name_arity(P,F,AA), if_t(A==0, (bt, prolog)), if_t(AA==0, (bt, prolog)), A=AA.
+functor_chkd(P,F,A):- functor(P,F,A), if_t(A==0, (bt, prolog)).
 
 maybe_abort_trace:- \+ is_flag(abort_trace), !.
 maybe_abort_trace:- abort_trace.

prolog/metta_lang/metta_eval.pl

@@ -1692,8 +1692,16 @@
 eval_20(_Eq,_RetType,_Depth,_Self,['=alpha', X,Y],TF):- !,
    as_tf('=alpha'(X,Y),TF).
 
+lmax_var_number(V, Max, Max) :- \+ compound(V), !.
+lmax_var_number(V, Max, Max) :- compound_name_arity(V,_,0), !.
+lmax_var_number('$VAR'(I), Max0, Max) :- integer(I), !, Max is max(I, Max0).
+lmax_var_number(S, Max0, Max) :- functor(S, _, Ar), lmax_var_numberl(Ar, S, Max0, Max).
+lmax_var_numberl(0, _, Max, Max) :- !.
+lmax_var_numberl(I, T, Max0, Max) :- arg(I, T, Arg),
+    I2 is I+ -1, lmax_var_number(Arg, Max0, Max1), lmax_var_numberl(I2, T, Max1, Max).
+
 equal_renumbered(X0,Y0,XX,YY):-
-   max_var_number(X0+Y0,0,N),succ(N,N2),
+   lmax_var_number(X0+Y0,0,N),succ(N,N2),
    copy_term(X0+Y0,X+Y),
    term_variables(X,VXs), term_variables(Y,VYs),
    merge_same_named_vars(VXs,VYs,Same,Merges,LOXVs,LOYVs),
@@ -1709,7 +1717,7 @@
 
 renumber_vars_wo_confict_tu(X,XXX):-
    copy_term(X,XX),
-   max_var_number(XX,0,N),
+   lmax_var_number(XX,0,N),
    succ(N,N2),
    numbervars(XX,N2,_,[attvar(skip)]), % TODO
    unnumbervars_wco123(XX,XXX).

prolog/metta_lang/metta_interp.pl

@@ -7704,7 +7704,7 @@
    debug_info(always(do_metta),do_metta_runtime(Var, Call)),
     original_user_error(Err),
     % Extract the functor name from the goal (`Call`) to create a description.
-    functor(Call, Func, _),
+    functor_chkd(Call, Func, _),
     atom_concat('Testing ', Func, Description),
     % Record the start times (wall clock and CPU time).
     current_times(WallStart, CPUStart),

prolog/metta_lang/metta_loader.pl

@@ -820,6 +820,7 @@
 %     % Import a Python module named "example_py_module" into the Prolog environment.
 %     ?- import_metta1('&self', 'example_py_module').
 %
+import_metta1(_Slf, Module) :- nonvar(Module), assumed_loaded(Module),!.
 import_metta1(Self, Module) :- maybe_into_top_self(Self, TopSelf), !, import_metta1(TopSelf, Module).
 import_metta1(Self, Module):-
     % If the Module is a valid Python module, extend the current Prolog context with Python.

prolog/metta_lang/metta_parser.pl

@@ -1068,6 +1068,11 @@
     read_list('}', Stream, List),
     univ_list_to_item(List,Item).
 
+% If '<', read an S-expression list.
+cont_sexpr_from_char(_EndChar, Stream, '<', Item) :- prolog_term_start('<'),
+    read_list('>', Stream, List),
+    univ_list_to_item(List,Item).
+
 % If '[', '{', etc. - using paren_pair_functor
 cont_sexpr_from_char(_EndChar, Stream, Char, Item) :- paren_pair_functor(Char, EndOfParen, Functor),
     read_list(EndOfParen, Stream, It3m),

prolog/metta_lang/metta_printer.pl

@@ -1911,12 +1911,15 @@
 
 
 compound_type_s_m_e(list,'(','.',')').
-compound_type_s_m_e(cmpd,S,E,M):- !, prolog_term_start(S),compound_type_s_m_e(ocmpd,S,E,M),!.
+compound_type_s_m_e(cmpd,S,E,M):- prolog_term_start(S),compound_type_s_m_e(ocmpd,S,E,M),!.
 compound_type_s_m_e(ocmpd,'#(','.',')').
 compound_type_s_m_e(ocmpd,'[','|',']').
 compound_type_s_m_e(ocmpd,'{','|','}').
 compound_type_s_m_e(ocmpd,'(','@',')').
 
+%prolog_term_start(_):- fail.
+%prolog_term_start('#(').
+%prolog_term_start('{').
 prolog_term_start('[').
 
 paren_pair_functor('(',')',_).

prolog/metta_lang/metta_python.pl

@@ -1899,7 +1899,7 @@
         (nonvar(File) -> Use = File ; Use = Module),
         pybug('extend-py!'(Use)),
         % py_call_warg(mettalog:use_mettalog()),
-        (Use == mettalog -> true ; py_load_modfile(Use)),
+        (assumed_loaded(Use) -> true ; py_load_modfile(Use)),
         % listing(ensure_rust_metta/1),
         % ensure_mettalog_py,
         nb_setval('$py_ready','true'),
@@ -1912,6 +1912,10 @@
         % py_call_warg(MeTTa:load_py_module(ToPython),Result),
         true)),!.
 
+
+assumed_loaded(mettalog).
+assumed_loaded(random).
+
 %!  py_load_modfile(+Use) is det.
 %
 %   Loads a Python module file into the current environment by calling the mettalog