# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),h4s_bits_bit(s(t_h4s_nums_num,h4s_nums_0))),s(t_h4s_nums_num,h4s_arithmetics_u_2b(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X1))))))<=>~(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),h4s_bits_bit(s(t_h4s_nums_num,h4s_nums_0))),s(t_h4s_nums_num,X2)))=s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),h4s_bits_bit(s(t_h4s_nums_num,h4s_nums_0))),s(t_h4s_nums_num,X1))))),file('i/f/bit/ADD__BIT0', ch4s_bits_ADDu_u_BIT0)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/bit/ADD__BIT0', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/bit/ADD__BIT0', aHLu_FALSITY)).
fof(4, axiom,![X3]:(s(t_bool,X3)=s(t_bool,t)|s(t_bool,X3)=s(t_bool,f)),file('i/f/bit/ADD__BIT0', aHLu_BOOLu_CASES)).
fof(7, axiom,![X1]:![X2]:(p(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),h4s_arithmetics_odd),s(t_h4s_nums_num,h4s_arithmetics_u_2b(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X1))))))<=>~(s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),h4s_arithmetics_odd),s(t_h4s_nums_num,X2)))=s(t_bool,happ(s(t_fun(t_h4s_nums_num,t_bool),h4s_arithmetics_odd),s(t_h4s_nums_num,X1))))),file('i/f/bit/ADD__BIT0', ah4s_arithmetics_ODDu_u_ADD)).
fof(8, axiom,s(t_fun(t_h4s_nums_num,t_bool),h4s_bits_bit(s(t_h4s_nums_num,h4s_nums_0)))=s(t_fun(t_h4s_nums_num,t_bool),h4s_arithmetics_odd),file('i/f/bit/ADD__BIT0', ah4s_bits_BIT0u_u_ODD)).
# SZS output end CNFRefutation
