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