# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(![X4]:![X5]:s(X2,happ(s(t_fun(X1,X2),happ(s(t_fun(X2,t_fun(X1,X2)),X3),s(X2,X4))),s(X1,X5)))=s(X2,X4)=>![X4]:![X6]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_existsu_u_gap(s(t_fun(X1,X2),happ(s(t_fun(X2,t_fun(X1,X2)),X3),s(X2,X4))),s(t_fun(X2,t_bool),X6))))=>s(t_bool,h4s_bools_u_3fu_21(s(t_fun(X2,t_bool),X6)))=s(t_bool,happ(s(t_fun(X2,t_bool),X6),s(X2,X4))))),file('i/f/quantHeuristics/GUESSES__UEXISTS__THM2', ch4s_quantHeuristicss_GUESSESu_u_UEXISTSu_u_THM2)).
fof(3, 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__UEXISTS__THM2', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(46, axiom,![X2]:![X5]:(p(s(t_bool,h4s_bools_u_3fu_21(s(t_fun(X2,t_bool),X5))))<=>(p(s(t_bool,d_exists(s(t_fun(X2,t_bool),X5))))&![X28]:![X14]:((p(s(t_bool,happ(s(t_fun(X2,t_bool),X5),s(X2,X28))))&p(s(t_bool,happ(s(t_fun(X2,t_bool),X5),s(X2,X14)))))=>s(X2,X28)=s(X2,X14)))),file('i/f/quantHeuristics/GUESSES__UEXISTS__THM2', ah4s_bools_EXISTSu_u_UNIQUEu_u_DEF)).
fof(53, axiom,![X1]:![X2]:![X4]:![X6]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_existsu_u_gap(s(t_fun(X2,X1),X4),s(t_fun(X1,t_bool),X6))))<=>![X34]:(p(s(t_bool,happ(s(t_fun(X1,t_bool),X6),s(X1,X34))))=>?[X35]:s(X1,X34)=s(X1,happ(s(t_fun(X2,X1),X4),s(X2,X35))))),file('i/f/quantHeuristics/GUESSES__UEXISTS__THM2', ah4s_quantHeuristicss_GUESSu_u_EXISTSu_u_GAPu_u_def)).
fof(55, axiom,![X2]:![X5]:s(t_bool,d_exists(s(t_fun(X2,t_bool),X5)))=s(t_bool,happ(s(t_fun(X2,t_bool),X5),s(X2,h4s_mins_u_40(s(t_fun(X2,t_bool),X5))))),file('i/f/quantHeuristics/GUESSES__UEXISTS__THM2', ah4s_bools_EXISTSu_u_DEF)).
fof(75, axiom,![X2]:![X5]:![X6]:(p(s(t_bool,happ(s(t_fun(X2,t_bool),X6),s(X2,X5))))=>p(s(t_bool,happ(s(t_fun(X2,t_bool),X6),s(X2,h4s_mins_u_40(s(t_fun(X2,t_bool),X6))))))),file('i/f/quantHeuristics/GUESSES__UEXISTS__THM2', ah4s_bools_SELECTu_u_AX)).
# SZS output end CNFRefutation
