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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t72_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(v1_card_1(X2)=>![X3]:(v1_card_1(X3)=>((r2_tarski(X2,k1_card_1(X1))&r2_tarski(X3,k1_card_1(X1)))=>r2_tarski(k1_card_1(k1_zfmisc_1(k2_zfmisc_1(X2,X3))),X1))))), file('classes5/classes5__t72_classes5', t72_classes5)).
fof(cc2_classes2, axiom, ![X1]:(v1_classes2(X1)=>(v1_ordinal1(X1)&v2_classes1(X1))), file('classes5/classes5__t72_classes5', cc2_classes2)).
fof(t13_classes2, axiom, ![X1, X2]:((v2_classes1(X2)&r2_tarski(X1,k1_card_1(X2)))=>r2_tarski(X1,X2)), file('classes5/classes5__t72_classes5', t13_classes2)).
fof(redefinition_k11_classes2, axiom, ![X1, X2, X3]:((((~(v1_xboole_0(X1))&v1_classes2(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))=>k11_classes2(X1,X2,X3)=k2_zfmisc_1(X2,X3)), file('classes5/classes5__t72_classes5', redefinition_k11_classes2)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('classes5/classes5__t72_classes5', t1_subset)).
fof(dt_k11_classes2, axiom, ![X1, X2, X3]:((((~(v1_xboole_0(X1))&v1_classes2(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))=>m1_subset_1(k11_classes2(X1,X2,X3),X1)), file('classes5/classes5__t72_classes5', dt_k11_classes2)).
fof(redefinition_k2_classes2, axiom, ![X1, X2]:(((~(v1_xboole_0(X1))&v1_classes2(X1))&m1_subset_1(X2,X1))=>k2_classes2(X1,X2)=k1_zfmisc_1(X2)), file('classes5/classes5__t72_classes5', redefinition_k2_classes2)).
fof(dt_k2_classes2, axiom, ![X1, X2]:(((~(v1_xboole_0(X1))&v1_classes2(X1))&m1_subset_1(X2,X1))=>m1_subset_1(k2_classes2(X1,X2),X1)), file('classes5/classes5__t72_classes5', dt_k2_classes2)).
fof(t29_classes4, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>r2_tarski(k1_card_1(X2),X1))), file('classes5/classes5__t72_classes5', t29_classes4)).
fof(c_0_9, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(v1_card_1(X2)=>![X3]:(v1_card_1(X3)=>((r2_tarski(X2,k1_card_1(X1))&r2_tarski(X3,k1_card_1(X1)))=>r2_tarski(k1_card_1(k1_zfmisc_1(k2_zfmisc_1(X2,X3))),X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t72_classes5])])).
fof(c_0_10, plain, ![X27]:((v1_ordinal1(X27)|~v1_classes2(X27))&(v2_classes1(X27)|~v1_classes2(X27))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_classes2])])])).
fof(c_0_11, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&(v1_card_1(esk2_0)&(v1_card_1(esk3_0)&((r2_tarski(esk2_0,k1_card_1(esk1_0))&r2_tarski(esk3_0,k1_card_1(esk1_0)))&~r2_tarski(k1_card_1(k1_zfmisc_1(k2_zfmisc_1(esk2_0,esk3_0))),esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
fof(c_0_12, plain, ![X38, X39]:(~v2_classes1(X39)|~r2_tarski(X38,k1_card_1(X39))|r2_tarski(X38,X39)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t13_classes2])])).
cnf(c_0_13, plain, (v2_classes1(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_14, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_15, plain, ![X1, X2, X3]:((((~v1_xboole_0(X1)&v1_classes2(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))=>k11_classes2(X1,X2,X3)=k2_zfmisc_1(X2,X3)), inference(fof_simplification,[status(thm)],[redefinition_k11_classes2])).
fof(c_0_16, plain, ![X40, X41]:(~r2_tarski(X40,X41)|m1_subset_1(X40,X41)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
cnf(c_0_17, plain, (r2_tarski(X2,X1)|~v2_classes1(X1)|~r2_tarski(X2,k1_card_1(X1))), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, negated_conjecture, (r2_tarski(esk3_0,k1_card_1(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_19, negated_conjecture, (v2_classes1(esk1_0)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
fof(c_0_20, plain, ![X1, X2, X3]:((((~v1_xboole_0(X1)&v1_classes2(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))=>m1_subset_1(k11_classes2(X1,X2,X3),X1)), inference(fof_simplification,[status(thm)],[dt_k11_classes2])).
fof(c_0_21, plain, ![X33, X34, X35]:(v1_xboole_0(X33)|~v1_classes2(X33)|~m1_subset_1(X34,X33)|~m1_subset_1(X35,X33)|k11_classes2(X33,X34,X35)=k2_zfmisc_1(X34,X35)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])).
cnf(c_0_22, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_23, negated_conjecture, (r2_tarski(esk3_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])])).
cnf(c_0_24, negated_conjecture, (r2_tarski(esk2_0,k1_card_1(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_25, plain, ![X28, X29, X30]:(v1_xboole_0(X28)|~v1_classes2(X28)|~m1_subset_1(X29,X28)|~m1_subset_1(X30,X28)|m1_subset_1(k11_classes2(X28,X29,X30),X28)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])).
cnf(c_0_26, plain, (v1_xboole_0(X1)|k11_classes2(X1,X2,X3)=k2_zfmisc_1(X2,X3)|~v1_classes2(X1)|~m1_subset_1(X2,X1)|~m1_subset_1(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_27, negated_conjecture, (m1_subset_1(esk3_0,esk1_0)), inference(spm,[status(thm)],[c_0_22, c_0_23])).
cnf(c_0_28, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_29, negated_conjecture, (r2_tarski(esk2_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_24]), c_0_19])])).
fof(c_0_30, plain, ![X1, X2]:(((~v1_xboole_0(X1)&v1_classes2(X1))&m1_subset_1(X2,X1))=>k2_classes2(X1,X2)=k1_zfmisc_1(X2)), inference(fof_simplification,[status(thm)],[redefinition_k2_classes2])).
cnf(c_0_31, plain, (v1_xboole_0(X1)|m1_subset_1(k11_classes2(X1,X2,X3),X1)|~v1_classes2(X1)|~m1_subset_1(X2,X1)|~m1_subset_1(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_32, negated_conjecture, (k11_classes2(esk1_0,X1,esk3_0)=k2_zfmisc_1(X1,esk3_0)|~m1_subset_1(X1,esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_14])]), c_0_28])).
cnf(c_0_33, negated_conjecture, (m1_subset_1(esk2_0,esk1_0)), inference(spm,[status(thm)],[c_0_22, c_0_29])).
fof(c_0_34, plain, ![X1, X2]:(((~v1_xboole_0(X1)&v1_classes2(X1))&m1_subset_1(X2,X1))=>m1_subset_1(k2_classes2(X1,X2),X1)), inference(fof_simplification,[status(thm)],[dt_k2_classes2])).
fof(c_0_35, plain, ![X36, X37]:(v1_xboole_0(X36)|~v1_classes2(X36)|~m1_subset_1(X37,X36)|k2_classes2(X36,X37)=k1_zfmisc_1(X37)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])).
cnf(c_0_36, negated_conjecture, (m1_subset_1(k11_classes2(esk1_0,X1,esk3_0),esk1_0)|~m1_subset_1(X1,esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_27]), c_0_14])]), c_0_28])).
cnf(c_0_37, negated_conjecture, (k11_classes2(esk1_0,esk2_0,esk3_0)=k2_zfmisc_1(esk2_0,esk3_0)), inference(spm,[status(thm)],[c_0_32, c_0_33])).
fof(c_0_38, plain, ![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>r2_tarski(k1_card_1(X2),X1))), inference(fof_simplification,[status(thm)],[t29_classes4])).
fof(c_0_39, plain, ![X31, X32]:(v1_xboole_0(X31)|~v1_classes2(X31)|~m1_subset_1(X32,X31)|m1_subset_1(k2_classes2(X31,X32),X31)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])).
cnf(c_0_40, plain, (v1_xboole_0(X1)|k2_classes2(X1,X2)=k1_zfmisc_1(X2)|~v1_classes2(X1)|~m1_subset_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_41, negated_conjecture, (m1_subset_1(k2_zfmisc_1(esk2_0,esk3_0),esk1_0)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_33]), c_0_37])).
fof(c_0_42, plain, ![X42, X43]:(v1_xboole_0(X42)|~v1_classes2(X42)|(~m1_subset_1(X43,X42)|r2_tarski(k1_card_1(X43),X42))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])).
cnf(c_0_43, plain, (v1_xboole_0(X1)|m1_subset_1(k2_classes2(X1,X2),X1)|~v1_classes2(X1)|~m1_subset_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_39])).
cnf(c_0_44, negated_conjecture, (k2_classes2(esk1_0,k2_zfmisc_1(esk2_0,esk3_0))=k1_zfmisc_1(k2_zfmisc_1(esk2_0,esk3_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_14])]), c_0_28])).
cnf(c_0_45, plain, (v1_xboole_0(X1)|r2_tarski(k1_card_1(X2),X1)|~v1_classes2(X1)|~m1_subset_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_42])).
cnf(c_0_46, negated_conjecture, (m1_subset_1(k1_zfmisc_1(k2_zfmisc_1(esk2_0,esk3_0)),esk1_0)), inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_41]), c_0_14])]), c_0_28]), c_0_44])).
cnf(c_0_47, negated_conjecture, (~r2_tarski(k1_card_1(k1_zfmisc_1(k2_zfmisc_1(esk2_0,esk3_0))),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_48, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_14])]), c_0_47]), c_0_28]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 49
# Proof object clause steps            : 25
# Proof object formula steps           : 24
# Proof object conjectures             : 20
# Proof object clause conjectures      : 17
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 12
# Proof object simplifying inferences  : 22
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 16
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 16
# Processed clauses                    : 250
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 250
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 2472
# ...of the previous two non-trivial   : 2438
# Contextual simplify-reflections      : 0
# Paramodulations                      : 2472
# 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  : 234
#    Positive orientable unit clauses  : 180
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 52
# Current number of unprocessed clauses: 2216
# ...number of literals in the above   : 2307
# Current number of archived formulas  : 0
# Current number of archived clauses   : 16
# Clause-clause subsumption calls (NU) : 399
# Rec. Clause-clause subsumption calls : 237
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 244
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 741
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 40456

# -------------------------------------------------
# User time                : 0.039 s
# System time              : 0.000 s
# Total time               : 0.039 s
# Maximum resident set size: 3660 pages
