# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3eu_3d(s(t_h4s_nums_num,h4s_nums_0),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__0_c4', ch4s_quantHeuristicss_LISTu_u_LENGTHu_u_0u_c4)).
fof(26, axiom,![X1]:![X2]:(p(s(t_bool,h4s_arithmetics_u_3eu_3d(s(t_h4s_nums_num,h4s_nums_0),s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2))))))<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__0_c4', ah4s_quantHeuristicss_LISTu_u_LENGTHu_u_COMPAREu_u_1u_c2)).
fof(27, axiom,![X1]:![X2]:(s(t_h4s_nums_num,h4s_lists_length(s(t_h4s_lists_list(X1),X2)))=s(t_h4s_nums_num,h4s_nums_0)<=>s(t_h4s_lists_list(X1),X2)=s(t_h4s_lists_list(X1),h4s_lists_nil)),file('i/f/quantHeuristics/LIST__LENGTH__0_c4', ah4s_lists_LENGTHu_u_NIL)).
fof(38, axiom,p(s(t_bool,t)),file('i/f/quantHeuristics/LIST__LENGTH__0_c4', aHLu_TRUTH)).
fof(77, axiom,![X22]:s(t_bool,h4s_arithmetics_u_3eu_3d(s(t_h4s_nums_num,X22),s(t_h4s_nums_num,h4s_nums_0)))=s(t_bool,t),file('i/f/quantHeuristics/LIST__LENGTH__0_c4', ah4s_numerals_numeralu_u_distribu_c29)).
# SZS output end CNFRefutation
