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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('number15/number15__l1_number15', cc8_ordinal1)).
fof(cc1_xcmplx_0, axiom, ![X1]:(v7_ordinal1(X1)=>v1_xcmplx_0(X1)), file('number15/number15__l1_number15', cc1_xcmplx_0)).
fof(spc2_numerals, axiom, (v2_xxreal_0(np__2)&m1_subset_1(np__2,k4_ordinal1)), file('number15/number15__l1_number15', spc2_numerals)).
fof(redefinition_k11_newton, axiom, ![X1, X2]:((m1_subset_1(X1,k4_ordinal1)&m1_subset_1(X2,k4_ordinal1))=>k11_newton(X1,X2)=k1_newton(X1,X2)), file('number15/number15__l1_number15', redefinition_k11_newton)).
fof(t81_newton, axiom, ![X1]:(v1_xcmplx_0(X1)=>(k1_newton(X1,np__2)=k3_xcmplx_0(X1,X1)&k1_square_1(X1)=k1_newton(X1,np__2))), file('number15/number15__l1_number15', t81_newton)).
fof(rqRealMult__k3_xcmplx_0__r2_r2_r4, axiom, k3_xcmplx_0(np__2,np__2)=np__4, file('number15/number15__l1_number15', rqRealMult__k3_xcmplx_0__r2_r2_r4)).
fof(redefinition_k2_nat_1, axiom, ![X1, X2]:((m1_subset_1(X1,k4_ordinal1)&m1_subset_1(X2,k4_ordinal1))=>k2_nat_1(X1,X2)=k3_xcmplx_0(X1,X2)), file('number15/number15__l1_number15', redefinition_k2_nat_1)).
fof(l1_number15, conjecture, k11_newton(np__2,np__2)=k2_nat_1(np__2,np__2), file('number15/number15__l1_number15', l1_number15)).
fof(c_0_8, plain, ![X11]:(~m1_subset_1(X11,k4_ordinal1)|v7_ordinal1(X11)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_9, plain, ![X10]:(~v7_ordinal1(X10)|v1_xcmplx_0(X10)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_xcmplx_0])])).
cnf(c_0_10, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_11, plain, (m1_subset_1(np__2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc2_numerals])).
fof(c_0_12, plain, ![X12, X13]:(~m1_subset_1(X12,k4_ordinal1)|~m1_subset_1(X13,k4_ordinal1)|k11_newton(X12,X13)=k1_newton(X12,X13)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k11_newton])])).
fof(c_0_13, plain, ![X16]:((k1_newton(X16,np__2)=k3_xcmplx_0(X16,X16)|~v1_xcmplx_0(X16))&(k1_square_1(X16)=k1_newton(X16,np__2)|~v1_xcmplx_0(X16))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t81_newton])])])).
cnf(c_0_14, plain, (v1_xcmplx_0(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_15, plain, (v7_ordinal1(np__2)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
cnf(c_0_16, plain, (k11_newton(X1,X2)=k1_newton(X1,X2)|~m1_subset_1(X1,k4_ordinal1)|~m1_subset_1(X2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_17, plain, (k1_newton(X1,np__2)=k3_xcmplx_0(X1,X1)|~v1_xcmplx_0(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_18, plain, (v1_xcmplx_0(np__2)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_19, plain, (k3_xcmplx_0(np__2,np__2)=np__4), inference(split_conjunct,[status(thm)],[rqRealMult__k3_xcmplx_0__r2_r2_r4])).
fof(c_0_20, plain, ![X14, X15]:(~m1_subset_1(X14,k4_ordinal1)|~m1_subset_1(X15,k4_ordinal1)|k2_nat_1(X14,X15)=k3_xcmplx_0(X14,X15)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k2_nat_1])])).
fof(c_0_21, negated_conjecture, k11_newton(np__2,np__2)!=k2_nat_1(np__2,np__2), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l1_number15])])).
cnf(c_0_22, plain, (k11_newton(X1,np__2)=k1_newton(X1,np__2)|~m1_subset_1(X1,k4_ordinal1)), inference(spm,[status(thm)],[c_0_16, c_0_11])).
cnf(c_0_23, plain, (k1_newton(np__2,np__2)=np__4), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])).
cnf(c_0_24, plain, (k2_nat_1(X1,X2)=k3_xcmplx_0(X1,X2)|~m1_subset_1(X1,k4_ordinal1)|~m1_subset_1(X2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_25, negated_conjecture, (k11_newton(np__2,np__2)!=k2_nat_1(np__2,np__2)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_26, plain, (k11_newton(np__2,np__2)=np__4), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_11]), c_0_23])).
cnf(c_0_27, plain, (k2_nat_1(X1,np__2)=k3_xcmplx_0(X1,np__2)|~m1_subset_1(X1,k4_ordinal1)), inference(spm,[status(thm)],[c_0_24, c_0_11])).
cnf(c_0_28, negated_conjecture, (k2_nat_1(np__2,np__2)!=np__4), inference(rw,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_29, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_11]), c_0_19]), c_0_28]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 30
# Proof object clause steps            : 16
# Proof object formula steps           : 14
# Proof object conjectures             : 4
# Proof object clause conjectures      : 2
# Proof object formula conjectures     : 2
# Proof object initial clauses used    : 8
# 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                      : 10
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 10
# Processed clauses                    : 30
# ...of these trivial                  : 1
# ...subsumed                          : 0
# ...remaining for further processing  : 28
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 12
# ...of the previous two non-trivial   : 10
# 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  : 17
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 8
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 11
# Clause-clause subsumption calls (NU) : 2
# Rec. Clause-clause subsumption calls : 2
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 3
# 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          : 774

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.000 s
# Total time               : 0.021 s
# Maximum resident set size: 3648 pages
