# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:p(s(t_bool,h4s_bools_datatype(s(t_bool,happ(s(t_fun(t_h4s_prelims_ordering,t_bool),happ(s(t_fun(t_h4s_prelims_ordering,t_fun(t_h4s_prelims_ordering,t_bool)),happ(s(t_fun(t_h4s_prelims_ordering,t_fun(t_h4s_prelims_ordering,t_fun(t_h4s_prelims_ordering,t_bool))),X1),s(t_h4s_prelims_ordering,h4s_prelims_less))),s(t_h4s_prelims_ordering,h4s_prelims_equal))),s(t_h4s_prelims_ordering,h4s_prelims_greater)))))),file('i/f/prelim/datatype__ordering', ch4s_prelims_datatypeu_u_ordering)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/prelim/datatype__ordering', aHLu_TRUTH)).
fof(7, axiom,![X8]:![X7]:s(t_bool,h4s_bools_datatype(s(X8,X7)))=s(t_bool,t),file('i/f/prelim/datatype__ordering', ah4s_bools_DATATYPEu_u_TAGu_u_THM)).
# SZS output end CNFRefutation
