# 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(d2_surrealo, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r2_surrealo(X1,X2)<=>(r1_surrealo(X1,X2)&r1_surrealo(X2,X1))))), file('surrealn/surrealn__t60_surrealn', d2_surrealo)).
fof(l88_surrealn, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r2_surrealo(X1,X2)=>r1_surrealo(k7_surrealn(X1),k7_surrealn(X2))))), file('surrealn/surrealn__t60_surrealn', l88_surrealn)).
fof(dt_k7_surrealn, axiom, ![X1]:(v2_surreal0(X1)=>v2_surreal0(k7_surrealn(X1))), file('surrealn/surrealn__t60_surrealn', dt_k7_surrealn)).
fof(t60_surrealn, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r2_surrealo(X1,X2)=>r2_surrealo(k7_surrealn(X1),k7_surrealn(X2))))), file('surrealn/surrealn__t60_surrealn', t60_surrealn)).
fof(symmetry_r2_surrealo, axiom, ![X1, X2]:((v2_surreal0(X1)&v2_surreal0(X2))=>(r2_surrealo(X1,X2)=>r2_surrealo(X2,X1))), file('surrealn/surrealn__t60_surrealn', symmetry_r2_surrealo)).
fof(c_0_5, plain, ![X17, X18]:(((r1_surrealo(X17,X18)|~r2_surrealo(X17,X18)|~v2_surreal0(X18)|~v2_surreal0(X17))&(r1_surrealo(X18,X17)|~r2_surrealo(X17,X18)|~v2_surreal0(X18)|~v2_surreal0(X17)))&(~r1_surrealo(X17,X18)|~r1_surrealo(X18,X17)|r2_surrealo(X17,X18)|~v2_surreal0(X18)|~v2_surreal0(X17))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_surrealo])])])])).
fof(c_0_6, plain, ![X19, X20]:(~v2_surreal0(X19)|(~v2_surreal0(X20)|(~r2_surrealo(X19,X20)|r1_surrealo(k7_surrealn(X19),k7_surrealn(X20))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l88_surrealn])])])).
fof(c_0_7, plain, ![X16]:(~v2_surreal0(X16)|v2_surreal0(k7_surrealn(X16))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_surrealn])])).
fof(c_0_8, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r2_surrealo(X1,X2)=>r2_surrealo(k7_surrealn(X1),k7_surrealn(X2)))))), inference(assume_negation,[status(cth)],[t60_surrealn])).
cnf(c_0_9, plain, (r2_surrealo(X1,X2)|~r1_surrealo(X1,X2)|~r1_surrealo(X2,X1)|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_10, plain, (r1_surrealo(k7_surrealn(X1),k7_surrealn(X2))|~v2_surreal0(X1)|~v2_surreal0(X2)|~r2_surrealo(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, plain, (v2_surreal0(k7_surrealn(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_12, plain, ![X14, X15]:(~v2_surreal0(X14)|~v2_surreal0(X15)|(~r2_surrealo(X14,X15)|r2_surrealo(X15,X14))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r2_surrealo])])).
fof(c_0_13, negated_conjecture, (v2_surreal0(esk1_0)&(v2_surreal0(esk2_0)&(r2_surrealo(esk1_0,esk2_0)&~r2_surrealo(k7_surrealn(esk1_0),k7_surrealn(esk2_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
cnf(c_0_14, plain, (r2_surrealo(k7_surrealn(X1),k7_surrealn(X2))|~r1_surrealo(k7_surrealn(X1),k7_surrealn(X2))|~r2_surrealo(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), c_0_11])).
cnf(c_0_15, plain, (r2_surrealo(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)|~r2_surrealo(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_16, negated_conjecture, (r2_surrealo(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_17, negated_conjecture, (v2_surreal0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_18, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_19, negated_conjecture, (~r2_surrealo(k7_surrealn(esk1_0),k7_surrealn(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_20, plain, (r2_surrealo(k7_surrealn(X1),k7_surrealn(X2))|~r2_surrealo(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_10]), c_0_15])).
cnf(c_0_21, negated_conjecture, (r2_surrealo(esk2_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17]), c_0_18])])).
cnf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21]), c_0_18]), c_0_17])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 23
# Proof object clause steps            : 12
# Proof object formula steps           : 11
# Proof object conjectures             : 9
# Proof object clause conjectures      : 6
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 8
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 10
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 10
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 10
# Processed clauses                    : 24
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 23
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 10
# ...of the previous two non-trivial   : 6
# Contextual simplify-reflections      : 3
# Paramodulations                      : 10
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 0
# 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  : 12
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 7
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 7
# Current number of archived formulas  : 0
# Current number of archived clauses   : 11
# Clause-clause subsumption calls (NU) : 29
# Rec. Clause-clause subsumption calls : 25
# Non-unit clause-clause subsumptions  : 5
# 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          : 1040

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