# 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))))<=>![X5]:(~(p(s(t_bool,happ(s(t_fun(X1,t_bool),X4),s(X1,X5)))))=>?[X6]:~(p(s(t_bool,happ(s(t_fun(X1,t_bool),X4),s(X1,happ(s(t_fun(X2,X1),X3),s(X2,X6))))))))),file('i/f/quantHeuristics/GUESS__EXISTS__FORALL__REWRITES_c1', ch4s_quantHeuristicss_GUESSu_u_EXISTSu_u_FORALLu_u_REWRITESu_c1)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/quantHeuristics/GUESS__EXISTS__FORALL__REWRITES_c1', aHLu_FALSITY)).
fof(3, axiom,![X7]:![X8]:((p(s(t_bool,X8))=>p(s(t_bool,X7)))=>((p(s(t_bool,X7))=>p(s(t_bool,X8)))=>s(t_bool,X8)=s(t_bool,X7))),file('i/f/quantHeuristics/GUESS__EXISTS__FORALL__REWRITES_c1', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(25, 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))))<=>(![X5]:p(s(t_bool,happ(s(t_fun(X1,t_bool),X4),s(X1,X5))))<=>![X6]:p(s(t_bool,happ(s(t_fun(X1,t_bool),X4),s(X1,happ(s(t_fun(X2,X1),X3),s(X2,X6)))))))),file('i/f/quantHeuristics/GUESS__EXISTS__FORALL__REWRITES_c1', ah4s_quantHeuristicss_GUESSu_u_FORALLu_u_def)).
fof(26, axiom,![X9]:(s(t_bool,X9)=s(t_bool,t)|s(t_bool,X9)=s(t_bool,f)),file('i/f/quantHeuristics/GUESS__EXISTS__FORALL__REWRITES_c1', aHLu_BOOLu_CASES)).
fof(28, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/GUESS__EXISTS__FORALL__REWRITES_c1', aHLu_TRUTH)).
fof(30, axiom,![X9]:(s(t_bool,X9)=s(t_bool,t)<=>p(s(t_bool,X9))),file('i/f/quantHeuristics/GUESS__EXISTS__FORALL__REWRITES_c1', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
