# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(![X4]:![X5]:(p(s(t_bool,happ(s(t_fun(X2,t_bool),happ(s(t_fun(X2,t_fun(X2,t_bool)),X3),s(X2,X4))),s(X2,X5))))<=>s(X2,X5)=s(X2,X4))=>![X4]:![X6]:(![X5]:(s(X2,X5)=s(X2,X4)|?[X7]:s(X2,X5)=s(X2,happ(s(t_fun(X1,X2),X6),s(X1,X7))))=>p(s(t_bool,h4s_quantheuristicss_guessu_u_forallu_u_gap(s(t_fun(X1,X2),X6),s(t_fun(X2,t_bool),happ(s(t_fun(X2,t_fun(X2,t_bool)),X3),s(X2,X4)))))))),file('i/f/quantHeuristics/GUESS__RULES__TWO__CASES', ch4s_quantHeuristicss_GUESSu_u_RULESu_u_TWOu_u_CASES)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/quantHeuristics/GUESS__RULES__TWO__CASES', aHLu_FALSITY)).
fof(22, axiom,![X1]:![X2]:![X19]:![X20]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_forallu_u_gap(s(t_fun(X2,X1),X19),s(t_fun(X1,t_bool),X20))))<=>![X21]:(~(p(s(t_bool,happ(s(t_fun(X1,t_bool),X20),s(X1,X21)))))=>?[X7]:s(X1,X21)=s(X1,happ(s(t_fun(X2,X1),X19),s(X2,X7))))),file('i/f/quantHeuristics/GUESS__RULES__TWO__CASES', ah4s_quantHeuristicss_GUESSu_u_REWRITESu_c5)).
fof(26, axiom,![X10]:(s(t_bool,X10)=s(t_bool,t)|s(t_bool,X10)=s(t_bool,f)),file('i/f/quantHeuristics/GUESS__RULES__TWO__CASES', aHLu_BOOLu_CASES)).
fof(27, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/GUESS__RULES__TWO__CASES', aHLu_TRUTH)).
fof(29, axiom,![X10]:(s(t_bool,X10)=s(t_bool,t)<=>p(s(t_bool,X10))),file('i/f/quantHeuristics/GUESS__RULES__TWO__CASES', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
