# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(![X4]:![X5]:s(t_bool,happ(s(t_fun(X2,t_bool),happ(s(t_fun(t_bool,t_fun(X2,t_bool)),X3),s(t_bool,X4))),s(X2,X5)))=s(t_bool,X4)=>![X4]:![X6]:s(t_bool,h4s_quantheuristicss_guessu_u_forall(s(t_fun(X1,X2),X6),s(t_fun(X2,t_bool),happ(s(t_fun(t_bool,t_fun(X2,t_bool)),X3),s(t_bool,X4)))))=s(t_bool,t)),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__FORALL', ch4s_quantHeuristicss_GUESSu_u_RULESu_u_CONSTANTu_u_FORALL)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__FORALL', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__FORALL', aHLu_FALSITY)).
fof(4, axiom,![X7]:(s(t_bool,X7)=s(t_bool,t)|s(t_bool,X7)=s(t_bool,f)),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__FORALL', aHLu_BOOLu_CASES)).
fof(6, axiom,![X8]:![X9]:((p(s(t_bool,X9))=>p(s(t_bool,X8)))=>((p(s(t_bool,X8))=>p(s(t_bool,X9)))=>s(t_bool,X9)=s(t_bool,X8))),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__FORALL', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(13, axiom,![X7]:(s(t_bool,t)=s(t_bool,X7)<=>p(s(t_bool,X7))),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__FORALL', ah4s_bools_EQu_u_CLAUSESu_c0)).
fof(16, axiom,![X2]:![X1]:![X6]:![X14]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_forall(s(t_fun(X1,X2),X6),s(t_fun(X2,t_bool),X14))))<=>![X15]:(~(p(s(t_bool,happ(s(t_fun(X2,t_bool),X14),s(X2,X15)))))=>?[X16]:~(p(s(t_bool,happ(s(t_fun(X2,t_bool),X14),s(X2,happ(s(t_fun(X1,X2),X6),s(X1,X16))))))))),file('i/f/quantHeuristics/GUESS__RULES__CONSTANT__FORALL', ah4s_quantHeuristicss_GUESSu_u_REWRITESu_c1)).
# SZS output end CNFRefutation
