# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:(![X2]:s(t_bool,happ(s(t_fun(t_bool,t_bool),X1),s(t_bool,X2)))=s(t_bool,X2)=>![X3]:(![X4]:s(t_bool,happ(s(t_fun(t_h4s_ones_one,t_bool),X3),s(t_h4s_ones_one,X4)))=s(t_bool,f)=>p(s(t_bool,h4s_quantheuristicss_guessu_u_forallu_u_gap(s(t_fun(t_h4s_ones_one,t_bool),X3),s(t_fun(t_bool,t_bool),X1)))))),file('i/f/quantHeuristics/GUESS__RULES__BOOL_c3', ch4s_quantHeuristicss_GUESSu_u_RULESu_u_BOOLu_c3)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/GUESS__RULES__BOOL_c3', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/quantHeuristics/GUESS__RULES__BOOL_c3', aHLu_FALSITY)).
fof(9, axiom,![X6]:(s(t_bool,t)=s(t_bool,X6)<=>p(s(t_bool,X6))),file('i/f/quantHeuristics/GUESS__RULES__BOOL_c3', ah4s_bools_EQu_u_CLAUSESu_c0)).
fof(11, axiom,![X6]:(s(t_bool,f)=s(t_bool,X6)<=>~(p(s(t_bool,X6)))),file('i/f/quantHeuristics/GUESS__RULES__BOOL_c3', ah4s_bools_EQu_u_CLAUSESu_c2)).
fof(15, axiom,![X6]:(s(t_bool,X6)=s(t_bool,t)|s(t_bool,X6)=s(t_bool,f)),file('i/f/quantHeuristics/GUESS__RULES__BOOL_c3', aHLu_BOOLu_CASES)).
fof(17, axiom,![X14]:![X5]:![X15]:![X16]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_forallu_u_gap(s(t_fun(X5,X14),X15),s(t_fun(X14,t_bool),X16))))<=>![X9]:(~(p(s(t_bool,happ(s(t_fun(X14,t_bool),X16),s(X14,X9)))))=>?[X17]:s(X14,X9)=s(X14,happ(s(t_fun(X5,X14),X15),s(X5,X17))))),file('i/f/quantHeuristics/GUESS__RULES__BOOL_c3', ah4s_quantHeuristicss_GUESSu_u_REWRITESu_c5)).
# SZS output end CNFRefutation
