Ciao Preprocessor (integrated Alpha version)
| This is an alpha distribution, meant only for testing. Please do let us
| know at ciaopp-bugclip.dia.fi.upm.es any problems you may have.
{loaded in 3824.239 msec.}
{preprocessed for plai in 0.0 msec.}
{analyzed by plai using eterms with local-control off in 4.001 msec.}
{preprocessed for plai in 0.0 msec.}
{analyzed by plai using shfr with local-control off in 0.0 msec.}
{preprocessed for nfg in 0.0 msec.}
{analyzed by nfg in 0.0 msec.}
{analysis information stored in 0.0 msec.}
{preprocessed for ub bounds cost analysis in 0.0 msec.}
{ub bounds cost analysis performed in 16.001 msec.}
{ub bounds cost information stored in 0.0 msec.}
{preprocessed for lb bounds cost analysis in 0.0 msec.}
{lb bounds cost analysis performed in 0.0 msec.}
{lb bounds cost information stored in 0.0 msec.}
{written file /tmp/tmpKH6vEI/tree_eterms_shfr_nfg_resources_co.pl}
:- module(_1,[bin_tree/1],[assertions,predefres(res_steps),nativeprops,basicmodes,regtypes]).
:- entry bin_tree(A)
: ground(A).
:- true pred bin_tree(A)
: gnd(A)
=> rt3(A).
:- true pred bin_tree(A)
: ground([A])
=> ground([A]).
:- true pred bin_tree(A)
: gnd(A)
=> rt3(A)
+ ( possibly_fails, not_covered ).
:- true pred bin_tree(A)
: gnd(A)
=> ( rt3(A), size(lb,A,size(A)) )
+ cost(lb,steps,0).
:- true pred bin_tree(A)
: gnd(A)
=> ( rt3(A), size(ub,A,size(A)) )
+ cost(ub,steps,size(A)).
bin_tree(void).
bin_tree(tree(_1,Left,Right)) :-
bin_tree(Left),
bin_tree(Right).
:- regtype rt3/1.
rt3(void).
rt3(tree(A,B,C)) :-
gnd(A),
rt3(B),
rt3(C).