# 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(t74_surrealn, conjecture, ![X1]:(v3_ordinal1(X1)=>r2_tarski(k9_surrealn(X1),k10_surreal0(X1))), file('surrealn/surrealn__t74_surrealn', t74_surrealn)).
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__t74_surrealn', d18_surreal0)).
fof(dt_k12_surreal0, axiom, ![X1]:(v2_surreal0(X1)=>v3_ordinal1(k12_surreal0(X1))), file('surrealn/surrealn__t74_surrealn', dt_k12_surreal0)).
fof(dt_k9_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>((v2_surreal0(k9_surrealn(X1))&v2_surrealo(k9_surrealn(X1)))&v3_surrealn(k9_surrealn(X1)))), file('surrealn/surrealn__t74_surrealn', dt_k9_surrealn)).
fof(t73_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>(r2_surrealo(k9_surrealn(X1),k8_surrealn(X1))&k12_surreal0(k9_surrealn(X1))=X1)), file('surrealn/surrealn__t74_surrealn', t73_surrealn)).
fof(c_0_5, negated_conjecture, ~(![X1]:(v3_ordinal1(X1)=>r2_tarski(k9_surrealn(X1),k10_surreal0(X1)))), inference(assume_negation,[status(cth)],[t74_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, plain, ![X17]:(((v2_surreal0(k9_surrealn(X17))|~v3_ordinal1(X17))&(v2_surrealo(k9_surrealn(X17))|~v3_ordinal1(X17)))&(v3_surrealn(k9_surrealn(X17))|~v3_ordinal1(X17))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k9_surrealn])])])).
fof(c_0_9, negated_conjecture, (v3_ordinal1(esk1_0)&~r2_tarski(k9_surrealn(esk1_0),k10_surreal0(esk1_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
fof(c_0_10, plain, ![X18]:((r2_surrealo(k9_surrealn(X18),k8_surrealn(X18))|~v3_ordinal1(X18))&(k12_surreal0(k9_surrealn(X18))=X18|~v3_ordinal1(X18))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t73_surrealn])])])).
cnf(c_0_11, plain, (r2_tarski(X1,k10_surreal0(X2))|X2!=k12_surreal0(X1)|~v3_ordinal1(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_12, plain, (v3_ordinal1(k12_surreal0(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_13, plain, (v2_surreal0(k9_surrealn(X1))|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, negated_conjecture, (v3_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_15, plain, (k12_surreal0(k9_surrealn(X1))=X1|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_16, plain, (r2_tarski(X1,k10_surreal0(k12_surreal0(X1)))|~v2_surreal0(X1)), inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_11]), c_0_12])).
cnf(c_0_17, negated_conjecture, (v2_surreal0(k9_surrealn(esk1_0))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_18, negated_conjecture, (k12_surreal0(k9_surrealn(esk1_0))=esk1_0), inference(spm,[status(thm)],[c_0_15, c_0_14])).
cnf(c_0_19, negated_conjecture, (~r2_tarski(k9_surrealn(esk1_0),k10_surreal0(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_20, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_19]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 21
# Proof object clause steps            : 10
# Proof object formula steps           : 11
# Proof object conjectures             : 8
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 6
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 3
# Proof object simplifying inferences  : 4
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 13
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 13
# Processed clauses                    : 28
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 28
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 9
# ...of the previous two non-trivial   : 8
# Contextual simplify-reflections      : 2
# Paramodulations                      : 7
# 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  : 13
#    Positive orientable unit clauses  : 5
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 7
# Current number of unprocessed clauses: 6
# ...number of literals in the above   : 21
# Current number of archived formulas  : 0
# Current number of archived clauses   : 13
# Clause-clause subsumption calls (NU) : 36
# Rec. Clause-clause subsumption calls : 15
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 10
# 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          : 1071

# -------------------------------------------------
# User time                : 0.017 s
# System time              : 0.004 s
# Total time               : 0.021 s
# Maximum resident set size: 3036 pages
