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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t8_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>((v2_surreali(X1)&r2_surrealo(X1,X2))=>r1_surrealc(X1,X2)))), file('surrealc/surrealc__t8_surrealc', t8_surrealc)).
fof(t2_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>(v2_surreali(X1)=>r1_surrealc(X1,X1))), file('surrealc/surrealc__t8_surrealc', t2_surrealc)).
fof(t5_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>![X3]:(v2_surreal0(X3)=>((r2_surrealo(X1,X2)&r1_surrealc(X1,X3))=>r1_surrealc(X2,X3))))), file('surrealc/surrealc__t8_surrealc', t5_surrealc)).
fof(symmetry_r1_surrealc, axiom, ![X1, X2]:((v2_surreal0(X1)&v2_surreal0(X2))=>(r1_surrealc(X1,X2)=>r1_surrealc(X2,X1))), file('surrealc/surrealc__t8_surrealc', symmetry_r1_surrealc)).
fof(c_0_4, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>((v2_surreali(X1)&r2_surrealo(X1,X2))=>r1_surrealc(X1,X2))))), inference(assume_negation,[status(cth)],[t8_surrealc])).
fof(c_0_5, plain, ![X16]:(~v2_surreal0(X16)|(~v2_surreali(X16)|r1_surrealc(X16,X16))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_surrealc])])).
fof(c_0_6, negated_conjecture, (v2_surreal0(esk1_0)&(v2_surreal0(esk2_0)&((v2_surreali(esk1_0)&r2_surrealo(esk1_0,esk2_0))&~r1_surrealc(esk1_0,esk2_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
fof(c_0_7, plain, ![X17, X18, X19]:(~v2_surreal0(X17)|(~v2_surreal0(X18)|(~v2_surreal0(X19)|(~r2_surrealo(X17,X18)|~r1_surrealc(X17,X19)|r1_surrealc(X18,X19))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_surrealc])])])).
cnf(c_0_8, plain, (r1_surrealc(X1,X1)|~v2_surreal0(X1)|~v2_surreali(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_9, negated_conjecture, (v2_surreali(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, plain, (r1_surrealc(X2,X3)|~v2_surreal0(X1)|~v2_surreal0(X2)|~v2_surreal0(X3)|~r2_surrealo(X1,X2)|~r1_surrealc(X1,X3)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, negated_conjecture, (r1_surrealc(esk1_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])])).
fof(c_0_13, plain, ![X14, X15]:(~v2_surreal0(X14)|~v2_surreal0(X15)|(~r1_surrealc(X14,X15)|r1_surrealc(X15,X14))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_surrealc])])).
cnf(c_0_14, negated_conjecture, (r1_surrealc(X1,esk1_0)|~r2_surrealo(esk1_0,X1)|~v2_surreal0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_10])])).
cnf(c_0_15, negated_conjecture, (r2_surrealo(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_16, negated_conjecture, (v2_surreal0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_17, plain, (r1_surrealc(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)|~r1_surrealc(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_18, negated_conjecture, (r1_surrealc(esk2_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16])])).
cnf(c_0_19, negated_conjecture, (~r1_surrealc(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_20, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_10]), c_0_16])]), c_0_19]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 21
# Proof object clause steps            : 12
# Proof object formula steps           : 9
# Proof object conjectures             : 12
# Proof object clause conjectures      : 9
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 8
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 10
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 8
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 8
# Processed clauses                    : 19
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 19
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 10
# ...of the previous two non-trivial   : 6
# Contextual simplify-reflections      : 0
# 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  : 11
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 3
# ...number of literals in the above   : 14
# Current number of archived formulas  : 0
# Current number of archived clauses   : 8
# Clause-clause subsumption calls (NU) : 10
# Rec. Clause-clause subsumption calls : 10
# 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          : 788

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.002 s
# Total time               : 0.023 s
# Maximum resident set size: 3760 pages
