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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d2_e_trans1, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>k2_e_trans1(X1,X2)=k7_xcmplx_0(k2_newton(X1),k2_newton(k7_nat_d(X1,X2))))), file('e_trans2/e_trans2__l9_e_trans2', d2_e_trans1)).
fof(redefinition_k7_nat_d, axiom, ![X1, X2]:((v7_ordinal1(X1)&v7_ordinal1(X2))=>k7_nat_d(X1,X2)=k1_xreal_0(X1,X2)), file('e_trans2/e_trans2__l9_e_trans2', redefinition_k7_nat_d)).
fof(t232_xreal_1, axiom, ![X1]:(v1_xreal_0(X1)=>k1_xreal_0(X1,X1)=k5_numbers), file('e_trans2/e_trans2__l9_e_trans2', t232_xreal_1)).
fof(cc2_xreal_0, axiom, ![X1]:(v7_ordinal1(X1)=>v1_xreal_0(X1)), file('e_trans2/e_trans2__l9_e_trans2', cc2_xreal_0)).
fof(t6_arithm, axiom, ![X1]:(v1_xcmplx_0(X1)=>k7_xcmplx_0(X1,np__1)=X1), file('e_trans2/e_trans2__l9_e_trans2', t6_arithm)).
fof(t12_newton, axiom, k2_newton(k5_numbers)=np__1, file('e_trans2/e_trans2__l9_e_trans2', t12_newton)).
fof(l9_e_trans2, conjecture, ![X1]:(v7_ordinal1(X1)=>k2_e_trans1(X1,X1)=k2_newton(X1)), file('e_trans2/e_trans2__l9_e_trans2', l9_e_trans2)).
fof(cc1_xcmplx_0, axiom, ![X1]:(v7_ordinal1(X1)=>v1_xcmplx_0(X1)), file('e_trans2/e_trans2__l9_e_trans2', cc1_xcmplx_0)).
fof(fc7_newton, axiom, ![X1]:(v7_ordinal1(X1)=>v7_ordinal1(k2_newton(X1))), file('e_trans2/e_trans2__l9_e_trans2', fc7_newton)).
fof(c_0_9, plain, ![X16, X17]:(~v7_ordinal1(X16)|(~v7_ordinal1(X17)|k2_e_trans1(X16,X17)=k7_xcmplx_0(k2_newton(X16),k2_newton(k7_nat_d(X16,X17))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_e_trans1])])])).
fof(c_0_10, plain, ![X19, X20]:(~v7_ordinal1(X19)|~v7_ordinal1(X20)|k7_nat_d(X19,X20)=k1_xreal_0(X19,X20)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k7_nat_d])])).
cnf(c_0_11, plain, (k2_e_trans1(X1,X2)=k7_xcmplx_0(k2_newton(X1),k2_newton(k7_nat_d(X1,X2)))|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_12, plain, (k7_nat_d(X1,X2)=k1_xreal_0(X1,X2)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
fof(c_0_13, plain, ![X21]:(~v1_xreal_0(X21)|k1_xreal_0(X21,X21)=k5_numbers), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t232_xreal_1])])).
fof(c_0_14, plain, ![X15]:(~v7_ordinal1(X15)|v1_xreal_0(X15)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_xreal_0])])).
fof(c_0_15, plain, ![X22]:(~v1_xcmplx_0(X22)|k7_xcmplx_0(X22,np__1)=X22), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_arithm])])).
cnf(c_0_16, plain, (k7_xcmplx_0(k2_newton(X1),k2_newton(k1_xreal_0(X1,X2)))=k2_e_trans1(X1,X2)|~v7_ordinal1(X2)|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_17, plain, (k1_xreal_0(X1,X1)=k5_numbers|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_18, plain, (k2_newton(k5_numbers)=np__1), inference(split_conjunct,[status(thm)],[t12_newton])).
cnf(c_0_19, plain, (v1_xreal_0(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
fof(c_0_20, negated_conjecture, ~(![X1]:(v7_ordinal1(X1)=>k2_e_trans1(X1,X1)=k2_newton(X1))), inference(assume_negation,[status(cth)],[l9_e_trans2])).
cnf(c_0_21, plain, (k7_xcmplx_0(X1,np__1)=X1|~v1_xcmplx_0(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_22, plain, (k7_xcmplx_0(k2_newton(X1),np__1)=k2_e_trans1(X1,X1)|~v7_ordinal1(X1)), inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_19])).
fof(c_0_23, plain, ![X14]:(~v7_ordinal1(X14)|v1_xcmplx_0(X14)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_xcmplx_0])])).
fof(c_0_24, plain, ![X18]:(~v7_ordinal1(X18)|v7_ordinal1(k2_newton(X18))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc7_newton])])).
fof(c_0_25, negated_conjecture, (v7_ordinal1(esk1_0)&k2_e_trans1(esk1_0,esk1_0)!=k2_newton(esk1_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])).
cnf(c_0_26, plain, (k2_e_trans1(X1,X1)=k2_newton(X1)|~v1_xcmplx_0(k2_newton(X1))|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_27, plain, (v1_xcmplx_0(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_28, plain, (v7_ordinal1(k2_newton(X1))|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_29, negated_conjecture, (k2_e_trans1(esk1_0,esk1_0)!=k2_newton(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_30, plain, (k2_e_trans1(X1,X1)=k2_newton(X1)|~v7_ordinal1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])).
cnf(c_0_31, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_32, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 33
# Proof object clause steps            : 15
# Proof object formula steps           : 18
# Proof object conjectures             : 6
# Proof object clause conjectures      : 3
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 5
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# 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                  : 0
# ...subsumed                          : 2
# ...remaining for further processing  : 28
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 15
# ...of the previous two non-trivial   : 12
# Contextual simplify-reflections      : 3
# Paramodulations                      : 15
# 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  : 2
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 14
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 6
# Current number of archived formulas  : 0
# Current number of archived clauses   : 11
# Clause-clause subsumption calls (NU) : 53
# Rec. Clause-clause subsumption calls : 53
# Non-unit clause-clause subsumptions  : 6
# Unit Clause-clause subsumption calls : 0
# 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          : 992

# -------------------------------------------------
# User time                : 0.025 s
# System time              : 0.000 s
# Total time               : 0.025 s
# Maximum resident set size: 3020 pages
