Логическая задача Visual Prolog

domains
    s=string
    l=s*
predicates
    love(string,l)
    nondeterm prof(string,l)
    persons(l)
    weathers(l)
    nondeterm member(string,l)
    delete(l,l,l,l)
    lizhnik(l,l).
    nondeterm skali(l,l,l)
clauses
    weathers(["Snow","Rain"]).
    persons(["Tony","Miekle","Jhon"]).
    
    member(H,[H|_]).
    member(H,[_|T]):-member(H,T).
    
    delete(_,[],Result,Result):-!.
    delete(What,[H|From],Result,Out):-member(H,What),delete(What,From,Result,Out),!.
    delete(What,[H|From],Result,Out):-delete(What,From,[H|Result],Out).
 
    love("Tony",L):-weathers(L).
    love("Miekle",L):-weathers(W),love("Tony",TL),delete(TL,W,[],L).
    
    lizhnik(LWeather,["Lizhi"]):-member("Snow",LWeather),!.
    lizhnik(_,[]).
    
    skali(LWeather,Pr,Pr):-member("Rain",LWeather),!.
    skali(LWeather,Pr,["Skali"|Pr]).
    
    prof(Person,Profs):-
        persons(PersonsL),
        member(Person,PersonsL),
        love(Person,WeatherL),
        lizhnik(WeatherL,Profs1),
        skali(WeatherL,Profs1,Profs).
        
goal
    prof(P,L).