# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_forall(s(t_fun(X2,X1),X3),s(t_fun(X1,t_bool),X4))))=>(p(s(t_bool,d_forall(s(t_fun(X1,t_bool),X4))))<=>![X5]:p(s(t_bool,happ(s(t_fun(X1,t_bool),X4),s(X1,happ(s(t_fun(X2,X1),X3),s(X2,X5)))))))),file('i/f/quantHeuristics/GUESS__FORALL__THM', ch4s_quantHeuristicss_GUESSu_u_FORALLu_u_THM)).
fof(22, axiom,![X2]:![X21]:(p(s(t_bool,d_forall(s(t_fun(X2,t_bool),X21))))<=>![X13]:p(s(t_bool,happ(s(t_fun(X2,t_bool),X21),s(X2,X13))))),file('i/f/quantHeuristics/GUESS__FORALL__THM', ah4s_bools_FORALLu_u_THM)).
fof(23, axiom,![X1]:![X2]:![X3]:![X4]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_forall(s(t_fun(X2,X1),X3),s(t_fun(X1,t_bool),X4))))<=>![X23]:(~(p(s(t_bool,happ(s(t_fun(X1,t_bool),X4),s(X1,X23)))))=>?[X5]:~(p(s(t_bool,happ(s(t_fun(X1,t_bool),X4),s(X1,happ(s(t_fun(X2,X1),X3),s(X2,X5))))))))),file('i/f/quantHeuristics/GUESS__FORALL__THM', ah4s_quantHeuristicss_GUESSu_u_REWRITESu_c1)).
fof(26, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/GUESS__FORALL__THM', aHLu_TRUTH)).
fof(28, axiom,![X8]:(s(t_bool,X8)=s(t_bool,t)<=>p(s(t_bool,X8))),file('i/f/quantHeuristics/GUESS__FORALL__THM', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
