Поиск количества неодинаковых чисел в массиве

domains
file = infile
int_list = integer*
r=real
 
predicates
sum(int_list, r)
avg(int_list, r)
length(int_list, r)
load_from_file(int_list)
dble(int_list, int_list, real)
other_length(int_list, integer)
run
clauses
sum([],0).
sum([H|T], S):-
sum(T, S_T), /*S_T-summa elementov hvosta */
S=S_T+ H.
length([], 0).
length([_|T], L):-
length(T, L_T), 
L = L_T + 1.
avg([],0):-!.
avg(L,A):-
sum(L,S),
length(L,K),
A=S/K.
load_from_file([]):- eof(infile), !.
load_from_file([H|T]):- not(eof(infile)),
readint(H), load_from_file(T).
dble([],[],_):-!.
dble([H|T],L,N):- H>N, H1=H*H, dble(T,L1,N), L=[H1|L1].
dble([H|T],L,N):- N>=H,dble(T,L1,N), L=[H|L1].
other_length([], 0):-!.
other_length([H|T],M):- H<>H, other_length(T,M_T), M=M_T+1.
other_length([H|T],M):- H=H, other_length(T,M_T), M=M_T.
run:- openread(infile, "input.txt"),
readdevice(infile),
load_from_file(L),
closefile(infile),
readdevice(keyboard),
write("Sodergimoe faila:"), nl,
write(L), nl,
avg(L, X),
write("Srednee arifmeticheskoe:"), nl,
write(X), nl,
dble(L, L1, X),
write("chisla bolshie srednego arifmeticheskogo v kvadrate:"), nl,
write(L1), nl,
other_length(L, Y),
write(Y), nl.
goal
run.

member(X,[X|_]):-!.
member(X,[_|T]):-member(X,T).
 
other_length([], 0).
other_length([H|T],M):- member(H,T), !, other_length(T,M).
other_length([_|T],M):- other_length(T,M_T), M=M_T+1.