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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t43_surrealn, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v1_xreal_0(X2)=>(r2_tarski(X1,k2_surreal0(k1_funct_1(k5_surrealn,X2)))<=>?[X3]:(v7_ordinal1(X3)&X1=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(X2,k1_newton(np__2,X3)),np__1)),k1_newton(np__2,X3))))))), file('surrealn/surrealn__t43_surrealn', t43_surrealn)).
fof(rd2_xtuple_0, axiom, ![X1, X2]:k2_xtuple_0(k4_tarski(X1,X2))=X2, file('surrealn/surrealn__t43_surrealn', rd2_xtuple_0)).
fof(redefinition_k2_surreal0, axiom, ![X1]:k2_surreal0(X1)=k2_xtuple_0(X1), file('surrealn/surrealn__t43_surrealn', redefinition_k2_surreal0)).
fof(d6_surrealn, axiom, ![X1]:((((v1_relat_1(X1)&v4_relat_1(X1,k1_numbers))&v1_funct_1(X1))&v1_partfun1(X1,k1_numbers))=>(X1=k5_surrealn<=>![X2]:(v1_xreal_0(X2)=>k1_funct_1(X1,X2)=k4_tarski(a_1_0_surrealn(X2),a_1_1_surrealn(X2))))), file('surrealn/surrealn__t43_surrealn', d6_surrealn)).
fof(fraenkel_a_1_1_surrealn, axiom, ![X1, X2]:(v1_xreal_0(X2)=>(r2_hidden(X1,a_1_1_surrealn(X2))<=>?[X3]:(v7_ordinal1(X3)&X1=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(X2,k1_newton(np__2,X3)),np__1)),k1_newton(np__2,X3)))))), file('surrealn/surrealn__t43_surrealn', fraenkel_a_1_1_surrealn)).
fof(dt_k5_surrealn, axiom, (((v1_relat_1(k5_surrealn)&v4_relat_1(k5_surrealn,k1_numbers))&v1_funct_1(k5_surrealn))&v1_partfun1(k5_surrealn,k1_numbers)), file('surrealn/surrealn__t43_surrealn', dt_k5_surrealn)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('surrealn/surrealn__t43_surrealn', redefinition_r2_tarski)).
fof(c_0_7, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v1_xreal_0(X2)=>(r2_tarski(X1,k2_surreal0(k1_funct_1(k5_surrealn,X2)))<=>?[X3]:(v7_ordinal1(X3)&X1=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(X2,k1_newton(np__2,X3)),np__1)),k1_newton(np__2,X3)))))))), inference(assume_negation,[status(cth)],[t43_surrealn])).
fof(c_0_8, plain, ![X28, X29]:k2_xtuple_0(k4_tarski(X28,X29))=X29, inference(variable_rename,[status(thm)],[rd2_xtuple_0])).
fof(c_0_9, plain, ![X30]:k2_surreal0(X30)=k2_xtuple_0(X30), inference(variable_rename,[status(thm)],[redefinition_k2_surreal0])).
fof(c_0_10, plain, ![X21, X22]:((X21!=k5_surrealn|(~v1_xreal_0(X22)|k1_funct_1(X21,X22)=k4_tarski(a_1_0_surrealn(X22),a_1_1_surrealn(X22)))|(~v1_relat_1(X21)|~v4_relat_1(X21,k1_numbers)|~v1_funct_1(X21)|~v1_partfun1(X21,k1_numbers)))&((v1_xreal_0(esk4_1(X21))|X21=k5_surrealn|(~v1_relat_1(X21)|~v4_relat_1(X21,k1_numbers)|~v1_funct_1(X21)|~v1_partfun1(X21,k1_numbers)))&(k1_funct_1(X21,esk4_1(X21))!=k4_tarski(a_1_0_surrealn(esk4_1(X21)),a_1_1_surrealn(esk4_1(X21)))|X21=k5_surrealn|(~v1_relat_1(X21)|~v4_relat_1(X21,k1_numbers)|~v1_funct_1(X21)|~v1_partfun1(X21,k1_numbers))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d6_surrealn])])])])])).
fof(c_0_11, negated_conjecture, ![X19]:(v2_surreal0(esk1_0)&(v1_xreal_0(esk2_0)&((~r2_tarski(esk1_0,k2_surreal0(k1_funct_1(k5_surrealn,esk2_0)))|(~v7_ordinal1(X19)|esk1_0!=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(esk2_0,k1_newton(np__2,X19)),np__1)),k1_newton(np__2,X19)))))&((v7_ordinal1(esk3_0)|r2_tarski(esk1_0,k2_surreal0(k1_funct_1(k5_surrealn,esk2_0))))&(esk1_0=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(esk2_0,k1_newton(np__2,esk3_0)),np__1)),k1_newton(np__2,esk3_0)))|r2_tarski(esk1_0,k2_surreal0(k1_funct_1(k5_surrealn,esk2_0)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])).
fof(c_0_12, plain, ![X24, X25, X27]:(((v7_ordinal1(esk5_2(X24,X25))|~r2_hidden(X24,a_1_1_surrealn(X25))|~v1_xreal_0(X25))&(X24=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(X25,k1_newton(np__2,esk5_2(X24,X25))),np__1)),k1_newton(np__2,esk5_2(X24,X25))))|~r2_hidden(X24,a_1_1_surrealn(X25))|~v1_xreal_0(X25)))&(~v7_ordinal1(X27)|X24!=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(X25,k1_newton(np__2,X27)),np__1)),k1_newton(np__2,X27)))|r2_hidden(X24,a_1_1_surrealn(X25))|~v1_xreal_0(X25))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fraenkel_a_1_1_surrealn])])])])])).
cnf(c_0_13, plain, (k2_xtuple_0(k4_tarski(X1,X2))=X2), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, plain, (k2_surreal0(X1)=k2_xtuple_0(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_15, plain, (k1_funct_1(X1,X2)=k4_tarski(a_1_0_surrealn(X2),a_1_1_surrealn(X2))|X1!=k5_surrealn|~v1_xreal_0(X2)|~v1_relat_1(X1)|~v4_relat_1(X1,k1_numbers)|~v1_funct_1(X1)|~v1_partfun1(X1,k1_numbers)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_16, plain, (v1_partfun1(k5_surrealn,k1_numbers)), inference(split_conjunct,[status(thm)],[dt_k5_surrealn])).
cnf(c_0_17, plain, (v1_funct_1(k5_surrealn)), inference(split_conjunct,[status(thm)],[dt_k5_surrealn])).
cnf(c_0_18, plain, (v4_relat_1(k5_surrealn,k1_numbers)), inference(split_conjunct,[status(thm)],[dt_k5_surrealn])).
cnf(c_0_19, plain, (v1_relat_1(k5_surrealn)), inference(split_conjunct,[status(thm)],[dt_k5_surrealn])).
cnf(c_0_20, negated_conjecture, (~r2_tarski(esk1_0,k2_surreal0(k1_funct_1(k5_surrealn,esk2_0)))|~v7_ordinal1(X1)|esk1_0!=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(esk2_0,k1_newton(np__2,X1)),np__1)),k1_newton(np__2,X1)))), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_21, plain, (X1=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(X2,k1_newton(np__2,esk5_2(X1,X2))),np__1)),k1_newton(np__2,esk5_2(X1,X2))))|~r2_hidden(X1,a_1_1_surrealn(X2))|~v1_xreal_0(X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_22, negated_conjecture, (v1_xreal_0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_23, plain, (k2_surreal0(k4_tarski(X1,X2))=X2), inference(rw,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_24, plain, (k4_tarski(a_1_0_surrealn(X1),a_1_1_surrealn(X1))=k1_funct_1(k5_surrealn,X1)|~v1_xreal_0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_15]), c_0_16]), c_0_17]), c_0_18]), c_0_19])])).
fof(c_0_25, plain, ![X31, X32]:((~r2_tarski(X31,X32)|r2_hidden(X31,X32))&(~r2_hidden(X31,X32)|r2_tarski(X31,X32))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_26, plain, (r2_hidden(X2,a_1_1_surrealn(X3))|~v7_ordinal1(X1)|X2!=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(X3,k1_newton(np__2,X1)),np__1)),k1_newton(np__2,X1)))|~v1_xreal_0(X3)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_27, negated_conjecture, (~r2_hidden(esk1_0,a_1_1_surrealn(esk2_0))|~v7_ordinal1(esk5_2(esk1_0,esk2_0))|~r2_tarski(esk1_0,k2_surreal0(k1_funct_1(k5_surrealn,esk2_0)))), inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])])])).
cnf(c_0_28, plain, (k2_surreal0(k1_funct_1(k5_surrealn,X1))=a_1_1_surrealn(X1)|~v1_xreal_0(X1)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_29, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_30, plain, (r2_hidden(k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(X1,k1_newton(np__2,X2)),np__1)),k1_newton(np__2,X2))),a_1_1_surrealn(X1))|~v7_ordinal1(X2)|~v1_xreal_0(X1)), inference(er,[status(thm)],[c_0_26])).
cnf(c_0_31, negated_conjecture, (esk1_0=k1_funct_1(k4_surrealn,k7_xcmplx_0(k1_int_1(k2_xcmplx_0(k3_xcmplx_0(esk2_0,k1_newton(np__2,esk3_0)),np__1)),k1_newton(np__2,esk3_0)))|r2_tarski(esk1_0,k2_surreal0(k1_funct_1(k5_surrealn,esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_32, negated_conjecture, (v7_ordinal1(esk3_0)|r2_tarski(esk1_0,k2_surreal0(k1_funct_1(k5_surrealn,esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_33, negated_conjecture, (~r2_hidden(esk1_0,a_1_1_surrealn(esk2_0))|~v7_ordinal1(esk5_2(esk1_0,esk2_0))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_22])]), c_0_29])).
cnf(c_0_34, plain, (v7_ordinal1(esk5_2(X1,X2))|~r2_hidden(X1,a_1_1_surrealn(X2))|~v1_xreal_0(X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_35, negated_conjecture, (r2_hidden(esk1_0,a_1_1_surrealn(esk2_0))|r2_tarski(esk1_0,k2_surreal0(k1_funct_1(k5_surrealn,esk2_0)))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_22])]), c_0_32])).
cnf(c_0_36, negated_conjecture, (~r2_hidden(esk1_0,a_1_1_surrealn(esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_22])])).
cnf(c_0_37, plain, (r2_hidden(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_38, negated_conjecture, (r2_tarski(esk1_0,k2_surreal0(k1_funct_1(k5_surrealn,esk2_0)))), inference(sr,[status(thm)],[c_0_35, c_0_36])).
cnf(c_0_39, negated_conjecture, (~r2_tarski(esk1_0,a_1_1_surrealn(esk2_0))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
cnf(c_0_40, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_28]), c_0_22])]), c_0_39]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 41
# Proof object clause steps            : 27
# Proof object formula steps           : 14
# Proof object conjectures             : 14
# Proof object clause conjectures      : 11
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 16
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 23
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 19
# Removed in clause preprocessing      : 1
# Initial clauses in saturation        : 18
# Processed clauses                    : 47
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 47
# Other redundant clauses eliminated   : 3
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 3
# Generated clauses                    : 21
# ...of the previous two non-trivial   : 16
# Contextual simplify-reflections      : 2
# Paramodulations                      : 16
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 3
# 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  : 21
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 10
# Current number of unprocessed clauses: 4
# ...number of literals in the above   : 15
# Current number of archived formulas  : 0
# Current number of archived clauses   : 25
# Clause-clause subsumption calls (NU) : 159
# Rec. Clause-clause subsumption calls : 101
# Non-unit clause-clause subsumptions  : 3
# Unit Clause-clause subsumption calls : 19
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 2
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1998

# -------------------------------------------------
# User time                : 0.026 s
# System time              : 0.000 s
# Total time               : 0.026 s
# Maximum resident set size: 3580 pages
