# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(![X3]:![X4]:s(X1,happ(s(t_fun(t_h4s_ones_one,X1),happ(s(t_fun(X1,t_fun(t_h4s_ones_one,X1)),X2),s(X1,X3))),s(t_h4s_ones_one,X4)))=s(X1,X3)=>![X3]:![X5]:(p(s(t_bool,happ(s(t_fun(X1,t_bool),X5),s(X1,X3))))=>p(s(t_bool,h4s_quantheuristicss_guessu_u_existsu_u_point(s(t_fun(t_h4s_ones_one,X1),happ(s(t_fun(X1,t_fun(t_h4s_ones_one,X1)),X2),s(X1,X3))),s(t_fun(X1,t_bool),X5)))))),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__EXISTS__POINT', ch4s_quantHeuristicss_GUESSu_u_RULESu_u_TRIVIALu_u_EXISTSu_u_POINT)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__EXISTS__POINT', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__EXISTS__POINT', aHLu_FALSITY)).
fof(7, axiom,![X6]:(s(t_bool,X6)=s(t_bool,t)<=>p(s(t_bool,X6))),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__EXISTS__POINT', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(10, axiom,![X14]:![X1]:![X3]:![X5]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_existsu_u_point(s(t_fun(X1,X14),X3),s(t_fun(X14,t_bool),X5))))<=>![X15]:p(s(t_bool,happ(s(t_fun(X14,t_bool),X5),s(X14,happ(s(t_fun(X1,X14),X3),s(X1,X15))))))),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__EXISTS__POINT', ah4s_quantHeuristicss_GUESSu_u_REWRITESu_c2)).
fof(13, axiom,![X6]:(s(t_bool,X6)=s(t_bool,t)|s(t_bool,X6)=s(t_bool,f)),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__EXISTS__POINT', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
