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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d18_surreal0, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v3_ordinal1(X2)=>(X2=k12_surreal0(X1)<=>(r2_tarski(X1,k10_surreal0(X2))&![X3]:(v3_ordinal1(X3)=>(r2_tarski(X1,k10_surreal0(X3))=>r1_ordinal1(X2,X3))))))), file('surrealn/surrealn__t49_surrealn', d18_surreal0)).
fof(dt_k12_surreal0, axiom, ![X1]:(v2_surreal0(X1)=>v3_ordinal1(k12_surreal0(X1))), file('surrealn/surrealn__t49_surrealn', dt_k12_surreal0)).
fof(t49_surrealn, conjecture, ![X1]:(v1_xreal_0(X1)=>r1_ordinal1(k12_surreal0(k1_funct_1(k5_surrealn,X1)),k4_ordinal1)), file('surrealn/surrealn__t49_surrealn', t49_surrealn)).
fof(fc6_ordinal1, axiom, (~(v1_xboole_0(k4_ordinal1))&v3_ordinal1(k4_ordinal1)), file('surrealn/surrealn__t49_surrealn', fc6_ordinal1)).
fof(fc12_surrealn, axiom, ![X1]:(v1_xreal_0(X1)=>v2_surreal0(k1_funct_1(k5_surrealn,X1))), file('surrealn/surrealn__t49_surrealn', fc12_surrealn)).
fof(l57_surrealn, axiom, ![X1]:(v1_xreal_0(X1)=>r2_tarski(k1_funct_1(k5_surrealn,X1),k10_surreal0(k4_ordinal1))), file('surrealn/surrealn__t49_surrealn', l57_surrealn)).
fof(c_0_6, plain, ![X12, X13, X14]:(((r2_tarski(X12,k10_surreal0(X13))|X13!=k12_surreal0(X12)|~v3_ordinal1(X13)|~v2_surreal0(X12))&(~v3_ordinal1(X14)|(~r2_tarski(X12,k10_surreal0(X14))|r1_ordinal1(X13,X14))|X13!=k12_surreal0(X12)|~v3_ordinal1(X13)|~v2_surreal0(X12)))&((v3_ordinal1(esk2_2(X12,X13))|~r2_tarski(X12,k10_surreal0(X13))|X13=k12_surreal0(X12)|~v3_ordinal1(X13)|~v2_surreal0(X12))&((r2_tarski(X12,k10_surreal0(esk2_2(X12,X13)))|~r2_tarski(X12,k10_surreal0(X13))|X13=k12_surreal0(X12)|~v3_ordinal1(X13)|~v2_surreal0(X12))&(~r1_ordinal1(X13,esk2_2(X12,X13))|~r2_tarski(X12,k10_surreal0(X13))|X13=k12_surreal0(X12)|~v3_ordinal1(X13)|~v2_surreal0(X12))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d18_surreal0])])])])])).
fof(c_0_7, plain, ![X16]:(~v2_surreal0(X16)|v3_ordinal1(k12_surreal0(X16))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k12_surreal0])])).
fof(c_0_8, negated_conjecture, ~(![X1]:(v1_xreal_0(X1)=>r1_ordinal1(k12_surreal0(k1_funct_1(k5_surrealn,X1)),k4_ordinal1))), inference(assume_negation,[status(cth)],[t49_surrealn])).
cnf(c_0_9, plain, (r1_ordinal1(X3,X1)|~v3_ordinal1(X1)|~r2_tarski(X2,k10_surreal0(X1))|X3!=k12_surreal0(X2)|~v3_ordinal1(X3)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10, plain, (v3_ordinal1(k12_surreal0(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_11, plain, (~v1_xboole_0(k4_ordinal1)&v3_ordinal1(k4_ordinal1)), inference(fof_simplification,[status(thm)],[fc6_ordinal1])).
fof(c_0_12, plain, ![X17]:(~v1_xreal_0(X17)|v2_surreal0(k1_funct_1(k5_surrealn,X17))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc12_surrealn])])).
fof(c_0_13, negated_conjecture, (v1_xreal_0(esk1_0)&~r1_ordinal1(k12_surreal0(k1_funct_1(k5_surrealn,esk1_0)),k4_ordinal1)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
fof(c_0_14, plain, ![X18]:(~v1_xreal_0(X18)|r2_tarski(k1_funct_1(k5_surrealn,X18),k10_surreal0(k4_ordinal1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l57_surrealn])])).
cnf(c_0_15, plain, (r1_ordinal1(k12_surreal0(X1),X2)|~r2_tarski(X1,k10_surreal0(X2))|~v3_ordinal1(X2)|~v2_surreal0(X1)), inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_9]), c_0_10])).
cnf(c_0_16, plain, (v3_ordinal1(k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_17, plain, (v2_surreal0(k1_funct_1(k5_surrealn,X1))|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, negated_conjecture, (v1_xreal_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_19, plain, (r2_tarski(k1_funct_1(k5_surrealn,X1),k10_surreal0(k4_ordinal1))|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_20, plain, (r1_ordinal1(k12_surreal0(X1),k4_ordinal1)|~r2_tarski(X1,k10_surreal0(k4_ordinal1))|~v2_surreal0(X1)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_21, negated_conjecture, (v2_surreal0(k1_funct_1(k5_surrealn,esk1_0))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
cnf(c_0_22, negated_conjecture, (r2_tarski(k1_funct_1(k5_surrealn,esk1_0),k10_surreal0(k4_ordinal1))), inference(spm,[status(thm)],[c_0_19, c_0_18])).
cnf(c_0_23, negated_conjecture, (~r1_ordinal1(k12_surreal0(k1_funct_1(k5_surrealn,esk1_0)),k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_24, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])]), c_0_23]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 25
# Proof object clause steps            : 12
# Proof object formula steps           : 13
# Proof object conjectures             : 8
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 7
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 12
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 12
# Processed clauses                    : 32
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 32
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 16
# ...of the previous two non-trivial   : 15
# Contextual simplify-reflections      : 2
# Paramodulations                      : 14
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 2
# 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  : 18
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 10
# Current number of unprocessed clauses: 7
# ...number of literals in the above   : 25
# Current number of archived formulas  : 0
# Current number of archived clauses   : 12
# Clause-clause subsumption calls (NU) : 36
# Rec. Clause-clause subsumption calls : 8
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 6
# 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          : 1278

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.002 s
# Total time               : 0.021 s
# Maximum resident set size: 2948 pages
