# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:?[X7]:((p(s(t_bool,X7))<=>s(X2,X4)=s(X2,X6))&s(X1,happ(s(t_fun(X2,X1),happ(s(t_fun(t_fun(X2,X1),t_fun(X2,X1)),h4s_combins_update(s(X2,X4),s(X1,X3))),s(t_fun(X2,X1),X5))),s(X2,X6)))=s(X1,h4s_bools_cond(s(t_bool,X7),s(X1,X3),s(X1,happ(s(t_fun(X2,X1),X5),s(X2,X6)))))),file('i/f/update/UPDATE__def', ch4s_updates_UPDATEu_u_def)).
fof(58, axiom,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:?[X7]:((p(s(t_bool,X7))<=>s(X2,X4)=s(X2,X6))&s(X1,happ(s(t_fun(X2,X1),happ(s(t_fun(t_fun(X2,X1),t_fun(X2,X1)),h4s_combins_update(s(X2,X4),s(X1,X3))),s(t_fun(X2,X1),X5))),s(X2,X6)))=s(X1,h4s_bools_cond(s(t_bool,X7),s(X1,X3),s(X1,happ(s(t_fun(X2,X1),X5),s(X2,X6)))))),file('i/f/update/UPDATE__def', ah4s_combins_UPDATEu_u_def)).
fof(66, axiom,p(s(t_bool,t)),file('i/f/update/UPDATE__def', aHLu_TRUTH)).
fof(67, axiom,~(p(s(t_bool,f))),file('i/f/update/UPDATE__def', aHLu_FALSITY)).
fof(68, axiom,![X12]:(s(t_bool,X12)=s(t_bool,t)|s(t_bool,X12)=s(t_bool,f)),file('i/f/update/UPDATE__def', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
