# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N
# and selection function SelectUnlessUniqMax.
#
# Preprocessing time       : 0.019 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t13_classes4, axiom, ![X1]:((v1_classes4(X1)&v3_classes4(X1))=>((![X2, X3]:(m1_subset_1(X3,k1_zfmisc_1(X2))=>(r2_tarski(X2,X1)=>r2_tarski(X3,X1)))&![X2, X3]:((r1_tarski(X2,X3)&r2_tarski(X3,X1))=>r2_tarski(X2,X1)))&(~(v1_xboole_0(X1))=>r2_tarski(k11_arytm_3,X1)))), file('classes5/classes5__t69_classes5', t13_classes4)).
fof(t5_classes5, axiom, ![X1]:(~(v1_xboole_0(X1))=>![X2]:(~(v1_xboole_0(X2))=>![X3]:(m1_subset_1(X3,X2)=>r1_tarski(k2_zfmisc_1(X1,k1_tarski(X3)),k3_tarski(k9_funct_2(X1,X2)))))), file('classes5/classes5__t69_classes5', t5_classes5)).
fof(t59_classes2, axiom, ![X1, X2]:((~(v1_xboole_0(X2))&v1_classes2(X2))=>(r2_tarski(X1,X2)=>((r2_tarski(k9_setfam_1(X1),X2)&r2_tarski(k3_tarski(X1),X2))&r2_tarski(k1_setfam_1(X1),X2)))), file('classes5/classes5__t69_classes5', t59_classes2)).
fof(t7_boole, axiom, ![X1, X2]:~((r2_tarski(X1,X2)&v1_xboole_0(X2))), file('classes5/classes5__t69_classes5', t7_boole)).
fof(t69_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(~(v1_xboole_0(X2))=>![X3]:(~(v1_xboole_0(X3))=>(m1_subset_1(k9_funct_2(X2,X3),X1)=>m1_subset_1(X2,X1))))), file('classes5/classes5__t69_classes5', t69_classes5)).
fof(t40_classes4, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(~(v1_xboole_0(X2))=>![X3]:(~(v1_xboole_0(X3))=>(m1_subset_1(k2_zfmisc_1(X2,X3),X1)=>(m1_subset_1(X2,X1)&m1_subset_1(X3,X1)))))), file('classes5/classes5__t69_classes5', t40_classes4)).
fof(t2_subset, axiom, ![X1, X2]:(m1_subset_1(X1,X2)=>(v1_xboole_0(X2)|r2_tarski(X1,X2))), file('classes5/classes5__t69_classes5', t2_subset)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('classes5/classes5__t69_classes5', t1_subset)).
fof(fc2_xboole_0, axiom, ![X1]:~(v1_xboole_0(k1_tarski(X1))), file('classes5/classes5__t69_classes5', fc2_xboole_0)).
fof(cc2_classes4, axiom, ![X1]:(((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))=>(((((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))&v1_classes4(X1))&v2_classes4(X1))&v3_classes4(X1))), file('classes5/classes5__t69_classes5', cc2_classes4)).
fof(cc6_classes3, axiom, ![X1]:(v1_classes2(X1)=>((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))), file('classes5/classes5__t69_classes5', cc6_classes3)).
fof(dt_o_1_4_classes5, axiom, ![X1]:(~(v1_xboole_0(X1))=>m1_subset_1(o_1_4_classes5(X1),X1)), file('classes5/classes5__t69_classes5', dt_o_1_4_classes5)).
fof(c_0_12, plain, ![X1]:((v1_classes4(X1)&v3_classes4(X1))=>((![X2, X3]:(m1_subset_1(X3,k1_zfmisc_1(X2))=>(r2_tarski(X2,X1)=>r2_tarski(X3,X1)))&![X2, X3]:((r1_tarski(X2,X3)&r2_tarski(X3,X1))=>r2_tarski(X2,X1)))&(~v1_xboole_0(X1)=>r2_tarski(k11_arytm_3,X1)))), inference(fof_simplification,[status(thm)],[t13_classes4])).
fof(c_0_13, plain, ![X1]:(~v1_xboole_0(X1)=>![X2]:(~v1_xboole_0(X2)=>![X3]:(m1_subset_1(X3,X2)=>r1_tarski(k2_zfmisc_1(X1,k1_tarski(X3)),k3_tarski(k9_funct_2(X1,X2)))))), inference(fof_simplification,[status(thm)],[t5_classes5])).
fof(c_0_14, plain, ![X1, X2]:((~v1_xboole_0(X2)&v1_classes2(X2))=>(r2_tarski(X1,X2)=>((r2_tarski(k9_setfam_1(X1),X2)&r2_tarski(k3_tarski(X1),X2))&r2_tarski(k1_setfam_1(X1),X2)))), inference(fof_simplification,[status(thm)],[t59_classes2])).
fof(c_0_15, plain, ![X37, X38, X39, X40, X41]:(((~m1_subset_1(X39,k1_zfmisc_1(X38))|(~r2_tarski(X38,X37)|r2_tarski(X39,X37))|(~v1_classes4(X37)|~v3_classes4(X37)))&(~r1_tarski(X40,X41)|~r2_tarski(X41,X37)|r2_tarski(X40,X37)|(~v1_classes4(X37)|~v3_classes4(X37))))&(v1_xboole_0(X37)|r2_tarski(k11_arytm_3,X37)|(~v1_classes4(X37)|~v3_classes4(X37)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])).
fof(c_0_16, plain, ![X51, X52, X53]:(v1_xboole_0(X51)|(v1_xboole_0(X52)|(~m1_subset_1(X53,X52)|r1_tarski(k2_zfmisc_1(X51,k1_tarski(X53)),k3_tarski(k9_funct_2(X51,X52)))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
fof(c_0_17, plain, ![X49, X50]:(((r2_tarski(k9_setfam_1(X49),X50)|~r2_tarski(X49,X50)|(v1_xboole_0(X50)|~v1_classes2(X50)))&(r2_tarski(k3_tarski(X49),X50)|~r2_tarski(X49,X50)|(v1_xboole_0(X50)|~v1_classes2(X50))))&(r2_tarski(k1_setfam_1(X49),X50)|~r2_tarski(X49,X50)|(v1_xboole_0(X50)|~v1_classes2(X50)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])).
fof(c_0_18, plain, ![X54, X55]:(~r2_tarski(X54,X55)|~v1_xboole_0(X55)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])).
fof(c_0_19, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(~v1_xboole_0(X2)=>![X3]:(~v1_xboole_0(X3)=>(m1_subset_1(k9_funct_2(X2,X3),X1)=>m1_subset_1(X2,X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t69_classes5])])).
fof(c_0_20, plain, ![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(~v1_xboole_0(X2)=>![X3]:(~v1_xboole_0(X3)=>(m1_subset_1(k2_zfmisc_1(X2,X3),X1)=>(m1_subset_1(X2,X1)&m1_subset_1(X3,X1)))))), inference(fof_simplification,[status(thm)],[t40_classes4])).
cnf(c_0_21, plain, (r2_tarski(X1,X3)|~r1_tarski(X1,X2)|~r2_tarski(X2,X3)|~v1_classes4(X3)|~v3_classes4(X3)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_22, plain, (v1_xboole_0(X1)|v1_xboole_0(X2)|r1_tarski(k2_zfmisc_1(X1,k1_tarski(X3)),k3_tarski(k9_funct_2(X1,X2)))|~m1_subset_1(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_23, plain, (r2_tarski(k3_tarski(X1),X2)|v1_xboole_0(X2)|~r2_tarski(X1,X2)|~v1_classes2(X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_24, plain, (~r2_tarski(X1,X2)|~v1_xboole_0(X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
fof(c_0_25, plain, ![X44, X45]:(~m1_subset_1(X44,X45)|(v1_xboole_0(X45)|r2_tarski(X44,X45))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])).
fof(c_0_26, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&(~v1_xboole_0(esk2_0)&(~v1_xboole_0(esk3_0)&(m1_subset_1(k9_funct_2(esk2_0,esk3_0),esk1_0)&~m1_subset_1(esk2_0,esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])).
fof(c_0_27, plain, ![X46, X47, X48]:((m1_subset_1(X47,X46)|~m1_subset_1(k2_zfmisc_1(X47,X48),X46)|v1_xboole_0(X48)|v1_xboole_0(X47)|(v1_xboole_0(X46)|~v1_classes2(X46)))&(m1_subset_1(X48,X46)|~m1_subset_1(k2_zfmisc_1(X47,X48),X46)|v1_xboole_0(X48)|v1_xboole_0(X47)|(v1_xboole_0(X46)|~v1_classes2(X46)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])).
fof(c_0_28, plain, ![X42, X43]:(~r2_tarski(X42,X43)|m1_subset_1(X42,X43)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
cnf(c_0_29, plain, (r2_tarski(k2_zfmisc_1(X1,k1_tarski(X2)),X3)|v1_xboole_0(X1)|v1_xboole_0(X4)|~r2_tarski(k3_tarski(k9_funct_2(X1,X4)),X3)|~v3_classes4(X3)|~v1_classes4(X3)|~m1_subset_1(X2,X4)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_30, plain, (r2_tarski(k3_tarski(X1),X2)|~r2_tarski(X1,X2)|~v1_classes2(X2)), inference(csr,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_31, plain, (v1_xboole_0(X2)|r2_tarski(X1,X2)|~m1_subset_1(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_32, negated_conjecture, (m1_subset_1(k9_funct_2(esk2_0,esk3_0),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_33, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
fof(c_0_34, plain, ![X1]:~v1_xboole_0(k1_tarski(X1)), inference(fof_simplification,[status(thm)],[fc2_xboole_0])).
cnf(c_0_35, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X3)|v1_xboole_0(X1)|v1_xboole_0(X2)|~m1_subset_1(k2_zfmisc_1(X1,X3),X2)|~v1_classes2(X2)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_36, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_37, plain, (r2_tarski(k2_zfmisc_1(X1,k1_tarski(X2)),X3)|v1_xboole_0(X4)|v1_xboole_0(X1)|~r2_tarski(k9_funct_2(X1,X4),X3)|~v3_classes4(X3)|~v1_classes4(X3)|~m1_subset_1(X2,X4)|~v1_classes2(X3)), inference(spm,[status(thm)],[c_0_29, c_0_30])).
cnf(c_0_38, negated_conjecture, (r2_tarski(k9_funct_2(esk2_0,esk3_0),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_33])).
cnf(c_0_39, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_40, negated_conjecture, (~v1_xboole_0(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_41, negated_conjecture, (~v1_xboole_0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
fof(c_0_42, plain, ![X36]:~v1_xboole_0(k1_tarski(X36)), inference(variable_rename,[status(thm)],[c_0_34])).
cnf(c_0_43, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X1)|v1_xboole_0(X3)|~r2_tarski(k2_zfmisc_1(X1,X3),X2)|~v1_classes2(X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_24])).
cnf(c_0_44, negated_conjecture, (r2_tarski(k2_zfmisc_1(esk2_0,k1_tarski(X1)),esk1_0)|~v3_classes4(esk1_0)|~v1_classes4(esk1_0)|~m1_subset_1(X1,esk3_0)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_39])]), c_0_40]), c_0_41])).
cnf(c_0_45, negated_conjecture, (~m1_subset_1(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_46, plain, (~v1_xboole_0(k1_tarski(X1))), inference(split_conjunct,[status(thm)],[c_0_42])).
fof(c_0_47, plain, ![X33]:((((((v1_ordinal1(X33)|(~v1_ordinal1(X33)|~v1_classes3(X33)|~v3_classes3(X33)))&(v1_classes3(X33)|(~v1_ordinal1(X33)|~v1_classes3(X33)|~v3_classes3(X33))))&(v3_classes3(X33)|(~v1_ordinal1(X33)|~v1_classes3(X33)|~v3_classes3(X33))))&(v1_classes4(X33)|(~v1_ordinal1(X33)|~v1_classes3(X33)|~v3_classes3(X33))))&(v2_classes4(X33)|(~v1_ordinal1(X33)|~v1_classes3(X33)|~v3_classes3(X33))))&(v3_classes4(X33)|(~v1_ordinal1(X33)|~v1_classes3(X33)|~v3_classes3(X33)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_classes4])])])).
cnf(c_0_48, negated_conjecture, (~v3_classes4(esk1_0)|~v1_classes4(esk1_0)|~m1_subset_1(X1,esk3_0)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_39])]), c_0_45]), c_0_41]), c_0_46])).
cnf(c_0_49, plain, (v3_classes4(X1)|~v1_ordinal1(X1)|~v1_classes3(X1)|~v3_classes3(X1)), inference(split_conjunct,[status(thm)],[c_0_47])).
cnf(c_0_50, plain, (v1_classes4(X1)|~v1_ordinal1(X1)|~v1_classes3(X1)|~v3_classes3(X1)), inference(split_conjunct,[status(thm)],[c_0_47])).
fof(c_0_51, plain, ![X34]:(((v1_ordinal1(X34)|~v1_classes2(X34))&(v1_classes3(X34)|~v1_classes2(X34)))&(v3_classes3(X34)|~v1_classes2(X34))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc6_classes3])])])).
cnf(c_0_52, negated_conjecture, (~v3_classes3(esk1_0)|~v1_classes3(esk1_0)|~v1_ordinal1(esk1_0)|~m1_subset_1(X1,esk3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_49]), c_0_50])).
cnf(c_0_53, plain, (v3_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_51])).
cnf(c_0_54, negated_conjecture, (~v1_classes3(esk1_0)|~v1_ordinal1(esk1_0)|~m1_subset_1(X1,esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_39])])).
cnf(c_0_55, plain, (v1_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_51])).
fof(c_0_56, plain, ![X1]:(~v1_xboole_0(X1)=>m1_subset_1(o_1_4_classes5(X1),X1)), inference(fof_simplification,[status(thm)],[dt_o_1_4_classes5])).
cnf(c_0_57, negated_conjecture, (~v1_ordinal1(esk1_0)|~m1_subset_1(X1,esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_55]), c_0_39])])).
cnf(c_0_58, plain, (v1_ordinal1(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_51])).
fof(c_0_59, plain, ![X35]:(v1_xboole_0(X35)|m1_subset_1(o_1_4_classes5(X35),X35)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_56])])).
cnf(c_0_60, negated_conjecture, (~m1_subset_1(X1,esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57, c_0_58]), c_0_39])])).
cnf(c_0_61, plain, (v1_xboole_0(X1)|m1_subset_1(o_1_4_classes5(X1),X1)), inference(split_conjunct,[status(thm)],[c_0_59])).
cnf(c_0_62, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60, c_0_61]), c_0_40]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 63
# Proof object clause steps            : 32
# Proof object formula steps           : 31
# Proof object conjectures             : 17
# Proof object clause conjectures      : 14
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 20
# Proof object initial formulas used   : 12
# Proof object generating inferences   : 11
# Proof object simplifying inferences  : 20
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 12
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 29
# Removed in clause preprocessing      : 3
# Initial clauses in saturation        : 26
# Processed clauses                    : 155
# ...of these trivial                  : 0
# ...subsumed                          : 15
# ...remaining for further processing  : 140
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 3
# Backward-rewritten                   : 0
# Generated clauses                    : 857
# ...of the previous two non-trivial   : 853
# Contextual simplify-reflections      : 9
# Paramodulations                      : 857
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 0
# Propositional unsat checks           : 0
#    Propositional check models        : 0
#    Propositional check unsatisfiable : 0
#    Propositional clauses             : 0
#    Propositional clauses after purity: 0
#    Propositional unsat core size     : 0
#    Propositional preprocessing time  : 0.000
#    Propositional encoding time       : 0.000
#    Propositional solver time         : 0.000
#    Success case prop preproc time    : 0.000
#    Success case prop encoding time   : 0.000
#    Success case prop solver time     : 0.000
# Current number of processed clauses  : 111
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 7
#    Non-unit-clauses                  : 100
# Current number of unprocessed clauses: 749
# ...number of literals in the above   : 6751
# Current number of archived formulas  : 0
# Current number of archived clauses   : 29
# Clause-clause subsumption calls (NU) : 4045
# Rec. Clause-clause subsumption calls : 790
# Non-unit clause-clause subsumptions  : 25
# Unit Clause-clause subsumption calls : 12
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 0
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 27434

# -------------------------------------------------
# User time                : 0.032 s
# System time              : 0.007 s
# Total time               : 0.039 s
# Maximum resident set size: 3580 pages
