Prove:

integer(X) and exists(X) and integer(Y) and exists(Y) => not (X > 0 and Y > 0 and 2 * X * X = Y * Y)

Given:

AxiomDefinition
identity0 integer(X) and any(X) => X + 0 = X and X * 0 = 0 ;
identity1 integer(X) and any(X) => X * 1 = X ;
division not X = 0 and X * Y = X * Z=> Y = Z ;
ordering integer(X) and any(X) and integer(Y) and any(Y) => X > Y xor X = Y xor Y > X ;
magnitude1 X * Y = Z and X > 1 and Z > 0=> Z > Y ;
magnitude2 X * Y > 0 and X > 0=> Y > 0 ;
range_finite X > Y and Y > Z=> finite(Y) ;
factor integer(X) and any(X) and integer(Y) and any(Y) and integer(Z) and exists(Z) and factor(X,Y)<=> X * Z = Y ;
prime prime(X)=> X > 1 and ((factor(Y,X)) and Y > 0=> Y = 1 or Y = X) ;
prime_factor (prime(X)) and (factor(X,Y * Z))=> (factor(X,Y)) or (factor(X,Z)) ;