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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d3_tarski, axiom, ![X1, X2]:(r1_tarski(X1,X2)<=>![X3]:(r2_hidden(X3,X1)=>r2_hidden(X3,X2))), file('classes5/classes5__t34_classes5', d3_tarski)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('classes5/classes5__t34_classes5', t3_subset)).
fof(dt_k4_fib_num2, axiom, m1_subset_1(k4_fib_num2,k1_zfmisc_1(k4_ordinal1)), file('classes5/classes5__t34_classes5', dt_k4_fib_num2)).
fof(d8_xboole_0, axiom, ![X1, X2]:(r2_xboole_0(X1,X2)<=>(r1_tarski(X1,X2)&X1!=X2)), file('classes5/classes5__t34_classes5', d8_xboole_0)).
fof(t31_classes5, axiom, ![X1]:((~(v1_finset_1(X1))&m1_subset_1(X1,k1_zfmisc_1(k13_classes2)))=>m2_classes5(X1,k13_classes2)), file('classes5/classes5__t34_classes5', t31_classes5)).
fof(t43_classes4, axiom, r2_xboole_0(k4_ordinal1,k13_classes2), file('classes5/classes5__t34_classes5', t43_classes4)).
fof(cc4_card_3, axiom, ![X1]:(v5_card_3(X1)=>(~(v1_finset_1(X1))&v4_card_3(X1))), file('classes5/classes5__t34_classes5', cc4_card_3)).
fof(t34_classes5, conjecture, m2_classes5(k4_fib_num2,k13_classes2), file('classes5/classes5__t34_classes5', t34_classes5)).
fof(t4_classes5, axiom, v5_card_3(k4_fib_num2), file('classes5/classes5__t34_classes5', t4_classes5)).
fof(c_0_9, plain, ![X14, X15, X16, X17, X18]:((~r1_tarski(X14,X15)|(~r2_hidden(X16,X14)|r2_hidden(X16,X15)))&((r2_hidden(esk1_2(X17,X18),X17)|r1_tarski(X17,X18))&(~r2_hidden(esk1_2(X17,X18),X18)|r1_tarski(X17,X18)))), 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)],[d3_tarski])])])])])])).
fof(c_0_10, plain, ![X23, X24]:((~m1_subset_1(X23,k1_zfmisc_1(X24))|r1_tarski(X23,X24))&(~r1_tarski(X23,X24)|m1_subset_1(X23,k1_zfmisc_1(X24)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
cnf(c_0_11, plain, (r2_hidden(X3,X2)|~r1_tarski(X1,X2)|~r2_hidden(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_12, plain, (r2_hidden(esk1_2(X1,X2),X1)|r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_13, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2))), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_14, plain, (m1_subset_1(k4_fib_num2,k1_zfmisc_1(k4_ordinal1))), inference(split_conjunct,[status(thm)],[dt_k4_fib_num2])).
cnf(c_0_15, plain, (r2_hidden(esk1_2(X1,X2),X3)|r1_tarski(X1,X2)|~r1_tarski(X1,X3)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_16, plain, (r1_tarski(k4_fib_num2,k4_ordinal1)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
fof(c_0_17, plain, ![X20, X21]:(((r1_tarski(X20,X21)|~r2_xboole_0(X20,X21))&(X20!=X21|~r2_xboole_0(X20,X21)))&(~r1_tarski(X20,X21)|X20=X21|r2_xboole_0(X20,X21))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_xboole_0])])])).
fof(c_0_18, plain, ![X1]:((~v1_finset_1(X1)&m1_subset_1(X1,k1_zfmisc_1(k13_classes2)))=>m2_classes5(X1,k13_classes2)), inference(fof_simplification,[status(thm)],[t31_classes5])).
cnf(c_0_19, plain, (r2_hidden(esk1_2(k4_fib_num2,X1),k4_ordinal1)|r1_tarski(k4_fib_num2,X1)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_20, plain, (r1_tarski(X1,X2)|~r2_xboole_0(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_21, plain, (r2_xboole_0(k4_ordinal1,k13_classes2)), inference(split_conjunct,[status(thm)],[t43_classes4])).
fof(c_0_22, plain, ![X22]:(v1_finset_1(X22)|~m1_subset_1(X22,k1_zfmisc_1(k13_classes2))|m2_classes5(X22,k13_classes2)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])).
cnf(c_0_23, plain, (r2_hidden(esk1_2(k4_fib_num2,X1),X2)|r1_tarski(k4_fib_num2,X1)|~r1_tarski(k4_ordinal1,X2)), inference(spm,[status(thm)],[c_0_11, c_0_19])).
cnf(c_0_24, plain, (r1_tarski(k4_ordinal1,k13_classes2)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
fof(c_0_25, plain, ![X1]:(v5_card_3(X1)=>(~v1_finset_1(X1)&v4_card_3(X1))), inference(fof_simplification,[status(thm)],[cc4_card_3])).
cnf(c_0_26, plain, (v1_finset_1(X1)|m2_classes5(X1,k13_classes2)|~m1_subset_1(X1,k1_zfmisc_1(k13_classes2))), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_27, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_28, plain, (r1_tarski(X1,X2)|~r2_hidden(esk1_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_29, plain, (r2_hidden(esk1_2(k4_fib_num2,X1),k13_classes2)|r1_tarski(k4_fib_num2,X1)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
fof(c_0_30, negated_conjecture, ~m2_classes5(k4_fib_num2,k13_classes2), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t34_classes5])])).
fof(c_0_31, plain, ![X13]:((~v1_finset_1(X13)|~v5_card_3(X13))&(v4_card_3(X13)|~v5_card_3(X13))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])).
cnf(c_0_32, plain, (v1_finset_1(X1)|m2_classes5(X1,k13_classes2)|~r1_tarski(X1,k13_classes2)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_33, plain, (r1_tarski(k4_fib_num2,k13_classes2)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
cnf(c_0_34, negated_conjecture, (~m2_classes5(k4_fib_num2,k13_classes2)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_35, plain, (~v1_finset_1(X1)|~v5_card_3(X1)), inference(split_conjunct,[status(thm)],[c_0_31])).
cnf(c_0_36, plain, (v1_finset_1(k4_fib_num2)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34])).
cnf(c_0_37, plain, (v5_card_3(k4_fib_num2)), inference(split_conjunct,[status(thm)],[t4_classes5])).
cnf(c_0_38, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 39
# Proof object clause steps            : 22
# Proof object formula steps           : 17
# Proof object conjectures             : 3
# Proof object clause conjectures      : 1
# Proof object formula conjectures     : 2
# Proof object initial clauses used    : 12
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 10
# Proof object simplifying inferences  : 3
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 15
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 15
# Processed clauses                    : 47
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 46
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 28
# ...of the previous two non-trivial   : 22
# Contextual simplify-reflections      : 0
# Paramodulations                      : 27
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# 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  : 30
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 20
# Current number of unprocessed clauses: 5
# ...number of literals in the above   : 11
# Current number of archived formulas  : 0
# Current number of archived clauses   : 15
# Clause-clause subsumption calls (NU) : 47
# Rec. Clause-clause subsumption calls : 38
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 9
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 4
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1193

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