# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:(p(s(t_bool,h4s_quantheuristicss_isu_u_removableu_u_quantu_u_fun(s(t_fun(X1,X2),X3))))=>(?[X5]:p(s(t_bool,happ(s(t_fun(X2,t_bool),X4),s(X2,happ(s(t_fun(X1,X2),X3),s(X1,X5))))))<=>?[X6]:p(s(t_bool,happ(s(t_fun(X2,t_bool),X4),s(X2,X6)))))),file('i/f/quantHeuristics/IS__REMOVABLE__QUANT__FUN______EXISTS__THM', ch4s_quantHeuristicss_ISu_u_REMOVABLEu_u_QUANTu_u_FUNu_u_u_u_u_u_EXISTSu_u_THM)).
fof(2, axiom,~(p(s(t_bool,f0))),file('i/f/quantHeuristics/IS__REMOVABLE__QUANT__FUN______EXISTS__THM', aHLu_FALSITY)).
fof(19, axiom,![X1]:![X5]:s(t_bool,d_exists(s(t_fun(X1,t_bool),X5)))=s(t_bool,happ(s(t_fun(X1,t_bool),X5),s(X1,h4s_mins_u_40(s(t_fun(X1,t_bool),X5))))),file('i/f/quantHeuristics/IS__REMOVABLE__QUANT__FUN______EXISTS__THM', ah4s_bools_EXISTSu_u_DEF)).
fof(20, axiom,![X1]:![X5]:![X4]:(p(s(t_bool,happ(s(t_fun(X1,t_bool),X4),s(X1,X5))))=>p(s(t_bool,happ(s(t_fun(X1,t_bool),X4),s(X1,h4s_mins_u_40(s(t_fun(X1,t_bool),X4))))))),file('i/f/quantHeuristics/IS__REMOVABLE__QUANT__FUN______EXISTS__THM', ah4s_bools_SELECTu_u_AX)).
fof(21, axiom,![X1]:![X2]:![X3]:(p(s(t_bool,h4s_quantheuristicss_isu_u_removableu_u_quantu_u_fun(s(t_fun(X1,X2),X3))))<=>![X18]:?[X5]:s(X2,happ(s(t_fun(X1,X2),X3),s(X1,X5)))=s(X2,X18)),file('i/f/quantHeuristics/IS__REMOVABLE__QUANT__FUN______EXISTS__THM', ah4s_quantHeuristicss_ISu_u_REMOVABLEu_u_QUANTu_u_FUNu_u_def)).
fof(22, axiom,![X9]:(s(t_bool,X9)=s(t_bool,t)|s(t_bool,X9)=s(t_bool,f0)),file('i/f/quantHeuristics/IS__REMOVABLE__QUANT__FUN______EXISTS__THM', aHLu_BOOLu_CASES)).
fof(23, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/IS__REMOVABLE__QUANT__FUN______EXISTS__THM', aHLu_TRUTH)).
fof(25, axiom,![X9]:(s(t_bool,X9)=s(t_bool,t)<=>p(s(t_bool,X9))),file('i/f/quantHeuristics/IS__REMOVABLE__QUANT__FUN______EXISTS__THM', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
