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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t73_number14, conjecture, ![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>k4_card_1(k2_calcul_2(X1,X2))=X2)), file('number14/number14__t73_number14', t73_number14)).
fof(redefinition_k2_calcul_2, axiom, ![X1, X2]:((v7_ordinal1(X1)&v7_ordinal1(X2))=>k2_calcul_2(X1,X2)=k1_calcul_2(X1,X2)), file('number14/number14__t73_number14', redefinition_k2_calcul_2)).
fof(rd1_card_1, axiom, ![X1]:(v1_card_1(X1)=>k1_card_1(X1)=X1), file('number14/number14__t73_number14', rd1_card_1)).
fof(cc3_card_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_card_1(X1)), file('number14/number14__t73_number14', cc3_card_1)).
fof(fc1_calcul_2, axiom, ![X1, X2]:((v7_ordinal1(X1)&v7_ordinal1(X2))=>v1_finset_1(k1_calcul_2(X1,X2))), file('number14/number14__t73_number14', fc1_calcul_2)).
fof(t5_card_1, axiom, ![X1, X2]:(r2_wellord2(X1,X2)<=>k1_card_1(X1)=k1_card_1(X2)), file('number14/number14__t73_number14', t5_card_1)).
fof(redefinition_k4_card_1, axiom, ![X1]:(v1_finset_1(X1)=>k4_card_1(X1)=k1_card_1(X1)), file('number14/number14__t73_number14', redefinition_k4_card_1)).
fof(t6_calcul_2, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>r2_wellord2(k2_calcul_2(X1,X2),X2))), file('number14/number14__t73_number14', t6_calcul_2)).
fof(c_0_8, negated_conjecture, ~(![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>k4_card_1(k2_calcul_2(X1,X2))=X2))), inference(assume_negation,[status(cth)],[t73_number14])).
fof(c_0_9, plain, ![X22, X23]:(~v7_ordinal1(X22)|~v7_ordinal1(X23)|k2_calcul_2(X22,X23)=k1_calcul_2(X22,X23)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k2_calcul_2])])).
fof(c_0_10, negated_conjecture, (v7_ordinal1(esk1_0)&(v7_ordinal1(esk2_0)&k4_card_1(k2_calcul_2(esk1_0,esk2_0))!=esk2_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
fof(c_0_11, plain, ![X21]:(~v1_card_1(X21)|k1_card_1(X21)=X21), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rd1_card_1])])).
fof(c_0_12, plain, ![X18]:(~v7_ordinal1(X18)|v1_card_1(X18)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_card_1])])).
cnf(c_0_13, plain, (k2_calcul_2(X1,X2)=k1_calcul_2(X1,X2)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, negated_conjecture, (v7_ordinal1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_15, plain, (k1_card_1(X1)=X1|~v1_card_1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_16, plain, (v1_card_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_17, plain, ![X19, X20]:(~v7_ordinal1(X19)|~v7_ordinal1(X20)|v1_finset_1(k1_calcul_2(X19,X20))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_calcul_2])])).
cnf(c_0_18, negated_conjecture, (k1_calcul_2(X1,esk2_0)=k2_calcul_2(X1,esk2_0)|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_19, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
fof(c_0_20, plain, ![X25, X26]:((~r2_wellord2(X25,X26)|k1_card_1(X25)=k1_card_1(X26))&(k1_card_1(X25)!=k1_card_1(X26)|r2_wellord2(X25,X26))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_card_1])])).
cnf(c_0_21, plain, (k1_card_1(X1)=X1|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
fof(c_0_22, plain, ![X24]:(~v1_finset_1(X24)|k4_card_1(X24)=k1_card_1(X24)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_card_1])])).
cnf(c_0_23, plain, (v1_finset_1(k1_calcul_2(X1,X2))|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_24, negated_conjecture, (k1_calcul_2(esk1_0,esk2_0)=k2_calcul_2(esk1_0,esk2_0)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
cnf(c_0_25, plain, (k1_card_1(X1)=k1_card_1(X2)|~r2_wellord2(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_26, negated_conjecture, (k1_card_1(esk2_0)=esk2_0), inference(spm,[status(thm)],[c_0_21, c_0_14])).
fof(c_0_27, plain, ![X27, X28]:(~v7_ordinal1(X27)|(~v7_ordinal1(X28)|r2_wellord2(k2_calcul_2(X27,X28),X28))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_calcul_2])])])).
cnf(c_0_28, plain, (k4_card_1(X1)=k1_card_1(X1)|~v1_finset_1(X1)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_29, negated_conjecture, (v1_finset_1(k2_calcul_2(esk1_0,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_14]), c_0_19])])).
cnf(c_0_30, negated_conjecture, (k1_card_1(X1)=esk2_0|~r2_wellord2(X1,esk2_0)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_31, plain, (r2_wellord2(k2_calcul_2(X1,X2),X2)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_32, negated_conjecture, (k4_card_1(k2_calcul_2(esk1_0,esk2_0))!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_33, negated_conjecture, (k4_card_1(k2_calcul_2(esk1_0,esk2_0))=k1_card_1(k2_calcul_2(esk1_0,esk2_0))), inference(spm,[status(thm)],[c_0_28, c_0_29])).
cnf(c_0_34, negated_conjecture, (k1_card_1(k2_calcul_2(X1,esk2_0))=esk2_0|~v7_ordinal1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_14])])).
cnf(c_0_35, negated_conjecture, (k1_card_1(k2_calcul_2(esk1_0,esk2_0))!=esk2_0), inference(rw,[status(thm)],[c_0_32, c_0_33])).
cnf(c_0_36, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_19]), c_0_35]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 37
# Proof object clause steps            : 20
# Proof object formula steps           : 17
# Proof object conjectures             : 15
# Proof object clause conjectures      : 12
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 8
# Proof object generating inferences   : 9
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 11
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 11
# Processed clauses                    : 38
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 38
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 26
# ...of the previous two non-trivial   : 21
# Contextual simplify-reflections      : 0
# Paramodulations                      : 26
# 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  : 26
#    Positive orientable unit clauses  : 10
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 15
# Current number of unprocessed clauses: 4
# ...number of literals in the above   : 10
# Current number of archived formulas  : 0
# Current number of archived clauses   : 12
# Clause-clause subsumption calls (NU) : 15
# Rec. Clause-clause subsumption calls : 15
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 1137

# -------------------------------------------------
# User time                : 0.024 s
# System time              : 0.000 s
# Total time               : 0.024 s
# Maximum resident set size: 2944 pages
