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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t23_card_4, axiom, ![X1]:(~(v1_xboole_0(X1))=>![X2]:(v7_ordinal1(X2)=>~(((~(v1_finset_1(X1))&X2!=k5_numbers)&~((r2_wellord2(k4_finseq_2(X2,X1),X1)&k1_card_1(k4_finseq_2(X2,X1))=k1_card_1(X1))))))), file('classes5/classes5__t6_classes5', t23_card_4)).
fof(t6_classes5, conjecture, ![X1]:(~(v1_xboole_0(X1))=>![X2]:((v7_ordinal1(X2)&~(v8_ordinal1(X2)))=>(v1_finset_1(k4_finseq_2(X2,X1))=>v1_finset_1(X1)))), file('classes5/classes5__t6_classes5', t6_classes5)).
fof(fc9_ordinal1, axiom, v8_ordinal1(k5_ordinal1), file('classes5/classes5__t6_classes5', fc9_ordinal1)).
fof(redefinition_k5_numbers, axiom, k5_numbers=k5_ordinal1, file('classes5/classes5__t6_classes5', redefinition_k5_numbers)).
fof(fc8_card_1, axiom, ![X1]:(v1_finset_1(X1)=>(v1_finset_1(k1_card_1(X1))&v1_card_1(k1_card_1(X1)))), file('classes5/classes5__t6_classes5', fc8_card_1)).
fof(fc10_card_1, axiom, ![X1]:(~(v1_finset_1(X1))=>(~(v1_finset_1(k1_card_1(X1)))&v1_card_1(k1_card_1(X1)))), file('classes5/classes5__t6_classes5', fc10_card_1)).
fof(c_0_6, plain, ![X1]:(~v1_xboole_0(X1)=>![X2]:(v7_ordinal1(X2)=>~(((~v1_finset_1(X1)&X2!=k5_numbers)&~((r2_wellord2(k4_finseq_2(X2,X1),X1)&k1_card_1(k4_finseq_2(X2,X1))=k1_card_1(X1))))))), inference(fof_simplification,[status(thm)],[t23_card_4])).
fof(c_0_7, negated_conjecture, ~(![X1]:(~v1_xboole_0(X1)=>![X2]:((v7_ordinal1(X2)&~v8_ordinal1(X2))=>(v1_finset_1(k4_finseq_2(X2,X1))=>v1_finset_1(X1))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t6_classes5])])).
fof(c_0_8, plain, ![X13, X14]:((r2_wellord2(k4_finseq_2(X14,X13),X13)|(v1_finset_1(X13)|X14=k5_numbers)|~v7_ordinal1(X14)|v1_xboole_0(X13))&(k1_card_1(k4_finseq_2(X14,X13))=k1_card_1(X13)|(v1_finset_1(X13)|X14=k5_numbers)|~v7_ordinal1(X14)|v1_xboole_0(X13))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])).
fof(c_0_9, negated_conjecture, (~v1_xboole_0(esk1_0)&((v7_ordinal1(esk2_0)&~v8_ordinal1(esk2_0))&(v1_finset_1(k4_finseq_2(esk2_0,esk1_0))&~v1_finset_1(esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
cnf(c_0_10, plain, (v8_ordinal1(k5_ordinal1)), inference(split_conjunct,[status(thm)],[fc9_ordinal1])).
cnf(c_0_11, plain, (k5_numbers=k5_ordinal1), inference(split_conjunct,[status(thm)],[redefinition_k5_numbers])).
cnf(c_0_12, plain, (k1_card_1(k4_finseq_2(X1,X2))=k1_card_1(X2)|v1_finset_1(X2)|X1=k5_numbers|v1_xboole_0(X2)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, negated_conjecture, (v7_ordinal1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_14, plain, ![X12]:((v1_finset_1(k1_card_1(X12))|~v1_finset_1(X12))&(v1_card_1(k1_card_1(X12))|~v1_finset_1(X12))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc8_card_1])])])).
cnf(c_0_15, plain, (v8_ordinal1(k5_numbers)), inference(rw,[status(thm)],[c_0_10, c_0_11])).
cnf(c_0_16, negated_conjecture, (k1_card_1(k4_finseq_2(esk2_0,X1))=k1_card_1(X1)|k5_numbers=esk2_0|v1_finset_1(X1)|v1_xboole_0(X1)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_17, negated_conjecture, (~v8_ordinal1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_18, plain, ![X1]:(~v1_finset_1(X1)=>(~v1_finset_1(k1_card_1(X1))&v1_card_1(k1_card_1(X1)))), inference(fof_simplification,[status(thm)],[fc10_card_1])).
cnf(c_0_19, plain, (v1_finset_1(k1_card_1(X1))|~v1_finset_1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_20, negated_conjecture, (k1_card_1(k4_finseq_2(esk2_0,X1))=k1_card_1(X1)|v1_finset_1(X1)|v1_xboole_0(X1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
fof(c_0_21, plain, ![X11]:((~v1_finset_1(k1_card_1(X11))|v1_finset_1(X11))&(v1_card_1(k1_card_1(X11))|v1_finset_1(X11))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])).
cnf(c_0_22, negated_conjecture, (v1_finset_1(k1_card_1(X1))|v1_xboole_0(X1)|~v1_finset_1(k4_finseq_2(esk2_0,X1))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_19])).
cnf(c_0_23, negated_conjecture, (v1_finset_1(k4_finseq_2(esk2_0,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_24, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_25, plain, (v1_finset_1(X1)|~v1_finset_1(k1_card_1(X1))), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_26, negated_conjecture, (v1_finset_1(k1_card_1(esk1_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
cnf(c_0_27, negated_conjecture, (~v1_finset_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_28, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 29
# Proof object clause steps            : 16
# Proof object formula steps           : 13
# Proof object conjectures             : 13
# Proof object clause conjectures      : 10
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 5
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 13
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 13
# Processed clauses                    : 30
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 30
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 2
# Backward-rewritten                   : 0
# Generated clauses                    : 12
# ...of the previous two non-trivial   : 8
# Contextual simplify-reflections      : 2
# 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  : 16
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 7
# Current number of unprocessed clauses: 3
# ...number of literals in the above   : 14
# Current number of archived formulas  : 0
# Current number of archived clauses   : 14
# Clause-clause subsumption calls (NU) : 10
# Rec. Clause-clause subsumption calls : 9
# Non-unit clause-clause subsumptions  : 3
# Unit Clause-clause subsumption calls : 7
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 1
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 980

# -------------------------------------------------
# User time                : 0.033 s
# System time              : 0.004 s
# Total time               : 0.037 s
# Maximum resident set size: 3080 pages
