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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t32_surreali, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>((v2_surreali(X1)&X2=k10_surreali(X1))=>r2_surrealo(k16_surrealr(X1,X2),k1_surrealo)))), file('surreali/surreali__t32_surreali', t32_surreali)).
fof(l45_surreali, axiom, ![X1]:(v2_surreal0(X1)=>(v2_surreali(X1)=>(v2_surreal0(k10_surreali(X1))&![X2]:(v2_surreal0(X2)=>(X2=k10_surreali(X1)=>r2_surrealo(k16_surrealr(X1,X2),k1_surrealo)))))), file('surreali/surreali__t32_surreali', l45_surreali)).
fof(c_0_2, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>((v2_surreali(X1)&X2=k10_surreali(X1))=>r2_surrealo(k16_surrealr(X1,X2),k1_surrealo))))), inference(assume_negation,[status(cth)],[t32_surreali])).
fof(c_0_3, plain, ![X9, X10]:((v2_surreal0(k10_surreali(X9))|~v2_surreali(X9)|~v2_surreal0(X9))&(~v2_surreal0(X10)|(X10!=k10_surreali(X9)|r2_surrealo(k16_surrealr(X9,X10),k1_surrealo))|~v2_surreali(X9)|~v2_surreal0(X9))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l45_surreali])])])])).
fof(c_0_4, negated_conjecture, (v2_surreal0(esk1_0)&(v2_surreal0(esk2_0)&((v2_surreali(esk1_0)&esk2_0=k10_surreali(esk1_0))&~r2_surrealo(k16_surrealr(esk1_0,esk2_0),k1_surrealo)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])).
cnf(c_0_5, plain, (r2_surrealo(k16_surrealr(X2,X1),k1_surrealo)|~v2_surreal0(X1)|X1!=k10_surreali(X2)|~v2_surreali(X2)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_3])).
cnf(c_0_6, negated_conjecture, (v2_surreali(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_7, negated_conjecture, (esk2_0=k10_surreali(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_8, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_9, negated_conjecture, (r2_surrealo(k16_surrealr(esk1_0,X1),k1_surrealo)|X1!=esk2_0|~v2_surreal0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_6]), c_0_7]), c_0_8])])).
cnf(c_0_10, negated_conjecture, (v2_surreal0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_11, negated_conjecture, (~r2_surrealo(k16_surrealr(esk1_0,esk2_0),k1_surrealo)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_12, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 13
# Proof object clause steps            : 8
# Proof object formula steps           : 5
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 6
# Proof object initial formulas used   : 2
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 4
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 2
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 7
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 7
# Processed clauses                    : 15
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 15
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 5
# ...of the previous two non-trivial   : 1
# Contextual simplify-reflections      : 0
# Paramodulations                      : 5
# 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  : 8
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 3
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 7
# Clause-clause subsumption calls (NU) : 0
# Rec. Clause-clause subsumption calls : 0
# Non-unit clause-clause subsumptions  : 0
# 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          : 530

# -------------------------------------------------
# User time                : 0.018 s
# System time              : 0.005 s
# Total time               : 0.023 s
# Maximum resident set size: 3000 pages
