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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t71_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(r2_tarski(X2,k1_card_1(X1))=>r2_tarski(k1_card_1(k1_zfmisc_1(X2)),X1))), file('classes5/classes5__t71_classes5', t71_classes5)).
fof(cc2_classes2, axiom, ![X1]:(v1_classes2(X1)=>(v1_ordinal1(X1)&v2_classes1(X1))), file('classes5/classes5__t71_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__t71_classes5', t13_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__t71_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__t71_classes5', dt_k2_classes2)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('classes5/classes5__t71_classes5', t1_subset)).
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__t71_classes5', t29_classes4)).
fof(c_0_7, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(r2_tarski(X2,k1_card_1(X1))=>r2_tarski(k1_card_1(k1_zfmisc_1(X2)),X1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t71_classes5])])).
fof(c_0_8, plain, ![X18]:((v1_ordinal1(X18)|~v1_classes2(X18))&(v2_classes1(X18)|~v1_classes2(X18))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_classes2])])])).
fof(c_0_9, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&(r2_tarski(esk2_0,k1_card_1(esk1_0))&~r2_tarski(k1_card_1(k1_zfmisc_1(esk2_0)),esk1_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
fof(c_0_10, plain, ![X23, X24]:(~v2_classes1(X24)|~r2_tarski(X23,k1_card_1(X24))|r2_tarski(X23,X24)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t13_classes2])])).
cnf(c_0_11, plain, (v2_classes1(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_12, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_13, 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_14, plain, (r2_tarski(X2,X1)|~v2_classes1(X1)|~r2_tarski(X2,k1_card_1(X1))), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_15, negated_conjecture, (v2_classes1(esk1_0)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
fof(c_0_16, 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_17, plain, ![X21, X22]:(v1_xboole_0(X21)|~v1_classes2(X21)|~m1_subset_1(X22,X21)|k2_classes2(X21,X22)=k1_zfmisc_1(X22)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])).
fof(c_0_18, plain, ![X25, X26]:(~r2_tarski(X25,X26)|m1_subset_1(X25,X26)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
cnf(c_0_19, negated_conjecture, (r2_tarski(X1,esk1_0)|~r2_tarski(X1,k1_card_1(esk1_0))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_20, negated_conjecture, (r2_tarski(esk2_0,k1_card_1(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_21, 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_22, plain, ![X19, X20]:(v1_xboole_0(X19)|~v1_classes2(X19)|~m1_subset_1(X20,X19)|m1_subset_1(k2_classes2(X19,X20),X19)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])).
cnf(c_0_23, 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_17])).
cnf(c_0_24, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_25, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_26, negated_conjecture, (r2_tarski(esk2_0,esk1_0)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
fof(c_0_27, plain, ![X27, X28]:(v1_xboole_0(X27)|~v1_classes2(X27)|(~m1_subset_1(X28,X27)|r2_tarski(k1_card_1(X28),X27))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])).
cnf(c_0_28, 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_22])).
cnf(c_0_29, negated_conjecture, (k2_classes2(esk1_0,X1)=k1_zfmisc_1(X1)|~m1_subset_1(X1,esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_12]), c_0_24])).
cnf(c_0_30, negated_conjecture, (m1_subset_1(esk2_0,esk1_0)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_31, 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_27])).
cnf(c_0_32, negated_conjecture, (m1_subset_1(k2_classes2(esk1_0,X1),esk1_0)|~m1_subset_1(X1,esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_12]), c_0_24])).
cnf(c_0_33, negated_conjecture, (k2_classes2(esk1_0,esk2_0)=k1_zfmisc_1(esk2_0)), inference(spm,[status(thm)],[c_0_29, c_0_30])).
cnf(c_0_34, negated_conjecture, (r2_tarski(k1_card_1(X1),esk1_0)|~m1_subset_1(X1,esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_12]), c_0_24])).
cnf(c_0_35, negated_conjecture, (m1_subset_1(k1_zfmisc_1(esk2_0),esk1_0)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_30]), c_0_33])).
cnf(c_0_36, negated_conjecture, (~r2_tarski(k1_card_1(k1_zfmisc_1(esk2_0)),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_37, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 38
# Proof object clause steps            : 20
# Proof object formula steps           : 18
# Proof object conjectures             : 17
# Proof object clause conjectures      : 14
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 10
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 11
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 11
# Processed clauses                    : 39
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 39
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 24
# ...of the previous two non-trivial   : 21
# Contextual simplify-reflections      : 0
# Paramodulations                      : 24
# 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  : 28
#    Positive orientable unit clauses  : 15
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 4
# ...number of literals in the above   : 4
# Current number of archived formulas  : 0
# Current number of archived clauses   : 11
# Clause-clause subsumption calls (NU) : 48
# Rec. Clause-clause subsumption calls : 16
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 5
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 1
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1216

# -------------------------------------------------
# User time                : 0.035 s
# System time              : 0.000 s
# Total time               : 0.035 s
# Maximum resident set size: 3640 pages
