# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:(![X4]:~(s(t_h4s_sums_sum(X1,X2),X3)=s(t_h4s_sums_sum(X1,X2),h4s_sums_inl(s(X1,X4))))<=>p(s(t_bool,h4s_sums_isr(s(t_h4s_sums_sum(X1,X2),X3))))),file('i/f/quantHeuristics/INL__NEQ__ELIM_c0', ch4s_quantHeuristicss_INLu_u_NEQu_u_ELIMu_c0)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/INL__NEQ__ELIM_c0', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/quantHeuristics/INL__NEQ__ELIM_c0', aHLu_FALSITY)).
fof(10, axiom,![X7]:(s(t_bool,t)=s(t_bool,X7)<=>p(s(t_bool,X7))),file('i/f/quantHeuristics/INL__NEQ__ELIM_c0', ah4s_bools_EQu_u_CLAUSESu_c0)).
fof(12, axiom,![X7]:(s(t_bool,f)=s(t_bool,X7)<=>~(p(s(t_bool,X7)))),file('i/f/quantHeuristics/INL__NEQ__ELIM_c0', ah4s_bools_EQu_u_CLAUSESu_c2)).
fof(13, axiom,![X7]:(s(t_bool,X7)=s(t_bool,t)|s(t_bool,X7)=s(t_bool,f)),file('i/f/quantHeuristics/INL__NEQ__ELIM_c0', aHLu_BOOLu_CASES)).
fof(16, axiom,![X1]:![X2]:![X3]:p(s(t_bool,h4s_sums_isr(s(t_h4s_sums_sum(X1,X2),h4s_sums_inr(s(X2,X3)))))),file('i/f/quantHeuristics/INL__NEQ__ELIM_c0', ah4s_sums_ISR0u_c0)).
fof(17, axiom,![X2]:![X1]:![X8]:~(p(s(t_bool,h4s_sums_isr(s(t_h4s_sums_sum(X1,X2),h4s_sums_inl(s(X1,X8))))))),file('i/f/quantHeuristics/INL__NEQ__ELIM_c0', ah4s_sums_ISR0u_c1)).
fof(18, axiom,![X1]:![X2]:![X9]:(?[X3]:s(t_h4s_sums_sum(X1,X2),X9)=s(t_h4s_sums_sum(X1,X2),h4s_sums_inl(s(X1,X3)))|?[X8]:s(t_h4s_sums_sum(X1,X2),X9)=s(t_h4s_sums_sum(X1,X2),h4s_sums_inr(s(X2,X8)))),file('i/f/quantHeuristics/INL__NEQ__ELIM_c0', ah4s_sums_sumu_u_CASES)).
# SZS output end CNFRefutation
