# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_SE_Q4_CS_SP_S0Y
# and selection function SelectMaxLComplexAvoidPosPred.
#
# Preprocessing time       : 0.027 s

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(l14_field_16, conjecture, ![X1]:((v7_ordinal1(X1)&~(v8_ordinal1(X1)))=>![X2]:(v7_ordinal1(X2)=>![X3]:(v7_ordinal1(X3)=>(r1_xxreal_0(X3,X2)=>r1_xxreal_0(k1_newton(X1,X3),k1_newton(X1,X2)))))), file('field_16/field_16__l14_field_16', l14_field_16)).
fof(cc8_xxreal_0, axiom, ![X1]:(((v1_xxreal_0(X1)&~(v2_xxreal_0(X1)))&~(v3_xxreal_0(X1)))=>(v8_ordinal1(X1)&v1_xxreal_0(X1))), file('field_16/field_16__l14_field_16', cc8_xxreal_0)).
fof(cc3_nat_1, axiom, ![X1]:(v7_ordinal1(X1)=>(v7_ordinal1(X1)&~(v3_xxreal_0(X1)))), file('field_16/field_16__l14_field_16', cc3_nat_1)).
fof(t1_nat_6, axiom, ![X1]:((v7_ordinal1(X1)&v2_xxreal_0(X1))=>![X2]:(v7_ordinal1(X2)=>![X3]:(v7_ordinal1(X3)=>(r1_xxreal_0(X3,X2)=>r1_xxreal_0(k1_newton(X1,X3),k1_newton(X1,X2)))))), file('field_16/field_16__l14_field_16', t1_nat_6)).
fof(cc2_xxreal_0, axiom, ![X1]:(v7_ordinal1(X1)=>v1_xxreal_0(X1)), file('field_16/field_16__l14_field_16', cc2_xxreal_0)).
fof(c_0_5, negated_conjecture, ~(![X1]:((v7_ordinal1(X1)&~v8_ordinal1(X1))=>![X2]:(v7_ordinal1(X2)=>![X3]:(v7_ordinal1(X3)=>(r1_xxreal_0(X3,X2)=>r1_xxreal_0(k1_newton(X1,X3),k1_newton(X1,X2))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l14_field_16])])).
fof(c_0_6, plain, ![X1]:(((v1_xxreal_0(X1)&~v2_xxreal_0(X1))&~v3_xxreal_0(X1))=>(v8_ordinal1(X1)&v1_xxreal_0(X1))), inference(fof_simplification,[status(thm)],[cc8_xxreal_0])).
fof(c_0_7, plain, ![X1]:(v7_ordinal1(X1)=>(v7_ordinal1(X1)&~v3_xxreal_0(X1))), inference(fof_simplification,[status(thm)],[cc3_nat_1])).
fof(c_0_8, negated_conjecture, ((v7_ordinal1(esk1_0)&~v8_ordinal1(esk1_0))&(v7_ordinal1(esk2_0)&(v7_ordinal1(esk3_0)&(r1_xxreal_0(esk3_0,esk2_0)&~r1_xxreal_0(k1_newton(esk1_0,esk3_0),k1_newton(esk1_0,esk2_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
fof(c_0_9, plain, ![X16]:((v8_ordinal1(X16)|(~v1_xxreal_0(X16)|v2_xxreal_0(X16)|v3_xxreal_0(X16)))&(v1_xxreal_0(X16)|(~v1_xxreal_0(X16)|v2_xxreal_0(X16)|v3_xxreal_0(X16)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
fof(c_0_10, plain, ![X19, X20, X21]:(~v7_ordinal1(X19)|~v2_xxreal_0(X19)|(~v7_ordinal1(X20)|(~v7_ordinal1(X21)|(~r1_xxreal_0(X21,X20)|r1_xxreal_0(k1_newton(X19,X21),k1_newton(X19,X20)))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_nat_6])])])).
fof(c_0_11, plain, ![X18]:((v7_ordinal1(X18)|~v7_ordinal1(X18))&(~v3_xxreal_0(X18)|~v7_ordinal1(X18))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
cnf(c_0_12, negated_conjecture, (~v8_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, plain, (v8_ordinal1(X1)|v2_xxreal_0(X1)|v3_xxreal_0(X1)|~v1_xxreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, negated_conjecture, (~r1_xxreal_0(k1_newton(esk1_0,esk3_0),k1_newton(esk1_0,esk2_0))), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_15, plain, (r1_xxreal_0(k1_newton(X1,X3),k1_newton(X1,X2))|~v7_ordinal1(X1)|~v2_xxreal_0(X1)|~v7_ordinal1(X2)|~v7_ordinal1(X3)|~r1_xxreal_0(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_16, negated_conjecture, (r1_xxreal_0(esk3_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_17, negated_conjecture, (v7_ordinal1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_18, negated_conjecture, (v7_ordinal1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_19, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_20, plain, (~v3_xxreal_0(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_21, negated_conjecture, (v3_xxreal_0(esk1_0)|v2_xxreal_0(esk1_0)|~v1_xxreal_0(esk1_0)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_22, negated_conjecture, (~v2_xxreal_0(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16]), c_0_17]), c_0_18]), c_0_19])])).
fof(c_0_23, plain, ![X17]:(~v7_ordinal1(X17)|v1_xxreal_0(X17)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_xxreal_0])])).
cnf(c_0_24, negated_conjecture, (~v1_xxreal_0(esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_19])]), c_0_22])).
cnf(c_0_25, plain, (v1_xxreal_0(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_26, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_19])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 27
# Proof object clause steps            : 14
# Proof object formula steps           : 13
# Proof object conjectures             : 13
# Proof object clause conjectures      : 10
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 10
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 12
# Removed in clause preprocessing      : 2
# Initial clauses in saturation        : 10
# Processed clauses                    : 13
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 13
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 4
# ...of the previous two non-trivial   : 3
# Contextual simplify-reflections      : 0
# Paramodulations                      : 4
# 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  : 13
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 4
#    Non-unit-clauses                  : 5
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 0
# Clause-clause subsumption calls (NU) : 8
# Rec. Clause-clause subsumption calls : 1
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 7
# 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          : 825

# -------------------------------------------------
# User time                : 0.028 s
# System time              : 0.003 s
# Total time               : 0.031 s
# Maximum resident set size: 2936 pages
