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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t35_number15, conjecture, ![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>~((k4_nat_d(X2,np__4)=np__3&r1_nat_d(X2,k1_newton(np__5,X1)))))), file('number15/number15__t35_number15', t35_number15)).
fof(t34_number15, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>(r1_nat_d(X1,k1_newton(np__5,X2))=>k4_nat_d(X1,np__4)=np__1))), file('number15/number15__t35_number15', t34_number15)).
fof(rqLessOrEqual__r1_xxreal_0__rm1_rnm3d2, axiom, ~(r1_xxreal_0(k4_xcmplx_0(np__1),k7_xcmplx_0(k4_xcmplx_0(np__3),np__2))), file('number15/number15__t35_number15', rqLessOrEqual__r1_xxreal_0__rm1_rnm3d2)).
fof(rqLessOrEqual__r1_xxreal_0__rm1_rnm1d2, axiom, r1_xxreal_0(k4_xcmplx_0(np__1),k7_xcmplx_0(k4_xcmplx_0(np__1),np__2)), file('number15/number15__t35_number15', rqLessOrEqual__r1_xxreal_0__rm1_rnm1d2)).
fof(c_0_4, negated_conjecture, ~(![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>~((k4_nat_d(X2,np__4)=np__3&r1_nat_d(X2,k1_newton(np__5,X1))))))), inference(assume_negation,[status(cth)],[t35_number15])).
fof(c_0_5, plain, ![X9, X10]:(~v7_ordinal1(X9)|(~v7_ordinal1(X10)|(~r1_nat_d(X9,k1_newton(np__5,X10))|k4_nat_d(X9,np__4)=np__1))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t34_number15])])])).
fof(c_0_6, negated_conjecture, (v7_ordinal1(esk1_0)&(v7_ordinal1(esk2_0)&(k4_nat_d(esk2_0,np__4)=np__3&r1_nat_d(esk2_0,k1_newton(np__5,esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
cnf(c_0_7, plain, (k4_nat_d(X1,np__4)=np__1|~v7_ordinal1(X1)|~v7_ordinal1(X2)|~r1_nat_d(X1,k1_newton(np__5,X2))), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_8, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
fof(c_0_9, plain, ~r1_xxreal_0(k4_xcmplx_0(np__1),k7_xcmplx_0(k4_xcmplx_0(np__3),np__2)), inference(fof_simplification,[status(thm)],[rqLessOrEqual__r1_xxreal_0__rm1_rnm3d2])).
cnf(c_0_10, negated_conjecture, (k4_nat_d(X1,np__4)=np__1|~r1_nat_d(X1,k1_newton(np__5,esk1_0))|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_7, c_0_8])).
cnf(c_0_11, negated_conjecture, (v7_ordinal1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_12, negated_conjecture, (k4_nat_d(esk2_0,np__4)=np__3), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_13, negated_conjecture, (r1_nat_d(esk2_0,k1_newton(np__5,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_14, plain, (~r1_xxreal_0(k4_xcmplx_0(np__1),k7_xcmplx_0(k4_xcmplx_0(np__3),np__2))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_15, negated_conjecture, (np__1=np__3), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10, c_0_11]), c_0_12]), c_0_13])])).
cnf(c_0_16, plain, (r1_xxreal_0(k4_xcmplx_0(np__1),k7_xcmplx_0(k4_xcmplx_0(np__1),np__2))), inference(split_conjunct,[status(thm)],[rqLessOrEqual__r1_xxreal_0__rm1_rnm1d2])).
cnf(c_0_17, plain, (~r1_xxreal_0(k4_xcmplx_0(np__3),k7_xcmplx_0(k4_xcmplx_0(np__3),np__2))), inference(rw,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_18, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_15]), c_0_15]), c_0_17]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 19
# Proof object clause steps            : 11
# Proof object formula steps           : 8
# Proof object conjectures             : 9
# Proof object clause conjectures      : 6
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 7
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 7
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 7
# Processed clauses                    : 26
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 24
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 6
# Generated clauses                    : 10
# ...of the previous two non-trivial   : 14
# Contextual simplify-reflections      : 0
# Paramodulations                      : 10
# 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  : 10
#    Positive orientable unit clauses  : 5
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 4
# Current number of archived formulas  : 0
# Current number of archived clauses   : 14
# Clause-clause subsumption calls (NU) : 7
# Rec. Clause-clause subsumption calls : 5
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 1
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 2
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 645

# -------------------------------------------------
# User time                : 0.019 s
# System time              : 0.004 s
# Total time               : 0.023 s
# Maximum resident set size: 2944 pages
