# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:((?[X7]:p(s(t_bool,h4s_predu_u_sets_bij(s(t_fun(X2,X1),X7),s(t_fun(X2,t_bool),X6),s(t_fun(X1,t_bool),X5))))&?[X8]:p(s(t_bool,h4s_predu_u_sets_bij(s(t_fun(X1,X3),X8),s(t_fun(X1,t_bool),X5),s(t_fun(X3,t_bool),X4)))))=>?[X9]:p(s(t_bool,h4s_predu_u_sets_bij(s(t_fun(X2,X3),X9),s(t_fun(X2,t_bool),X6),s(t_fun(X3,t_bool),X4))))),file('i/f/util_prob/BIJ__TRANS', ch4s_utilu_u_probs_BIJu_u_TRANS)).
fof(2, axiom,~(p(s(t_bool,f0))),file('i/f/util_prob/BIJ__TRANS', aHLu_FALSITY)).
fof(22, axiom,![X3]:![X2]:![X1]:![X4]:![X5]:![X6]:![X8]:![X7]:((p(s(t_bool,h4s_predu_u_sets_bij(s(t_fun(X2,X3),X7),s(t_fun(X2,t_bool),X6),s(t_fun(X3,t_bool),X5))))&p(s(t_bool,h4s_predu_u_sets_bij(s(t_fun(X3,X1),X8),s(t_fun(X3,t_bool),X5),s(t_fun(X1,t_bool),X4)))))=>p(s(t_bool,h4s_predu_u_sets_bij(s(t_fun(X2,X1),h4s_combins_o(s(t_fun(X3,X1),X8),s(t_fun(X2,X3),X7))),s(t_fun(X2,t_bool),X6),s(t_fun(X1,t_bool),X4))))),file('i/f/util_prob/BIJ__TRANS', ah4s_predu_u_sets_BIJu_u_COMPOSE)).
fof(24, axiom,![X5]:(s(t_bool,X5)=s(t_bool,t0)|s(t_bool,X5)=s(t_bool,f0)),file('i/f/util_prob/BIJ__TRANS', aHLu_BOOLu_CASES)).
fof(25, axiom,p(s(t_bool,t0)),file('i/f/util_prob/BIJ__TRANS', aHLu_TRUTH)).
fof(27, axiom,![X5]:(s(t_bool,X5)=s(t_bool,t0)<=>p(s(t_bool,X5))),file('i/f/util_prob/BIJ__TRANS', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
