# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_____0013_C18_F1_SE_CS_SP_S0Y
# and selection function SelectMaxLComplexAvoidPosPred.
#
# Preprocessing time       : 0.018 s

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t68_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>![X2]:(v3_ordinal1(X2)=>(~(r5_surreal0(k8_surrealn(X2),k8_surrealn(X1)))<=>r2_tarski(X1,X2)))), file('surrealn/surrealn__t70_surrealn', t68_surrealn)).
fof(redefinition_r1_surrealo, axiom, ![X1, X2]:((v2_surreal0(X1)&v2_surreal0(X2))=>(r1_surrealo(X1,X2)<=>r5_surreal0(X1,X2))), file('surrealn/surrealn__t70_surrealn', redefinition_r1_surrealo)).
fof(t69_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>![X2]:(v2_surreal0(X2)=>(r2_tarski(X2,k10_surreal0(X1))=>r1_surrealo(X2,k8_surrealn(X1))))), file('surrealn/surrealn__t70_surrealn', t69_surrealn)).
fof(fc23_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>v2_surreal0(k8_surrealn(X1))), file('surrealn/surrealn__t70_surrealn', fc23_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__t70_surrealn', d18_surreal0)).
fof(t16_ordinal1, axiom, ![X1]:(v3_ordinal1(X1)=>![X2]:(v3_ordinal1(X2)=>(r1_ordinal1(X1,X2)|r2_tarski(X2,X1)))), file('surrealn/surrealn__t70_surrealn', t16_ordinal1)).
fof(t70_surrealn, conjecture, ![X1]:(v3_ordinal1(X1)=>k12_surreal0(k8_surrealn(X1))=X1), file('surrealn/surrealn__t70_surrealn', t70_surrealn)).
fof(t67_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>r2_tarski(k8_surrealn(X1),k10_surreal0(X1))), file('surrealn/surrealn__t70_surrealn', t67_surrealn)).
fof(c_0_8, plain, ![X1]:(v3_ordinal1(X1)=>![X2]:(v3_ordinal1(X2)=>(~r5_surreal0(k8_surrealn(X2),k8_surrealn(X1))<=>r2_tarski(X1,X2)))), inference(fof_simplification,[status(thm)],[t68_surrealn])).
fof(c_0_9, plain, ![X24, X25]:((~r1_surrealo(X24,X25)|r5_surreal0(X24,X25)|(~v2_surreal0(X24)|~v2_surreal0(X25)))&(~r5_surreal0(X24,X25)|r1_surrealo(X24,X25)|(~v2_surreal0(X24)|~v2_surreal0(X25)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_surrealo])])])).
fof(c_0_10, plain, ![X31, X32]:(~v3_ordinal1(X31)|(~v2_surreal0(X32)|(~r2_tarski(X32,k10_surreal0(X31))|r1_surrealo(X32,k8_surrealn(X31))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t69_surrealn])])])).
fof(c_0_11, plain, ![X23]:(~v3_ordinal1(X23)|v2_surreal0(k8_surrealn(X23))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc23_surrealn])])).
fof(c_0_12, plain, ![X29, X30]:((r5_surreal0(k8_surrealn(X30),k8_surrealn(X29))|r2_tarski(X29,X30)|~v3_ordinal1(X30)|~v3_ordinal1(X29))&(~r2_tarski(X29,X30)|~r5_surreal0(k8_surrealn(X30),k8_surrealn(X29))|~v3_ordinal1(X30)|~v3_ordinal1(X29))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])).
cnf(c_0_13, plain, (r5_surreal0(X1,X2)|~r1_surrealo(X1,X2)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, plain, (r1_surrealo(X2,k8_surrealn(X1))|~v3_ordinal1(X1)|~v2_surreal0(X2)|~r2_tarski(X2,k10_surreal0(X1))), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_15, plain, (v2_surreal0(k8_surrealn(X1))|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_16, plain, (~r2_tarski(X1,X2)|~r5_surreal0(k8_surrealn(X2),k8_surrealn(X1))|~v3_ordinal1(X2)|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_17, plain, (r5_surreal0(X1,k8_surrealn(X2))|~r2_tarski(X1,k10_surreal0(X2))|~v2_surreal0(X1)|~v3_ordinal1(X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15])).
fof(c_0_18, plain, ![X19, X20, X21]:(((r2_tarski(X19,k10_surreal0(X20))|X20!=k12_surreal0(X19)|~v3_ordinal1(X20)|~v2_surreal0(X19))&(~v3_ordinal1(X21)|(~r2_tarski(X19,k10_surreal0(X21))|r1_ordinal1(X20,X21))|X20!=k12_surreal0(X19)|~v3_ordinal1(X20)|~v2_surreal0(X19)))&((v3_ordinal1(esk2_2(X19,X20))|~r2_tarski(X19,k10_surreal0(X20))|X20=k12_surreal0(X19)|~v3_ordinal1(X20)|~v2_surreal0(X19))&((r2_tarski(X19,k10_surreal0(esk2_2(X19,X20)))|~r2_tarski(X19,k10_surreal0(X20))|X20=k12_surreal0(X19)|~v3_ordinal1(X20)|~v2_surreal0(X19))&(~r1_ordinal1(X20,esk2_2(X19,X20))|~r2_tarski(X19,k10_surreal0(X20))|X20=k12_surreal0(X19)|~v3_ordinal1(X20)|~v2_surreal0(X19))))), 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_19, plain, ![X26, X27]:(~v3_ordinal1(X26)|(~v3_ordinal1(X27)|(r1_ordinal1(X26,X27)|r2_tarski(X27,X26)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_ordinal1])])])).
fof(c_0_20, negated_conjecture, ~(![X1]:(v3_ordinal1(X1)=>k12_surreal0(k8_surrealn(X1))=X1)), inference(assume_negation,[status(cth)],[t70_surrealn])).
cnf(c_0_21, plain, (~r2_tarski(k8_surrealn(X1),k10_surreal0(X2))|~r2_tarski(X2,X1)|~v3_ordinal1(X1)|~v3_ordinal1(X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_15])).
cnf(c_0_22, plain, (r2_tarski(X1,k10_surreal0(esk2_2(X1,X2)))|X2=k12_surreal0(X1)|~r2_tarski(X1,k10_surreal0(X2))|~v3_ordinal1(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_23, plain, (v3_ordinal1(esk2_2(X1,X2))|X2=k12_surreal0(X1)|~r2_tarski(X1,k10_surreal0(X2))|~v3_ordinal1(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_24, plain, (X1=k12_surreal0(X2)|~r1_ordinal1(X1,esk2_2(X2,X1))|~r2_tarski(X2,k10_surreal0(X1))|~v3_ordinal1(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_25, plain, (r1_ordinal1(X1,X2)|r2_tarski(X2,X1)|~v3_ordinal1(X1)|~v3_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_19])).
fof(c_0_26, plain, ![X28]:(~v3_ordinal1(X28)|r2_tarski(k8_surrealn(X28),k10_surreal0(X28))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t67_surrealn])])).
fof(c_0_27, negated_conjecture, (v3_ordinal1(esk1_0)&k12_surreal0(k8_surrealn(esk1_0))!=esk1_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])).
cnf(c_0_28, plain, (X1=k12_surreal0(k8_surrealn(X2))|~r2_tarski(esk2_2(k8_surrealn(X2),X1),X2)|~r2_tarski(k8_surrealn(X2),k10_surreal0(X1))|~v3_ordinal1(X2)|~v3_ordinal1(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_15])).
cnf(c_0_29, plain, (X1=k12_surreal0(X2)|r2_tarski(esk2_2(X2,X1),X1)|~r2_tarski(X2,k10_surreal0(X1))|~v2_surreal0(X2)|~v3_ordinal1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_23])).
cnf(c_0_30, plain, (r2_tarski(k8_surrealn(X1),k10_surreal0(X1))|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_31, negated_conjecture, (k12_surreal0(k8_surrealn(esk1_0))!=esk1_0), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_32, plain, (k12_surreal0(k8_surrealn(X1))=X1|~v3_ordinal1(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_15]), c_0_30])).
cnf(c_0_33, negated_conjecture, (v3_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_34, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_33])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 35
# Proof object clause steps            : 17
# Proof object formula steps           : 18
# Proof object conjectures             : 6
# Proof object clause conjectures      : 3
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 8
# Proof object generating inferences   : 6
# Proof object simplifying inferences  : 9
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 15
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 15
# Processed clauses                    : 25
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 25
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 17
# ...of the previous two non-trivial   : 13
# Contextual simplify-reflections      : 9
# Paramodulations                      : 15
# 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  : 23
#    Positive orientable unit clauses  : 1
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 21
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 0
# Clause-clause subsumption calls (NU) : 141
# Rec. Clause-clause subsumption calls : 25
# Non-unit clause-clause subsumptions  : 9
# 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          : 1793

# -------------------------------------------------
# User time                : 0.022 s
# System time              : 0.000 s
# Total time               : 0.022 s
# Maximum resident set size: 2904 pages
