# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:((p(s(t_bool,h4s_gcds_isu_u_gcd(s(t_h4s_nums_num,X4),s(t_h4s_nums_num,X3),s(t_h4s_nums_num,X2))))&p(s(t_bool,h4s_gcds_isu_u_gcd(s(t_h4s_nums_num,X4),s(t_h4s_nums_num,X3),s(t_h4s_nums_num,X1)))))=>s(t_h4s_nums_num,X2)=s(t_h4s_nums_num,X1)),file('i/f/gcd/IS__GCD__UNIQUE', ch4s_gcds_ISu_u_GCDu_u_UNIQUE)).
fof(2, axiom,~(p(s(t_bool,f))),file('i/f/gcd/IS__GCD__UNIQUE', aHLu_FALSITY)).
fof(30, axiom,![X3]:![X4]:((p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X4),s(t_h4s_nums_num,X3))))&p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X3),s(t_h4s_nums_num,X4)))))=>s(t_h4s_nums_num,X4)=s(t_h4s_nums_num,X3)),file('i/f/gcd/IS__GCD__UNIQUE', ah4s_dividess_DIVIDESu_u_ANTISYM)).
fof(31, axiom,![X2]:![X3]:![X4]:(p(s(t_bool,h4s_gcds_isu_u_gcd(s(t_h4s_nums_num,X4),s(t_h4s_nums_num,X3),s(t_h4s_nums_num,X2))))<=>(p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X4))))&(p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X2),s(t_h4s_nums_num,X3))))&![X1]:((p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X4))))&p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X3)))))=>p(s(t_bool,h4s_dividess_divides(s(t_h4s_nums_num,X1),s(t_h4s_nums_num,X2)))))))),file('i/f/gcd/IS__GCD__UNIQUE', ah4s_gcds_isu_u_gcdu_u_def)).
fof(32, axiom,![X13]:(s(t_bool,X13)=s(t_bool,t)|s(t_bool,X13)=s(t_bool,f)),file('i/f/gcd/IS__GCD__UNIQUE', aHLu_BOOLu_CASES)).
fof(33, axiom,p(s(t_bool,t)),file('i/f/gcd/IS__GCD__UNIQUE', aHLu_TRUTH)).
fof(35, axiom,![X13]:(s(t_bool,X13)=s(t_bool,t)<=>p(s(t_bool,X13))),file('i/f/gcd/IS__GCD__UNIQUE', ah4s_bools_EQu_u_CLAUSESu_c1)).
# SZS output end CNFRefutation
