# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/GUESS__RULES__FORALL_c4', aHLu_TRUTH)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/quantHeuristics/GUESS__RULES__FORALL_c4', aHLu_FALSITY)).
fof(3, axiom,![X1]:(s(t_bool,X1)=s(t_bool,t)|s(t_bool,X1)=s(t_bool,f)),file('i/f/quantHeuristics/GUESS__RULES__FORALL_c4', aHLu_BOOLu_CASES)).
fof(5, axiom,![X7]:![X6]:s(t_bool,d_exists(s(t_fun(X7,t_bool),X6)))=s(t_bool,happ(s(t_fun(X7,t_bool),X6),s(X7,h4s_mins_u_40(s(t_fun(X7,t_bool),X6))))),file('i/f/quantHeuristics/GUESS__RULES__FORALL_c4', ah4s_bools_EXISTSu_u_DEF)).
fof(6, axiom,![X7]:![X6]:![X8]:(p(s(t_bool,happ(s(t_fun(X7,t_bool),X8),s(X7,X6))))=>p(s(t_bool,happ(s(t_fun(X7,t_bool),X8),s(X7,h4s_mins_u_40(s(t_fun(X7,t_bool),X8))))))),file('i/f/quantHeuristics/GUESS__RULES__FORALL_c4', ah4s_bools_SELECTu_u_AX)).
fof(19, axiom,![X1]:(s(t_bool,X1)=s(t_bool,t)<=>p(s(t_bool,X1))),file('i/f/quantHeuristics/GUESS__RULES__FORALL_c4', ah4s_bools_EQu_u_CLAUSESu_c1)).
fof(35, axiom,![X21]:![X7]:![X22]:![X8]:(p(s(t_bool,h4s_quantheuristicss_guessu_u_exists(s(t_fun(X7,X21),X22),s(t_fun(X21,t_bool),X8))))<=>![X23]:(p(s(t_bool,happ(s(t_fun(X21,t_bool),X8),s(X21,X23))))=>?[X24]:p(s(t_bool,happ(s(t_fun(X21,t_bool),X8),s(X21,happ(s(t_fun(X7,X21),X22),s(X7,X24)))))))),file('i/f/quantHeuristics/GUESS__RULES__FORALL_c4', ah4s_quantHeuristicss_GUESSu_u_REWRITESu_c0)).
fof(41, conjecture,![X25]:![X7]:![X26]:(![X8]:![X6]:(p(s(t_bool,happ(s(t_fun(X25,t_bool),happ(s(t_fun(t_fun(X25,t_fun(X7,t_bool)),t_fun(X25,t_bool)),X26),s(t_fun(X25,t_fun(X7,t_bool)),X8))),s(X25,X6))))<=>![X11]:p(s(t_bool,happ(s(t_fun(X7,t_bool),happ(s(t_fun(X25,t_fun(X7,t_bool)),X8),s(X25,X6))),s(X7,X11)))))=>![X27]:(![X8]:![X11]:![X6]:s(t_bool,happ(s(t_fun(X25,t_bool),happ(s(t_fun(X7,t_fun(X25,t_bool)),happ(s(t_fun(t_fun(X25,t_fun(X7,t_bool)),t_fun(X7,t_fun(X25,t_bool))),X27),s(t_fun(X25,t_fun(X7,t_bool)),X8))),s(X7,X11))),s(X25,X6)))=s(t_bool,happ(s(t_fun(X7,t_bool),happ(s(t_fun(X25,t_fun(X7,t_bool)),X8),s(X25,X6))),s(X7,X11)))=>![X28]:(![X29]:![X30]:s(X25,happ(s(t_fun(t_h4s_ones_one,X25),happ(s(t_fun(X25,t_fun(t_h4s_ones_one,X25)),X28),s(X25,X29))),s(t_h4s_ones_one,X30)))=s(X25,X29)=>![X29]:![X8]:(![X11]:p(s(t_bool,h4s_quantheuristicss_guessu_u_exists(s(t_fun(t_h4s_ones_one,X25),happ(s(t_fun(X25,t_fun(t_h4s_ones_one,X25)),X28),s(X25,X29))),s(t_fun(X25,t_bool),happ(s(t_fun(X7,t_fun(X25,t_bool)),happ(s(t_fun(t_fun(X25,t_fun(X7,t_bool)),t_fun(X7,t_fun(X25,t_bool))),X27),s(t_fun(X25,t_fun(X7,t_bool)),X8))),s(X7,X11))))))=>p(s(t_bool,h4s_quantheuristicss_guessu_u_exists(s(t_fun(t_h4s_ones_one,X25),happ(s(t_fun(X25,t_fun(t_h4s_ones_one,X25)),X28),s(X25,X29))),s(t_fun(X25,t_bool),happ(s(t_fun(t_fun(X25,t_fun(X7,t_bool)),t_fun(X25,t_bool)),X26),s(t_fun(X25,t_fun(X7,t_bool)),X8)))))))))),file('i/f/quantHeuristics/GUESS__RULES__FORALL_c4', ch4s_quantHeuristicss_GUESSu_u_RULESu_u_FORALLu_c4)).
# SZS output end CNFRefutation
