# 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_forallu_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__FORALL__POINT', ch4s_quantHeuristicss_GUESSu_u_RULESu_u_TRIVIALu_u_FORALLu_u_POINT)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__FORALL__POINT', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__FORALL__POINT', aHLu_FALSITY)).
fof(12, axiom,![X8]:(s(t_bool,X8)=s(t_bool,t)|s(t_bool,X8)=s(t_bool,f)),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__FORALL__POINT', aHLu_BOOLu_CASES)).
fof(15, axiom,![X18]:![X1]:![X3]:![X5]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_forallu_u_point(s(t_fun(X1,X18),X3),s(t_fun(X18,t_bool),X5))))<=>![X19]:~(p(s(t_bool,happ(s(t_fun(X18,t_bool),X5),s(X18,happ(s(t_fun(X1,X18),X3),s(X1,X19)))))))),file('i/f/quantHeuristics/GUESS__RULES__TRIVIAL__FORALL__POINT', ah4s_quantHeuristicss_GUESSu_u_REWRITESu_c3)).
# SZS output end CNFRefutation
