formulas(assumptions).

% Description Theorem 1
all F (relation1(F) -> ((exists x (object(x) & exemplifies1(F,x) & (all y (object(y) -> (exemplifies1(F,y) -> y=x))))) -> (exists x (object(x) & is_the(x,F))))).

% Description Theorem 2
all F (relation1(F) -> ((exists x (object(x) & is_the(x,F))) -> (all y (object(y) -> (is_the(y,F) -> exemplifies1(F,y)))))).

% Typing on is_the 
all x all F (is_the(x,F) -> (relation1(F) & object(x))).

% Def: nonegreater
all x (object(x) -> (exemplifies1(nonegreater,x) <-> 
	(exemplifies1(conceivable,x) & 
		-(exists y (object(y) & exemplifies2(greaterthan,y,x) &
			exemplifies1(conceivable,y)))))).

% Premise 1
exists x (object(x) & exemplifies1(nonegreater,x)).

% Lemma 2 
exists x (object(x) & exemplifies1(nonegreater,x)) ->
	exists x (object(x) & exemplifies1(nonegreater,x) & (all y (object(y) -> (exemplifies1(nonegreater,y) -> y=x)))).

% Premise 2
all x (object(x) -> ((is_the(x,nonegreater) & -exemplifies1(e,x)) -> 
	exists y (object(y) & exemplifies2(greaterthan,y,x) & exemplifies1(conceivable,y)))).

% Definition of God
is_the(g,nonegreater).

end_of_list.

formulas(goals).

exemplifies1(e,g).

end_of_list.