# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(![X4]:![X5]:s(t_bool,happ(s(t_fun(X2,t_bool),happ(s(t_fun(t_bool,t_fun(X2,t_bool)),X3),s(t_bool,X4))),s(X2,X5)))=s(t_bool,X4)=>![X4]:![X6]:s(t_bool,h4s_quantheuristicss_guessu_u_exists(s(t_fun(X1,X2),X6),s(t_fun(X2,t_bool),happ(s(t_fun(t_bool,t_fun(X2,t_bool)),X3),s(t_bool,X4)))))=s(t_bool,t)),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__EXISTS', ch4s_quantHeuristicss_GUESSu_u_RULESu_u_CONSTANTu_u_EXISTS)).
fof(5, axiom,![X9]:![X10]:((p(s(t_bool,X10))=>p(s(t_bool,X9)))=>((p(s(t_bool,X9))=>p(s(t_bool,X10)))=>s(t_bool,X10)=s(t_bool,X9))),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__EXISTS', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(29, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__EXISTS', aHLu_TRUTH)).
fof(30, axiom,![X13]:(s(t_bool,X13)=s(t_bool,t)|s(t_bool,X13)=s(t_bool,f)),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__EXISTS', aHLu_BOOLu_CASES)).
fof(33, axiom,![X13]:(s(t_bool,X13)=s(t_bool,t)<=>p(s(t_bool,X13))),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__EXISTS', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(38, axiom,(~(p(s(t_bool,f)))<=>p(s(t_bool,t))),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__EXISTS', ah4s_bools_NOTu_u_CLAUSESu_c2)).
fof(59, axiom,![X2]:![X1]:![X6]:![X19]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_exists(s(t_fun(X1,X2),X6),s(t_fun(X2,t_bool),X19))))<=>![X25]:(p(s(t_bool,happ(s(t_fun(X2,t_bool),X19),s(X2,X25))))=>?[X26]:p(s(t_bool,happ(s(t_fun(X2,t_bool),X19),s(X2,happ(s(t_fun(X1,X2),X6),s(X1,X26)))))))),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__EXISTS', ah4s_quantHeuristicss_GUESSu_u_EXISTSu_u_FORALLu_u_REWRITESu_c0)).
# SZS output end CNFRefutation
