# SZS status Theorem
# SZS status Theorem
# SZS output start CNFRefutation.
fof(1, conjecture,![X1]:![X2]:p(s(t_bool,h4s_relations_transitive(s(t_fun(X1,t_fun(X1,t_bool)),h4s_relations_eqc(s(t_fun(X1,t_fun(X1,t_bool)),X2)))))),file('i/f/relation/transitive__EQC', ch4s_relations_transitiveu_u_EQC)).
fof(58, axiom,![X1]:![X2]:(p(s(t_bool,h4s_relations_equivalence(s(t_fun(X1,t_fun(X1,t_bool)),X2))))<=>(p(s(t_bool,h4s_relations_reflexive(s(t_fun(X1,t_fun(X1,t_bool)),X2))))&(p(s(t_bool,h4s_relations_symmetric(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/relation/transitive__EQC', ah4s_relations_equivalenceu_u_def)).
fof(65, axiom,![X1]:![X2]:p(s(t_bool,h4s_relations_equivalence(s(t_fun(X1,t_fun(X1,t_bool)),h4s_relations_eqc(s(t_fun(X1,t_fun(X1,t_bool)),X2)))))),file('i/f/relation/transitive__EQC', ah4s_relations_EQCu_u_EQUIVALENCE)).
# SZS output end CNFRefutation
