# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(~(s(t_fun(X1,t_bool),X2)=s(t_fun(X1,t_bool),h4s_predu_u_sets_empty))=>s(t_fun(X1,t_bool),h4s_predu_u_sets_insert(s(X1,h4s_predu_u_sets_choice(s(t_fun(X1,t_bool),X2))),s(t_fun(X1,t_bool),h4s_predu_u_sets_rest(s(t_fun(X1,t_bool),X2)))))=s(t_fun(X1,t_bool),X2)),file('i/f/pred_set/CHOICE__INSERT__REST', ch4s_predu_u_sets_CHOICEu_u_INSERTu_u_REST)).
fof(14, axiom,![X1]:![X2]:s(t_fun(X1,t_bool),h4s_predu_u_sets_rest(s(t_fun(X1,t_bool),X2)))=s(t_fun(X1,t_bool),h4s_predu_u_sets_delete(s(t_fun(X1,t_bool),X2),s(X1,h4s_predu_u_sets_choice(s(t_fun(X1,t_bool),X2))))),file('i/f/pred_set/CHOICE__INSERT__REST', ah4s_predu_u_sets_RESTu_u_DEF)).
fof(16, axiom,![X1]:![X2]:(~(s(t_fun(X1,t_bool),X2)=s(t_fun(X1,t_bool),h4s_predu_u_sets_empty))=>p(s(t_bool,h4s_bools_in(s(X1,h4s_predu_u_sets_choice(s(t_fun(X1,t_bool),X2))),s(t_fun(X1,t_bool),X2))))),file('i/f/pred_set/CHOICE__INSERT__REST', ah4s_predu_u_sets_CHOICEu_u_DEF)).
fof(43, axiom,![X1]:![X4]:![X2]:(p(s(t_bool,h4s_bools_in(s(X1,X4),s(t_fun(X1,t_bool),X2))))=>s(t_fun(X1,t_bool),h4s_predu_u_sets_insert(s(X1,X4),s(t_fun(X1,t_bool),h4s_predu_u_sets_delete(s(t_fun(X1,t_bool),X2),s(X1,X4)))))=s(t_fun(X1,t_bool),X2)),file('i/f/pred_set/CHOICE__INSERT__REST', ah4s_predu_u_sets_INSERTu_u_DELETE)).
# SZS output end CNFRefutation
