# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:(p(s(t_bool,h4s_relations_strongorder(s(t_fun(X1,t_fun(X1,t_bool)),X2))))<=>(p(s(t_bool,h4s_relations_irreflexive(s(t_fun(X1,t_fun(X1,t_bool)),X2))))&p(s(t_bool,h4s_relations_transitive(s(t_fun(X1,t_fun(X1,t_bool)),X2)))))),file('i/f/toto/StrongOrder__ALT', ch4s_totos_StrongOrderu_u_ALT)).
fof(2, axiom,p(s(t_bool,t)),file('i/f/toto/StrongOrder__ALT', aHLu_TRUTH)).
fof(3, axiom,~(p(s(t_bool,f))),file('i/f/toto/StrongOrder__ALT', aHLu_FALSITY)).
fof(6, axiom,![X4]:![X2]:(p(s(t_bool,h4s_relations_strongorder(s(t_fun(X4,t_fun(X4,t_bool)),X2))))<=>(p(s(t_bool,h4s_relations_irreflexive(s(t_fun(X4,t_fun(X4,t_bool)),X2))))&p(s(t_bool,h4s_relations_transitive(s(t_fun(X4,t_fun(X4,t_bool)),X2)))))),file('i/f/toto/StrongOrder__ALT', ah4s_relations_StrongOrder0)).
fof(7, axiom,![X5]:(s(t_bool,X5)=s(t_bool,t)|s(t_bool,X5)=s(t_bool,f)),file('i/f/toto/StrongOrder__ALT', aHLu_BOOLu_CASES)).
# SZS output end CNFRefutation
