Turbo prolog - задача на списки: определить, где живет Айрис и чем она занимается

trail=1000
domains
    s=symbol list=s*    
predicates
    solve(list,list)
    permutation1(list,list)
    select1(s,list,list)
    member1(s,list)
goal
    solve(Occupations,Cities).
clauses
    permutation1([],[]).
    permutation1(List,[First|Perm]):-
        select1(First,List,Rest),
        permutation1(Rest,Perm).
    select1(X,[X|Tail],Tail).
    select1(Elem,[Head|Tail],[Head|Rest]):-
        select1(Elem,Tail,Rest).
    member1(Head,[Head|_]).
    member1(Head,[_|Tail]):-
        member1(Head,Tail). 
        
    solve(Occupations,Cities):-
        Occupations=[Linda,Iris,Judi],
        Cities=[Linda1,Iris1,Judi1],
        permutation1([dance,sing,cinema],Occupations),
        permutation1([paris,chicago,rome],Cities),
        not(Linda1=rome),not(Linda=dance),
        not(Judi1=paris),
        Roman=[Judi1,Iris1],
        member1(sing,Roman),
        Paris=[Iris1,Linda1],
        not(member1(cinema,Paris)),
        write(linda,Linda,Linda1),nl.

domains
    s=string
    list=s*     
    acc=a(s,s,s)
    accs=acc*
predicates
    solve(accs)
    permutation(list,list)
    insert(s,list,list)
    member(s,list)
goal
    solve(Sol),
    write(Sol),nl.
clauses
    permutation([],[]).
    permutation([H|Tail],L):-
        permutation(Tail,NewTail),
        insert(H,NewTail,L).
    insert(X,L,[X|L]).
    insert(X,[H|Tail],[H|NewTail]):-
        insert(X,Tail,NewTail).
    member(H,[H|_]).
    member(H,[_|Tail]):-
        member(H,Tail).
    
    solve([a("linda",Linda,Linda1),
               a("iris",Iris,Iris1),
               a("judi",Judi,Judi1)]):-
        permutation(["dance","cinema","sing"],[Linda,Iris,Judi]),
        permutation(["chicago","rome","paris"],[Linda1,Iris1,Judi1]),
        Linda1><"rome",
        Linda><"dance",
        Judi1><"paris",
        member("sing",[Linda,Iris]),
        not(member("cinema",[Linda,Iris])).