----------------------Processed Model----------------------------- ---------------------------------------------------------------- Model found ---------------- ---------------------------------------------------------------- THEOREM ---------------- An algebra satisfies (x*y)*z=x*x. x*(y*z)=x*x. x*x=y*y. iff it satisfies (x*y)*z=x*x. x*(y*z)=x*x. and does not contain interpretation( 2, [number = 1,seconds = 0], [ function(*(_,_), [ 0,0, 1,1]), function(c1, [0]), function(c2, [1])]). The proof of this theorem can be obtained using ProverX(www.proverx.com) with the following input assign(max_seconds, 60). formulas(assumptions). (x*y)*z=x*x. x*(y*z)=x*x. exists x exists y -(x*x=y*y). end_of_list. formulas(goals). exists a1 exists a0 (a1 != a0 & *(a1,a1) = a1 & *(a0,a0) = a0 ). end_of_list. Or with this alternative input Assumptions: (x*y)*z=x*x. x*(y*z)=x*x. x*x!=y*y. (x1 = x0 | *(x1,x1) != x1 | *(x0,x0) != x0 ). Theorem in latex \begin{theorem}[FST] \label{theo:Based on FST} An algebra satisfies \begin{align*}(x*y)*z=x*x\\ x*(y*z)=x*x\\ x*x=y*y\\ \end{align*} iff it satisfies \begin{align*}(x*y)*z=x*x\\ x*(y*z)=x*x\\ \end{align*} and does not contain \[ M1 \] \[ \begin{array}{c|cc} * & 0 & 1\\ \hline 0 & 0 & 0\\ 1 & 1 & 1\\ \end{array} \]\end{theorem} ----------------------------------------------------------------