# 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_existsu_u_gap(s(t_fun(X1,X2),X3),s(t_fun(X2,t_bool),X4))))=>p(s(t_bool,h4s_quantheuristicss_guessu_u_exists(s(t_fun(X1,X2),X3),s(t_fun(X2,t_bool),X4))))),file('i/f/quantHeuristics/GUESSES__WEAKEN__THM_c3', ch4s_quantHeuristicss_GUESSESu_u_WEAKENu_u_THMu_c3)).
fof(5, axiom,![X11]:![X12]:((p(s(t_bool,X12))=>p(s(t_bool,X11)))=>((p(s(t_bool,X11))=>p(s(t_bool,X12)))=>s(t_bool,X12)=s(t_bool,X11))),file('i/f/quantHeuristics/GUESSES__WEAKEN__THM_c3', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(29, axiom,![X2]:![X1]:![X3]:![X4]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_exists(s(t_fun(X1,X2),X3),s(t_fun(X2,t_bool),X4))))<=>![X19]:(p(s(t_bool,happ(s(t_fun(X2,t_bool),X4),s(X2,X19))))=>?[X20]:p(s(t_bool,happ(s(t_fun(X2,t_bool),X4),s(X2,happ(s(t_fun(X1,X2),X3),s(X1,X20)))))))),file('i/f/quantHeuristics/GUESSES__WEAKEN__THM_c3', ah4s_quantHeuristicss_GUESSu_u_REWRITESu_c0)).
fof(32, axiom,![X2]:![X1]:![X3]:![X4]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_existsu_u_gap(s(t_fun(X1,X2),X3),s(t_fun(X2,t_bool),X4))))<=>![X19]:(p(s(t_bool,happ(s(t_fun(X2,t_bool),X4),s(X2,X19))))=>?[X20]:s(X2,X19)=s(X2,happ(s(t_fun(X1,X2),X3),s(X1,X20))))),file('i/f/quantHeuristics/GUESSES__WEAKEN__THM_c3', ah4s_quantHeuristicss_GUESSu_u_REWRITESu_c4)).
# SZS output end CNFRefutation
