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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t2_polyeq_5, axiom, ![X1]:(v1_xcmplx_0(X1)=>k3_xcmplx_0(k3_xcmplx_0(X1,X1),X1)=k1_newton(X1,np__3)), file('number14/number14__l2_number14', t2_polyeq_5)).
fof(l2_number14, conjecture, k11_newton(np__2,np__3)=k2_nat_1(k2_nat_1(np__2,np__2),np__2), file('number14/number14__l2_number14', l2_number14)).
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('number14/number14__l2_number14', redefinition_k2_nat_1)).
fof(rqRealMult__k3_xcmplx_0__r2_r2_r4, axiom, k3_xcmplx_0(np__2,np__2)=np__4, file('number14/number14__l2_number14', rqRealMult__k3_xcmplx_0__r2_r2_r4)).
fof(rqRealMult__k3_xcmplx_0__r4_r2_r8, axiom, k3_xcmplx_0(np__4,np__2)=np__8, file('number14/number14__l2_number14', rqRealMult__k3_xcmplx_0__r4_r2_r8)).
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('number14/number14__l2_number14', redefinition_k11_newton)).
fof(spc2_numerals, axiom, (v2_xxreal_0(np__2)&m1_subset_1(np__2,k4_ordinal1)), file('number14/number14__l2_number14', spc2_numerals)).
fof(spc3_numerals, axiom, (v2_xxreal_0(np__3)&m1_subset_1(np__3,k4_ordinal1)), file('number14/number14__l2_number14', spc3_numerals)).
fof(cc1_xcmplx_0, axiom, ![X1]:(v7_ordinal1(X1)=>v1_xcmplx_0(X1)), file('number14/number14__l2_number14', cc1_xcmplx_0)).
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('number14/number14__l2_number14', cc8_ordinal1)).
fof(dt_k2_nat_1, axiom, ![X1, X2]:((m1_subset_1(X1,k4_ordinal1)&m1_subset_1(X2,k4_ordinal1))=>m1_subset_1(k2_nat_1(X1,X2),k4_ordinal1)), file('number14/number14__l2_number14', dt_k2_nat_1)).
fof(c_0_11, plain, ![X20]:(~v1_xcmplx_0(X20)|k3_xcmplx_0(k3_xcmplx_0(X20,X20),X20)=k1_newton(X20,np__3)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_polyeq_5])])).
fof(c_0_12, negated_conjecture, k11_newton(np__2,np__3)!=k2_nat_1(k2_nat_1(np__2,np__2),np__2), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l2_number14])])).
fof(c_0_13, plain, ![X16, X17]:(~m1_subset_1(X16,k4_ordinal1)|~m1_subset_1(X17,k4_ordinal1)|k2_nat_1(X16,X17)=k3_xcmplx_0(X16,X17)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k2_nat_1])])).
cnf(c_0_14, plain, (k3_xcmplx_0(k3_xcmplx_0(X1,X1),X1)=k1_newton(X1,np__3)|~v1_xcmplx_0(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_15, plain, (k3_xcmplx_0(np__2,np__2)=np__4), inference(split_conjunct,[status(thm)],[rqRealMult__k3_xcmplx_0__r2_r2_r4])).
cnf(c_0_16, plain, (k3_xcmplx_0(np__4,np__2)=np__8), inference(split_conjunct,[status(thm)],[rqRealMult__k3_xcmplx_0__r4_r2_r8])).
fof(c_0_17, plain, ![X14, X15]:(~m1_subset_1(X14,k4_ordinal1)|~m1_subset_1(X15,k4_ordinal1)|k11_newton(X14,X15)=k1_newton(X14,X15)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k11_newton])])).
cnf(c_0_18, negated_conjecture, (k11_newton(np__2,np__3)!=k2_nat_1(k2_nat_1(np__2,np__2),np__2)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_19, 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_13])).
cnf(c_0_20, plain, (m1_subset_1(np__2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc2_numerals])).
cnf(c_0_21, plain, (k1_newton(np__2,np__3)=np__8|~v1_xcmplx_0(np__2)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])).
cnf(c_0_22, 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_17])).
cnf(c_0_23, plain, (m1_subset_1(np__3,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc3_numerals])).
fof(c_0_24, plain, ![X12]:(~v7_ordinal1(X12)|v1_xcmplx_0(X12)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_xcmplx_0])])).
fof(c_0_25, plain, ![X13]:(~m1_subset_1(X13,k4_ordinal1)|v7_ordinal1(X13)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
cnf(c_0_26, negated_conjecture, (k11_newton(np__2,np__3)!=k2_nat_1(np__4,np__2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_15]), c_0_20])])).
cnf(c_0_27, plain, (k11_newton(np__2,np__3)=np__8|~v1_xcmplx_0(np__2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_20])])).
cnf(c_0_28, plain, (v1_xcmplx_0(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_29, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_25])).
fof(c_0_30, plain, ![X18, X19]:(~m1_subset_1(X18,k4_ordinal1)|~m1_subset_1(X19,k4_ordinal1)|m1_subset_1(k2_nat_1(X18,X19),k4_ordinal1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_nat_1])])).
cnf(c_0_31, negated_conjecture, (k2_nat_1(np__4,np__2)!=np__8|~v1_xcmplx_0(np__2)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_32, plain, (v1_xcmplx_0(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
cnf(c_0_33, plain, (m1_subset_1(k2_nat_1(X1,X2),k4_ordinal1)|~m1_subset_1(X1,k4_ordinal1)|~m1_subset_1(X2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_34, negated_conjecture, (k2_nat_1(np__4,np__2)!=np__8), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_20])])).
cnf(c_0_35, plain, (m1_subset_1(k3_xcmplx_0(X1,X2),k4_ordinal1)|~m1_subset_1(X2,k4_ordinal1)|~m1_subset_1(X1,k4_ordinal1)), inference(spm,[status(thm)],[c_0_33, c_0_19])).
cnf(c_0_36, negated_conjecture, (~m1_subset_1(np__4,k4_ordinal1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_19]), c_0_16]), c_0_20])])).
cnf(c_0_37, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_15]), c_0_20])]), c_0_36]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 38
# Proof object clause steps            : 20
# Proof object formula steps           : 18
# Proof object conjectures             : 7
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 2
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 11
# Proof object generating inferences   : 9
# Proof object simplifying inferences  : 15
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 11
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 13
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 13
# Processed clauses                    : 36
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 35
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 13
# ...of the previous two non-trivial   : 12
# Contextual simplify-reflections      : 0
# Paramodulations                      : 13
# 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  : 22
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 4
#    Non-unit-clauses                  : 12
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 13
# Clause-clause subsumption calls (NU) : 52
# Rec. Clause-clause subsumption calls : 52
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 8
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 0
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1030

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.002 s
# Total time               : 0.022 s
# Maximum resident set size: 2900 pages
