$7$ CNF in First Order Logic

Transform to CNF $($conjunction normal form$)$ the following formula:

$(EE$:$x=x)=>(AAxEEz$:$x=z)$

$8$ Resolution in First Order Logic

Using resolution in first order logic show unsatisfiability of the following set of clauses:

$S=\{notR(x,y)vvP(f(x),y),$notP$(f(a),z),R(a,b)\}$

where $P,R$ are predicates, $f$ is a functional symbol, $x,y,z$ are individual variables and $a,b$ are constants.

$9$ ANN

Construct a neural network computing logical gate $not{p}^{{?}^{?}}q$ using the following threshold activation function:

$(x)=\{\begin{array}{ccc}1& gdy& x0\\ 0& gdy& x<mn\; id="EditorElement\_1869921">0</mn>\end{array}$