# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:(s(t_h4s_integers_int,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,X1)))))))=s(t_h4s_integers_int,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,h4s_nums_0)))<=>p(s(t_bool,f))),file('i/f/integer/INT__EQ__REDUCE_c5', ch4s_integers_INTu_u_EQu_u_REDUCEu_c5)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/integer/INT__EQ__REDUCE_c5', aHLu_FALSITY)).
fof(4, axiom,![X1]:(s(t_h4s_integers_int,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,h4s_nums_0)))=s(t_h4s_integers_int,h4s_integers_intu_u_ofu_u_num(s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,h4s_arithmetics_bit1(s(t_h4s_nums_num,X1)))))))<=>p(s(t_bool,f))),file('i/f/integer/INT__EQ__REDUCE_c5', ah4s_integers_INTu_u_EQu_u_REDUCEu_c1)).
fof(50, axiom,![X3]:s(t_h4s_nums_num,h4s_arithmetics_numeral(s(t_h4s_nums_num,X3)))=s(t_h4s_nums_num,X3),file('i/f/integer/INT__EQ__REDUCE_c5', ah4s_arithmetics_NUMERALu_u_DEF)).
# SZS output end CNFRefutation
