# 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(d1_surrealn, axiom, ![X1]:((((v1_relat_1(X1)&v4_relat_1(X1,k4_numbers))&v1_funct_1(X1))&v1_partfun1(X1,k4_numbers))=>(X1=k1_surrealn<=>![X2]:(v7_ordinal1(X2)=>((k1_funct_1(X1,k5_numbers)=k11_surreal0&k1_funct_1(X1,k2_xcmplx_0(X2,np__1))=k4_tarski(k1_tarski(k1_funct_1(X1,X2)),k1_xboole_0))&k1_funct_1(X1,k4_xcmplx_0(k2_xcmplx_0(X2,np__1)))=k4_tarski(k1_xboole_0,k1_tarski(k1_funct_1(X1,k4_xcmplx_0(X2)))))))), file('surrealn/surrealn__t11_surrealn', d1_surrealn)).
fof(redefinition_k5_numbers, axiom, k5_numbers=k5_ordinal1, file('surrealn/surrealn__t11_surrealn', redefinition_k5_numbers)).
fof(d13_ordinal1, axiom, k5_ordinal1=k1_xboole_0, file('surrealn/surrealn__t11_surrealn', d13_ordinal1)).
fof(t6_boole, axiom, ![X1]:(v1_xboole_0(X1)=>X1=k1_xboole_0), file('surrealn/surrealn__t11_surrealn', t6_boole)).
fof(dt_k1_surrealn, axiom, (((v1_relat_1(k1_surrealn)&v4_relat_1(k1_surrealn,k4_numbers))&v1_funct_1(k1_surrealn))&v1_partfun1(k1_surrealn,k4_numbers)), file('surrealn/surrealn__t11_surrealn', dt_k1_surrealn)).
fof(fc8_ordinal1, axiom, v7_ordinal1(k5_ordinal1), file('surrealn/surrealn__t11_surrealn', fc8_ordinal1)).
fof(spc0_boole, axiom, v1_xboole_0(np__0), file('surrealn/surrealn__t11_surrealn', spc0_boole)).
fof(rqRealAdd__k2_xcmplx_0__r0_r1_r1, axiom, k2_xcmplx_0(np__0,np__1)=np__1, file('surrealn/surrealn__t11_surrealn', rqRealAdd__k2_xcmplx_0__r0_r1_r1)).
fof(t11_surrealn, conjecture, k1_funct_1(k1_surrealn,np__1)=k1_surrealo, file('surrealn/surrealn__t11_surrealn', t11_surrealn)).
fof(d1_surrealo, axiom, k1_surrealo=k4_tarski(k1_tarski(k11_surreal0),k1_xboole_0), file('surrealn/surrealn__t11_surrealn', d1_surrealo)).
fof(c_0_10, plain, ![X6, X7]:((((k1_funct_1(X6,k5_numbers)=k11_surreal0|~v7_ordinal1(X7)|X6!=k1_surrealn|(~v1_relat_1(X6)|~v4_relat_1(X6,k4_numbers)|~v1_funct_1(X6)|~v1_partfun1(X6,k4_numbers)))&(k1_funct_1(X6,k2_xcmplx_0(X7,np__1))=k4_tarski(k1_tarski(k1_funct_1(X6,X7)),k1_xboole_0)|~v7_ordinal1(X7)|X6!=k1_surrealn|(~v1_relat_1(X6)|~v4_relat_1(X6,k4_numbers)|~v1_funct_1(X6)|~v1_partfun1(X6,k4_numbers))))&(k1_funct_1(X6,k4_xcmplx_0(k2_xcmplx_0(X7,np__1)))=k4_tarski(k1_xboole_0,k1_tarski(k1_funct_1(X6,k4_xcmplx_0(X7))))|~v7_ordinal1(X7)|X6!=k1_surrealn|(~v1_relat_1(X6)|~v4_relat_1(X6,k4_numbers)|~v1_funct_1(X6)|~v1_partfun1(X6,k4_numbers))))&((v7_ordinal1(esk1_1(X6))|X6=k1_surrealn|(~v1_relat_1(X6)|~v4_relat_1(X6,k4_numbers)|~v1_funct_1(X6)|~v1_partfun1(X6,k4_numbers)))&(k1_funct_1(X6,k5_numbers)!=k11_surreal0|k1_funct_1(X6,k2_xcmplx_0(esk1_1(X6),np__1))!=k4_tarski(k1_tarski(k1_funct_1(X6,esk1_1(X6))),k1_xboole_0)|k1_funct_1(X6,k4_xcmplx_0(k2_xcmplx_0(esk1_1(X6),np__1)))!=k4_tarski(k1_xboole_0,k1_tarski(k1_funct_1(X6,k4_xcmplx_0(esk1_1(X6)))))|X6=k1_surrealn|(~v1_relat_1(X6)|~v4_relat_1(X6,k4_numbers)|~v1_funct_1(X6)|~v1_partfun1(X6,k4_numbers))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_surrealn])])])])])).
cnf(c_0_11, plain, (k5_numbers=k5_ordinal1), inference(split_conjunct,[status(thm)],[redefinition_k5_numbers])).
cnf(c_0_12, plain, (k5_ordinal1=k1_xboole_0), inference(split_conjunct,[status(thm)],[d13_ordinal1])).
fof(c_0_13, plain, ![X9]:(~v1_xboole_0(X9)|X9=k1_xboole_0), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])).
cnf(c_0_14, plain, (k1_funct_1(X1,k5_numbers)=k11_surreal0|~v7_ordinal1(X2)|X1!=k1_surrealn|~v1_relat_1(X1)|~v4_relat_1(X1,k4_numbers)|~v1_funct_1(X1)|~v1_partfun1(X1,k4_numbers)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_15, plain, (k5_numbers=k1_xboole_0), inference(rw,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_16, plain, (v1_partfun1(k1_surrealn,k4_numbers)), inference(split_conjunct,[status(thm)],[dt_k1_surrealn])).
cnf(c_0_17, plain, (v1_funct_1(k1_surrealn)), inference(split_conjunct,[status(thm)],[dt_k1_surrealn])).
cnf(c_0_18, plain, (v4_relat_1(k1_surrealn,k4_numbers)), inference(split_conjunct,[status(thm)],[dt_k1_surrealn])).
cnf(c_0_19, plain, (v1_relat_1(k1_surrealn)), inference(split_conjunct,[status(thm)],[dt_k1_surrealn])).
cnf(c_0_20, plain, (v7_ordinal1(k5_ordinal1)), inference(split_conjunct,[status(thm)],[fc8_ordinal1])).
cnf(c_0_21, plain, (X1=k1_xboole_0|~v1_xboole_0(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_22, plain, (v1_xboole_0(np__0)), inference(split_conjunct,[status(thm)],[spc0_boole])).
cnf(c_0_23, plain, (k1_funct_1(X1,k2_xcmplx_0(X2,np__1))=k4_tarski(k1_tarski(k1_funct_1(X1,X2)),k1_xboole_0)|~v7_ordinal1(X2)|X1!=k1_surrealn|~v1_relat_1(X1)|~v4_relat_1(X1,k4_numbers)|~v1_funct_1(X1)|~v1_partfun1(X1,k4_numbers)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_24, plain, (k1_funct_1(k1_surrealn,k1_xboole_0)=k11_surreal0|~v7_ordinal1(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)],[inference(rw,[status(thm)],[c_0_14, c_0_15])]), c_0_16]), c_0_17]), c_0_18]), c_0_19])])).
cnf(c_0_25, plain, (v7_ordinal1(k1_xboole_0)), inference(rw,[status(thm)],[c_0_20, c_0_12])).
cnf(c_0_26, plain, (k2_xcmplx_0(np__0,np__1)=np__1), inference(split_conjunct,[status(thm)],[rqRealAdd__k2_xcmplx_0__r0_r1_r1])).
cnf(c_0_27, plain, (np__0=k1_xboole_0), inference(spm,[status(thm)],[c_0_21, c_0_22])).
fof(c_0_28, negated_conjecture, k1_funct_1(k1_surrealn,np__1)!=k1_surrealo, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t11_surrealn])])).
cnf(c_0_29, plain, (k4_tarski(k1_tarski(k1_funct_1(k1_surrealn,X1)),k1_xboole_0)=k1_funct_1(k1_surrealn,k2_xcmplx_0(X1,np__1))|~v7_ordinal1(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_23]), c_0_16]), c_0_17]), c_0_18]), c_0_19])])).
cnf(c_0_30, plain, (k1_funct_1(k1_surrealn,k1_xboole_0)=k11_surreal0), inference(spm,[status(thm)],[c_0_24, c_0_25])).
cnf(c_0_31, plain, (k1_surrealo=k4_tarski(k1_tarski(k11_surreal0),k1_xboole_0)), inference(split_conjunct,[status(thm)],[d1_surrealo])).
cnf(c_0_32, plain, (k2_xcmplx_0(k1_xboole_0,np__1)=np__1), inference(rw,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_33, negated_conjecture, (k1_funct_1(k1_surrealn,np__1)!=k1_surrealo), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_34, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31]), c_0_32]), c_0_25])]), c_0_33]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 35
# Proof object clause steps            : 22
# Proof object formula steps           : 13
# Proof object conjectures             : 3
# Proof object clause conjectures      : 1
# Proof object formula conjectures     : 2
# Proof object initial clauses used    : 14
# Proof object initial formulas used   : 10
# Proof object generating inferences   : 3
# Proof object simplifying inferences  : 21
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 10
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 17
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 17
# Processed clauses                    : 39
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 39
# Other redundant clauses eliminated   : 3
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 3
# Generated clauses                    : 6
# ...of the previous two non-trivial   : 7
# Contextual simplify-reflections      : 0
# Paramodulations                      : 3
# 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  : 16
#    Positive orientable unit clauses  : 12
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 3
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 10
# Current number of archived formulas  : 0
# Current number of archived clauses   : 20
# Clause-clause subsumption calls (NU) : 25
# Rec. Clause-clause subsumption calls : 1
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 1239

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.007 s
# Total time               : 0.022 s
# Maximum resident set size: 2872 pages
