Сформировать список L1 из элементов: максимальный элемент всего списка

domains
int=integer
intl=int*
 
predicates
max(intl,int)
task(intl,intl)
 
clauses
max([X],X).
max([H|T],H) :- max(T,U), H>U.
max([H|T],X) :- max(T,X), X>H.
 
task([],[]).
task([H|T],[M|R]) :- max([H|T],M), task(T,R).

goal
 
task([2,1,-3,4,-6,2],U),write(U),nl.

max_n1([], []).
max_n1(L, [M | R]) :-
  max_list(L, M),
  append(L1, [_], L),
  max_n1(L1, R).

?- L = [2,4,-6,10,14], max_n1(L, L1).
L = [2, 4, -6, 10, 14],
L1 = [14, 10, 4, 4, 2] ;
false.

domains
int=integer
intl=int*
 
predicates
max(intl,int)
lst(intl,intl)
app(intl,intl,intl)
rev(intl,intl)
task(intl,intl) 
 
clauses
max([X],X).
max([H|T],H) :- max(T,U), H>U.
max([H|T],X) :- max(T,X), X>H.
 
lst([],[]).
lst([H|T],[M|R]) :- max([H|T],M), lst(T,R).
 
app([],X,X).
app([H|T],X,[H|R]):-app(T,X,R).
 
rev([],[]).
rev([H|T],R):- rev(T,R1),app(R1,[H],R).
 
task(X,R) :- rev(X,RX),lst(RX,R).

max_n2(L, L2) :-
  reverse(L, L1),
  max_n2_(L1, L2).
max_n2_([H], [H]).
max_n2_([H | T], [M | R]) :-
  max_n2_(T, R),
  max_list([H | T], M).

?- L = [2,4,-6,10,14], max_n2(L, L1).
L = [2, 4, -6, 10, 14],
L1 = [14, 10, 4, 4, 2] ;
false.