# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:p(s(t_bool,h4s_utilu_u_probs_countable(s(t_fun(X1,t_bool),h4s_predu_u_sets_empty)))),file('i/f/util_prob/COUNTABLE__EMPTY', ch4s_utilu_u_probs_COUNTABLEu_u_EMPTY)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/util_prob/COUNTABLE__EMPTY', aHLu_FALSITY)).
fof(18, axiom,![X1]:![X10]:(p(s(t_bool,h4s_predu_u_sets_finite(s(t_fun(X1,t_bool),X10))))=>p(s(t_bool,h4s_utilu_u_probs_countable(s(t_fun(X1,t_bool),X10))))),file('i/f/util_prob/COUNTABLE__EMPTY', ah4s_utilu_u_probs_FINITEu_u_COUNTABLE)).
fof(19, axiom,![X1]:p(s(t_bool,h4s_predu_u_sets_finite(s(t_fun(X1,t_bool),h4s_predu_u_sets_empty)))),file('i/f/util_prob/COUNTABLE__EMPTY', ah4s_predu_u_sets_FINITEu_u_EMPTY)).
fof(21, axiom,![X4]:(s(t_bool,X4)=s(t_bool,t)|s(t_bool,X4)=s(t_bool,f)),file('i/f/util_prob/COUNTABLE__EMPTY', aHLu_BOOLu_CASES)).
fof(22, axiom,p(s(t_bool,t)),file('i/f/util_prob/COUNTABLE__EMPTY', aHLu_TRUTH)).
fof(24, axiom,![X4]:(s(t_bool,X4)=s(t_bool,t)<=>p(s(t_bool,X4))),file('i/f/util_prob/COUNTABLE__EMPTY', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
