# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:(?[X6]:(![X7]:(~(p(s(t_bool,happ(s(t_fun(X1,t_bool),happ(s(t_fun(X2,t_fun(X1,t_bool)),X5),s(X2,X6))),s(X1,X7)))))=>p(s(t_bool,happ(s(t_fun(X1,t_bool),X3),s(X1,X7)))))=>p(s(t_bool,happ(s(t_fun(X2,t_bool),X4),s(X2,X6)))))<=>(![X7]:(~(![X6]:p(s(t_bool,happ(s(t_fun(X1,t_bool),happ(s(t_fun(X2,t_fun(X1,t_bool)),X5),s(X2,X6))),s(X1,X7)))))=>p(s(t_bool,happ(s(t_fun(X1,t_bool),X3),s(X1,X7)))))=>?[X6]:p(s(t_bool,happ(s(t_fun(X2,t_bool),X4),s(X2,X6)))))),file('i/f/quantHeuristics/MOVE__EXISTS__IMP__THM', ch4s_quantHeuristicss_MOVEu_u_EXISTSu_u_IMPu_u_THM)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/quantHeuristics/MOVE__EXISTS__IMP__THM', aHLu_FALSITY)).
fof(30, axiom,![X10]:(s(t_bool,X10)=s(t_bool,t)|s(t_bool,X10)=s(t_bool,f)),file('i/f/quantHeuristics/MOVE__EXISTS__IMP__THM', aHLu_BOOLu_CASES)).
fof(31, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/MOVE__EXISTS__IMP__THM', aHLu_TRUTH)).
fof(33, axiom,![X10]:(s(t_bool,X10)=s(t_bool,t)<=>p(s(t_bool,X10))),file('i/f/quantHeuristics/MOVE__EXISTS__IMP__THM', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
