# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(p(s(t_bool,h4s_integers_intu_u_divides(s(t_h4s_integers_int,X3),s(t_h4s_integers_int,X2))))=>s(t_bool,h4s_integers_intu_u_divides(s(t_h4s_integers_int,X3),s(t_h4s_integers_int,h4s_integers_intu_u_add(s(t_h4s_integers_int,X1),s(t_h4s_integers_int,X2)))))=s(t_bool,h4s_integers_intu_u_divides(s(t_h4s_integers_int,X3),s(t_h4s_integers_int,X1)))),file('i/f/integer/INT__DIVIDES__RADD', ch4s_integers_INTu_u_DIVIDESu_u_RADD)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/integer/INT__DIVIDES__RADD', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/integer/INT__DIVIDES__RADD', aHLu_FALSITY)).
fof(4, axiom,![X4]:(s(t_bool,X4)=s(t_bool,t)|s(t_bool,X4)=s(t_bool,f)),file('i/f/integer/INT__DIVIDES__RADD', aHLu_BOOLu_CASES)).
fof(5, axiom,![X5]:![X6]:s(t_h4s_integers_int,h4s_integers_intu_u_add(s(t_h4s_integers_int,X6),s(t_h4s_integers_int,X5)))=s(t_h4s_integers_int,h4s_integers_intu_u_add(s(t_h4s_integers_int,X5),s(t_h4s_integers_int,X6))),file('i/f/integer/INT__DIVIDES__RADD', ah4s_integers_INTu_u_ADDu_u_COMM)).
fof(6, axiom,![X1]:![X2]:![X3]:(p(s(t_bool,h4s_integers_intu_u_divides(s(t_h4s_integers_int,X3),s(t_h4s_integers_int,X2))))=>s(t_bool,h4s_integers_intu_u_divides(s(t_h4s_integers_int,X3),s(t_h4s_integers_int,h4s_integers_intu_u_add(s(t_h4s_integers_int,X2),s(t_h4s_integers_int,X1)))))=s(t_bool,h4s_integers_intu_u_divides(s(t_h4s_integers_int,X3),s(t_h4s_integers_int,X1)))),file('i/f/integer/INT__DIVIDES__RADD', ah4s_integers_INTu_u_DIVIDESu_u_LADD)).
# SZS output end CNFRefutation
