# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:((p(s(t_bool,h4s_predu_u_sets_subset(s(t_fun(X1,t_bool),X3),s(t_fun(X1,t_bool),X2))))&p(s(t_bool,h4s_utilu_u_probs_countable(s(t_fun(X1,t_bool),X2)))))=>p(s(t_bool,h4s_utilu_u_probs_countable(s(t_fun(X1,t_bool),X3))))),file('i/f/util_prob/COUNTABLE__SUBSET', ch4s_utilu_u_probs_COUNTABLEu_u_SUBSET)).
fof(2, axiom,![X4]:![X5]:((p(s(t_bool,X5))=>p(s(t_bool,X4)))=>((p(s(t_bool,X4))=>p(s(t_bool,X5)))=>s(t_bool,X5)=s(t_bool,X4))),file('i/f/util_prob/COUNTABLE__SUBSET', ah4s_bools_IMPu_u_ANTISYMu_u_AX)).
fof(14, axiom,![X1]:![X3]:(p(s(t_bool,h4s_utilu_u_probs_countable(s(t_fun(X1,t_bool),X3))))<=>?[X16]:![X12]:(p(s(t_bool,h4s_bools_in(s(X1,X12),s(t_fun(X1,t_bool),X3))))=>?[X17]:s(X1,happ(s(t_fun(t_h4s_nums_num,X1),X16),s(t_h4s_nums_num,X17)))=s(X1,X12))),file('i/f/util_prob/COUNTABLE__SUBSET', ah4s_utilu_u_probs_countableu_u_def)).
fof(20, axiom,![X1]:![X2]:![X3]:(p(s(t_bool,h4s_predu_u_sets_subset(s(t_fun(X1,t_bool),X3),s(t_fun(X1,t_bool),X2))))<=>![X12]:(p(s(t_bool,h4s_bools_in(s(X1,X12),s(t_fun(X1,t_bool),X3))))=>p(s(t_bool,h4s_bools_in(s(X1,X12),s(t_fun(X1,t_bool),X2)))))),file('i/f/util_prob/COUNTABLE__SUBSET', ah4s_predu_u_sets_SUBSETu_u_DEF)).
# SZS output end CNFRefutation
