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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t15_classes5, conjecture, ![X1]:(m1_subset_1(X1,k1_zfmisc_1(k13_classes2))=>(v1_finset_1(X1)=>m1_subset_1(X1,k13_classes2))), file('classes5/classes5__t15_classes5', t15_classes5)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('classes5/classes5__t15_classes5', t3_subset)).
fof(d15_card_3, axiom, ![X1]:(v5_card_3(X1)<=>k1_card_1(X1)=k4_ordinal1), file('classes5/classes5__t15_classes5', d15_card_3)).
fof(t84_card_3, axiom, ![X1]:(v1_finset_1(X1)<=>r2_tarski(k1_card_1(X1),k4_ordinal1)), file('classes5/classes5__t15_classes5', t84_card_3)).
fof(cc2_classes2, axiom, ![X1]:(v1_classes2(X1)=>(v1_ordinal1(X1)&v2_classes1(X1))), file('classes5/classes5__t15_classes5', cc2_classes2)).
fof(dt_k13_classes2, axiom, (~(v1_xboole_0(k13_classes2))&v1_classes2(k13_classes2)), file('classes5/classes5__t15_classes5', dt_k13_classes2)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('classes5/classes5__t15_classes5', t1_subset)).
fof(t1_classes1, axiom, ![X1]:(v2_classes1(X1)<=>((v1_classes1(X1)&![X2]:(r2_tarski(X2,X1)=>r2_tarski(k9_setfam_1(X2),X1)))&![X2]:((r1_tarski(X2,X1)&r2_tarski(k1_card_1(X2),k1_card_1(X1)))=>r2_tarski(X2,X1)))), file('classes5/classes5__t15_classes5', t1_classes1)).
fof(t19_classes4, axiom, v5_card_3(k13_classes2), file('classes5/classes5__t15_classes5', t19_classes4)).
fof(c_0_9, negated_conjecture, ~(![X1]:(m1_subset_1(X1,k1_zfmisc_1(k13_classes2))=>(v1_finset_1(X1)=>m1_subset_1(X1,k13_classes2)))), inference(assume_negation,[status(cth)],[t15_classes5])).
fof(c_0_10, plain, ![X25, X26]:((~m1_subset_1(X25,k1_zfmisc_1(X26))|r1_tarski(X25,X26))&(~r1_tarski(X25,X26)|m1_subset_1(X25,k1_zfmisc_1(X26)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
fof(c_0_11, negated_conjecture, (m1_subset_1(esk1_0,k1_zfmisc_1(k13_classes2))&(v1_finset_1(esk1_0)&~m1_subset_1(esk1_0,k13_classes2))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
fof(c_0_12, plain, ![X16]:((~v5_card_3(X16)|k1_card_1(X16)=k4_ordinal1)&(k1_card_1(X16)!=k4_ordinal1|v5_card_3(X16))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d15_card_3])])).
fof(c_0_13, plain, ![X27]:((~v1_finset_1(X27)|r2_tarski(k1_card_1(X27),k4_ordinal1))&(~r2_tarski(k1_card_1(X27),k4_ordinal1)|v1_finset_1(X27))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t84_card_3])])).
fof(c_0_14, plain, ![X15]:((v1_ordinal1(X15)|~v1_classes2(X15))&(v2_classes1(X15)|~v1_classes2(X15))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_classes2])])])).
fof(c_0_15, plain, (~v1_xboole_0(k13_classes2)&v1_classes2(k13_classes2)), inference(fof_simplification,[status(thm)],[dt_k13_classes2])).
fof(c_0_16, plain, ![X23, X24]:(~r2_tarski(X23,X24)|m1_subset_1(X23,X24)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
fof(c_0_17, plain, ![X17, X18, X19, X20]:((((v1_classes1(X17)|~v2_classes1(X17))&(~r2_tarski(X18,X17)|r2_tarski(k9_setfam_1(X18),X17)|~v2_classes1(X17)))&(~r1_tarski(X19,X17)|~r2_tarski(k1_card_1(X19),k1_card_1(X17))|r2_tarski(X19,X17)|~v2_classes1(X17)))&((((r1_tarski(esk3_1(X20),X20)|(r2_tarski(esk2_1(X20),X20)|~v1_classes1(X20))|v2_classes1(X20))&(r2_tarski(k1_card_1(esk3_1(X20)),k1_card_1(X20))|(r2_tarski(esk2_1(X20),X20)|~v1_classes1(X20))|v2_classes1(X20)))&(~r2_tarski(esk3_1(X20),X20)|(r2_tarski(esk2_1(X20),X20)|~v1_classes1(X20))|v2_classes1(X20)))&(((r1_tarski(esk3_1(X20),X20)|(~r2_tarski(k9_setfam_1(esk2_1(X20)),X20)|~v1_classes1(X20))|v2_classes1(X20))&(r2_tarski(k1_card_1(esk3_1(X20)),k1_card_1(X20))|(~r2_tarski(k9_setfam_1(esk2_1(X20)),X20)|~v1_classes1(X20))|v2_classes1(X20)))&(~r2_tarski(esk3_1(X20),X20)|(~r2_tarski(k9_setfam_1(esk2_1(X20)),X20)|~v1_classes1(X20))|v2_classes1(X20))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_classes1])])])])])])).
cnf(c_0_18, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2))), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_19, negated_conjecture, (m1_subset_1(esk1_0,k1_zfmisc_1(k13_classes2))), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_20, plain, (k1_card_1(X1)=k4_ordinal1|~v5_card_3(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_21, plain, (v5_card_3(k13_classes2)), inference(split_conjunct,[status(thm)],[t19_classes4])).
cnf(c_0_22, plain, (r2_tarski(k1_card_1(X1),k4_ordinal1)|~v1_finset_1(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_23, negated_conjecture, (v1_finset_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_24, plain, (v2_classes1(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_25, plain, (v1_classes2(k13_classes2)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_26, negated_conjecture, (~m1_subset_1(esk1_0,k13_classes2)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_27, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_28, plain, (r2_tarski(X1,X2)|~r1_tarski(X1,X2)|~r2_tarski(k1_card_1(X1),k1_card_1(X2))|~v2_classes1(X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_29, negated_conjecture, (r1_tarski(esk1_0,k13_classes2)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
cnf(c_0_30, plain, (k1_card_1(k13_classes2)=k4_ordinal1), inference(spm,[status(thm)],[c_0_20, c_0_21])).
cnf(c_0_31, negated_conjecture, (r2_tarski(k1_card_1(esk1_0),k4_ordinal1)), inference(spm,[status(thm)],[c_0_22, c_0_23])).
cnf(c_0_32, plain, (v2_classes1(k13_classes2)), inference(spm,[status(thm)],[c_0_24, c_0_25])).
cnf(c_0_33, negated_conjecture, (~r2_tarski(esk1_0,k13_classes2)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_34, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), c_0_31]), c_0_32])]), c_0_33]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 35
# Proof object clause steps            : 17
# Proof object formula steps           : 18
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 6
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 24
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 24
# Processed clauses                    : 49
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 49
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 12
# ...of the previous two non-trivial   : 7
# Contextual simplify-reflections      : 0
# Paramodulations                      : 12
# 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  : 25
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 14
# Current number of unprocessed clauses: 6
# ...number of literals in the above   : 24
# Current number of archived formulas  : 0
# Current number of archived clauses   : 24
# Clause-clause subsumption calls (NU) : 166
# Rec. Clause-clause subsumption calls : 109
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 3
# 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          : 1610

# -------------------------------------------------
# User time                : 0.029 s
# System time              : 0.000 s
# Total time               : 0.029 s
# Maximum resident set size: 3056 pages
