# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:![X3]:![X4]:(~(p(s(t_bool,h4s_paths_every(s(t_fun(X1,t_bool),X4),s(t_h4s_paths_path(X1,X2),X3)))))<=>p(s(t_bool,h4s_paths_exists(s(t_fun(X1,t_bool),h4s_combins_o(s(t_fun(t_bool,t_bool),d_not),s(t_fun(X1,t_bool),X4))),s(t_h4s_paths_path(X1,X2),X3))))),file('i/f/path/not__every', ch4s_paths_notu_u_every)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/path/not__every', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/path/not__every', aHLu_FALSITY)).
fof(7, axiom,![X1]:![X2]:![X3]:![X4]:(p(s(t_bool,h4s_paths_every(s(t_fun(X1,t_bool),X4),s(t_h4s_paths_path(X1,X2),X3))))<=>~(p(s(t_bool,h4s_paths_exists(s(t_fun(X1,t_bool),h4s_combins_o(s(t_fun(t_bool,t_bool),d_not),s(t_fun(X1,t_bool),X4))),s(t_h4s_paths_path(X1,X2),X3)))))),file('i/f/path/not__every', ah4s_paths_everyu_u_def)).
fof(8, axiom,![X5]:(s(t_bool,X5)=s(t_bool,t)|s(t_bool,X5)=s(t_bool,f)),file('i/f/path/not__every', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
