# 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.020 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t30_number15, conjecture, ![X1]:(v7_ordinal1(X1)=>k4_card_1(k1_number15(k11_newton(np__3,k1_nat_1(k3_xcmplx_0(np__2,X1),np__1)),np__4,np__3))=k1_nat_1(X1,np__1)), file('number15/number15__t30_number15', t30_number15)).
fof(dt_k1_nat_1, axiom, ![X1, X2]:((v7_ordinal1(X1)&m1_subset_1(X2,k4_ordinal1))=>m1_subset_1(k1_nat_1(X1,X2),k4_ordinal1)), file('number15/number15__t30_number15', dt_k1_nat_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('number15/number15__t30_number15', fc10_card_1)).
fof(t28_number15, axiom, ![X1]:(v7_ordinal1(X1)=>k1_card_1(a_1_1_number15(X1))=k1_nat_1(X1,np__1)), file('number15/number15__t30_number15', t28_number15)).
fof(spc1_numerals, axiom, (v2_xxreal_0(np__1)&m1_subset_1(np__1,k4_ordinal1)), file('number15/number15__t30_number15', spc1_numerals)).
fof(cc4_card_1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v1_finset_1(X1)), file('number15/number15__t30_number15', cc4_card_1)).
fof(t26_number15, axiom, ![X1]:(v7_ordinal1(X1)=>k1_number15(k11_newton(np__3,k1_nat_1(k3_xcmplx_0(np__2,X1),np__1)),np__4,np__3)=a_1_1_number15(X1)), file('number15/number15__t30_number15', t26_number15)).
fof(redefinition_k4_card_1, axiom, ![X1]:(v1_finset_1(X1)=>k4_card_1(X1)=k1_card_1(X1)), file('number15/number15__t30_number15', redefinition_k4_card_1)).
fof(c_0_8, negated_conjecture, ~(![X1]:(v7_ordinal1(X1)=>k4_card_1(k1_number15(k11_newton(np__3,k1_nat_1(k3_xcmplx_0(np__2,X1),np__1)),np__4,np__3))=k1_nat_1(X1,np__1))), inference(assume_negation,[status(cth)],[t30_number15])).
fof(c_0_9, plain, ![X13, X14]:(~v7_ordinal1(X13)|~m1_subset_1(X14,k4_ordinal1)|m1_subset_1(k1_nat_1(X13,X14),k4_ordinal1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_nat_1])])).
fof(c_0_10, 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])).
fof(c_0_11, plain, ![X18]:(~v7_ordinal1(X18)|k1_card_1(a_1_1_number15(X18))=k1_nat_1(X18,np__1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_number15])])).
fof(c_0_12, negated_conjecture, (v7_ordinal1(esk1_0)&k4_card_1(k1_number15(k11_newton(np__3,k1_nat_1(k3_xcmplx_0(np__2,esk1_0),np__1)),np__4,np__3))!=k1_nat_1(esk1_0,np__1)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
cnf(c_0_13, plain, (m1_subset_1(k1_nat_1(X1,X2),k4_ordinal1)|~v7_ordinal1(X1)|~m1_subset_1(X2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, plain, (m1_subset_1(np__1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc1_numerals])).
fof(c_0_15, plain, ![X15]:((~v1_finset_1(k1_card_1(X15))|v1_finset_1(X15))&(v1_card_1(k1_card_1(X15))|v1_finset_1(X15))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
cnf(c_0_16, plain, (k1_card_1(a_1_1_number15(X1))=k1_nat_1(X1,np__1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_17, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_18, plain, ![X12]:(~m1_subset_1(X12,k4_ordinal1)|v1_finset_1(X12)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc4_card_1])])).
cnf(c_0_19, plain, (m1_subset_1(k1_nat_1(X1,np__1),k4_ordinal1)|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
fof(c_0_20, plain, ![X17]:(~v7_ordinal1(X17)|k1_number15(k11_newton(np__3,k1_nat_1(k3_xcmplx_0(np__2,X17),np__1)),np__4,np__3)=a_1_1_number15(X17)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t26_number15])])).
cnf(c_0_21, plain, (v1_finset_1(X1)|~v1_finset_1(k1_card_1(X1))), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_22, negated_conjecture, (k1_card_1(a_1_1_number15(esk1_0))=k1_nat_1(esk1_0,np__1)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_23, plain, (v1_finset_1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_24, negated_conjecture, (m1_subset_1(k1_nat_1(esk1_0,np__1),k4_ordinal1)), inference(spm,[status(thm)],[c_0_19, c_0_17])).
cnf(c_0_25, plain, (k1_number15(k11_newton(np__3,k1_nat_1(k3_xcmplx_0(np__2,X1),np__1)),np__4,np__3)=a_1_1_number15(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_20])).
fof(c_0_26, plain, ![X16]:(~v1_finset_1(X16)|k4_card_1(X16)=k1_card_1(X16)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_card_1])])).
cnf(c_0_27, negated_conjecture, (v1_finset_1(a_1_1_number15(esk1_0))|~v1_finset_1(k1_nat_1(esk1_0,np__1))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_28, negated_conjecture, (v1_finset_1(k1_nat_1(esk1_0,np__1))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_29, negated_conjecture, (k4_card_1(k1_number15(k11_newton(np__3,k1_nat_1(k3_xcmplx_0(np__2,esk1_0),np__1)),np__4,np__3))!=k1_nat_1(esk1_0,np__1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_30, negated_conjecture, (k1_number15(k11_newton(np__3,k1_nat_1(k3_xcmplx_0(np__2,esk1_0),np__1)),np__4,np__3)=a_1_1_number15(esk1_0)), inference(spm,[status(thm)],[c_0_25, c_0_17])).
cnf(c_0_31, plain, (k4_card_1(X1)=k1_card_1(X1)|~v1_finset_1(X1)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_32, negated_conjecture, (v1_finset_1(a_1_1_number15(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_28])])).
cnf(c_0_33, negated_conjecture, (k4_card_1(a_1_1_number15(esk1_0))!=k1_nat_1(esk1_0,np__1)), inference(rw,[status(thm)],[c_0_29, c_0_30])).
cnf(c_0_34, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_22]), c_0_33]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 35
# Proof object clause steps            : 18
# Proof object formula steps           : 17
# Proof object conjectures             : 13
# Proof object clause conjectures      : 10
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 8
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 5
# 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                    : 32
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 32
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 2
# Generated clauses                    : 12
# ...of the previous two non-trivial   : 13
# Contextual simplify-reflections      : 0
# 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  : 19
#    Positive orientable unit clauses  : 10
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 8
# Current number of unprocessed clauses: 3
# ...number of literals in the above   : 5
# Current number of archived formulas  : 0
# Current number of archived clauses   : 13
# Clause-clause subsumption calls (NU) : 10
# Rec. Clause-clause subsumption calls : 10
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 3
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 983

# -------------------------------------------------
# User time                : 0.023 s
# System time              : 0.000 s
# Total time               : 0.023 s
# Maximum resident set size: 3588 pages
