Обед с логикой. Логическая задача

DOMAINS
int = integer
neighbor = n;a;v;c;d;e;f;g;o
list = neighbor*
gipoteza = gipoteza(list, int)
Otvet = gipoteza*
PREDICATES
nondeterm MN(neighbor)
nondeterm GG(gipoteza)
nondeterm L(list, int, int)
nondeterm BetweenZeroA(int, int)
nondeterm InList(neighbor, list)
nondeterm InputIn(neighbor, gipoteza)
nondeterm GSoch(list, int, list)
nondeterm CheckGipoteza(gipoteza)
nondeterm CheckPravila(int, gipoteza)
nondeterm NotInputIn(neighbor, gipoteza)
nondeterm NeskolkoInpitIn(list, gipoteza)
nondeterm FoundOtvet(gipoteza)
nondeterm FoundMaxOtvet(gipoteza)
nondeterm max(otvet, gipoteza, gipoteza)
nondeterm bigger(gipoteza, gipoteza)
CLAUSES
MN(a).
MN(v).
MN(c).
MN(d).
MN(e).
MN(f).
MN(g).
MN(o).
 
InList(El, [El|_OstEl]).
InList(El, [_FirstEl|OstEl]):-
    InList(El, OstEl).
 
InputIn(El, gipoteza(List, _)) :-
    InList(El, List).
    
NotInputIn(El, Gipoteza):-
    NOT(InputIn(El, Gipoteza)).
 
NeskolkoInpitIn([], _Gipoteza).
NeskolkoInpitIn([First|Ost], Gipoteza):-
    InputIn(First, Gipoteza),
    NeskolkoInpitIn(Ost, Gipoteza).
 
L([], Le, Le).
L([_First|Ost], Buffer, Le):-
    NewBuffer = Buffer + 1,
    L(Ost, NewBuffer, Le).
 
BetweenZeroA(Before, Before).
BetweenZeroA(Before, Number):-
    Before > 0,
    MBefore = Before - 1,
    BetweenZeroA(MBefore, Number).
 
GSoch(_List, 0, []).
GSoch([FirstEl|Ost],
        LSoch,
        [FirstEl|Podlist]):-
    DlinaPodlist = LSoch - 1,
    GSoch(Ost, DlinaPodlist, Podlist).
    GSoch([_FirstEl|Ost], Le, Podlist):-
    GSoch(Ost, Le, Podlist).
 
GG(gipoteza(List, CountG)):-
    findall(Neighbor, MN(Neighbor), Neighbors),
    L(Neighbors, 0, CountN),
    BetweenZeroA(CountN, CountG),
    GSoch(Neighbors, CountG, List).
 
CheckGipoteza(Gipoteza):-
CheckPravila(1, Gipoteza),
CheckPravila(2, Gipoteza),
CheckPravila(3, Gipoteza),
CheckPravila(4, Gipoteza),
CheckPravila(5, Gipoteza),
CheckPravila(6, Gipoteza),
CheckPravila(7, Gipoteza),
CheckPravila(8, Gipoteza).
 
CheckPravila(1, Gipoteza):-
InputIn(a, Gipoteza), NotInputIn(v, Gipoteza), NotInputIn(c, Gipoteza),
NOT(NeskolkoInpitIn([d, e], Gipoteza));
NotInputIn(a, Gipoteza).
 
CheckPravila(2, Gipoteza):-
InputIn(d, Gipoteza), InputIn(e, Gipoteza);
NotInputIn(d, Gipoteza).
 
CheckPravila(3, Gipoteza):-
InputIn(e, Gipoteza), NotInputIn(v, Gipoteza);
NotInputIn(e, Gipoteza).
 
CheckPravila(4, Gipoteza):-
InputIn(f, Gipoteza), InputIn(g, Gipoteza);
NotInputIn(f, Gipoteza).
 
CheckPravila(5, Gipoteza):-
InputIn(o, Gipoteza), InputIn(f, Gipoteza), InputIn(a, Gipoteza);
InputIn(o, Gipoteza), NotInputIn(f, Gipoteza);
NotInputIn(o, Gipoteza).
 
CheckPravila(6, Gipoteza):-
NotInputIn(f, Gipoteza), InputIn(o, Gipoteza), NotInputIn(e, Gipoteza);
InputIn(f, Gipoteza), InputIn(o, Gipoteza);
NotInputIn(o, Gipoteza).
 
CheckPravila(7, Gipoteza):-
InputIn(g, Gipoteza), InputIn(d, Gipoteza);
InputIn(g, Gipoteza), InputIn(o, Gipoteza);
NotInputIn(g, Gipoteza).
 
CheckPravila(8, Gipoteza):-
InputIn(g, Gipoteza), NotInputIn(v, Gipoteza), NotInputIn(c, Gipoteza), InputIn(e, Gipoteza), InputIn(a, Gipoteza);
InputIn(g, Gipoteza), NotInputIn(v, Gipoteza), NotInputIn(c, Gipoteza), NotInputIn(e, Gipoteza);
NotInputIn(g, Gipoteza).
 
FoundOtvet(Otvet):-
    GG(Otvet),
    CheckGipoteza(Otvet).
 
FoundMaxOtvet(Max):-
    findall(Otvet, FoundOtvet(Otvet), Otvets),
    Otvets = [First|Ost],
    max(Ost, First, Max).
 
max([], Buffer, Buffer).
max([First|Ost], Buffer, Max):-
    bigger(First, Buffer), 
    max(Ost, First, Max).
max([First|Ost], Buffer, Max):-
    NOT(bigger(First, Buffer)), 
    max(Ost, Buffer, Max).
 
bigger(gipoteza(_, First), gipoteza(_, Second)) :-
    First > Second.
 
GOAL
FoundMaxOtvet(Otvet), write("Otvet: ", Otvet).