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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(l31_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>((v2_surreal0(k3_surrealc(X1))&v2_surreali(k3_surrealc(X1)))&![X2]:(v2_surreal0(X2)=>![X3]:(v2_surreal0(X3)=>![X4]:(v2_surreal0(X4)=>![X5]:(v2_surreal0(X5)=>((X4=k3_surrealc(X2)&X5=k3_surrealc(X3))=>((r1_surrealo(X2,X3)=>r1_surrealo(X4,X5))&(~(r5_surreal0(X3,X2))=>r2_surrealc(X4,X5)))))))))), file('surrealc/surrealc__t25_surrealc', l31_surrealc)).
fof(t25_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(~(r5_surreal0(X2,X1))=>r2_surrealc(k3_surrealc(X1),k3_surrealc(X2))))), file('surrealc/surrealc__t25_surrealc', t25_surrealc)).
fof(c_0_2, plain, ![X1]:(v2_surreal0(X1)=>((v2_surreal0(k3_surrealc(X1))&v2_surreali(k3_surrealc(X1)))&![X2]:(v2_surreal0(X2)=>![X3]:(v2_surreal0(X3)=>![X4]:(v2_surreal0(X4)=>![X5]:(v2_surreal0(X5)=>((X4=k3_surrealc(X2)&X5=k3_surrealc(X3))=>((r1_surrealo(X2,X3)=>r1_surrealo(X4,X5))&(~r5_surreal0(X3,X2)=>r2_surrealc(X4,X5)))))))))), inference(fof_simplification,[status(thm)],[l31_surrealc])).
fof(c_0_3, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(~r5_surreal0(X2,X1)=>r2_surrealc(k3_surrealc(X1),k3_surrealc(X2)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t25_surrealc])])).
fof(c_0_4, plain, ![X15, X16, X17, X18, X19]:(((v2_surreal0(k3_surrealc(X15))|~v2_surreal0(X15))&(v2_surreali(k3_surrealc(X15))|~v2_surreal0(X15)))&((~r1_surrealo(X16,X17)|r1_surrealo(X18,X19)|(X18!=k3_surrealc(X16)|X19!=k3_surrealc(X17))|~v2_surreal0(X19)|~v2_surreal0(X18)|~v2_surreal0(X17)|~v2_surreal0(X16)|~v2_surreal0(X15))&(r5_surreal0(X17,X16)|r2_surrealc(X18,X19)|(X18!=k3_surrealc(X16)|X19!=k3_surrealc(X17))|~v2_surreal0(X19)|~v2_surreal0(X18)|~v2_surreal0(X17)|~v2_surreal0(X16)|~v2_surreal0(X15)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])).
fof(c_0_5, negated_conjecture, (v2_surreal0(esk1_0)&(v2_surreal0(esk2_0)&(~r5_surreal0(esk2_0,esk1_0)&~r2_surrealc(k3_surrealc(esk1_0),k3_surrealc(esk2_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
cnf(c_0_6, plain, (r5_surreal0(X1,X2)|r2_surrealc(X3,X4)|X3!=k3_surrealc(X2)|X4!=k3_surrealc(X1)|~v2_surreal0(X4)|~v2_surreal0(X3)|~v2_surreal0(X1)|~v2_surreal0(X2)|~v2_surreal0(X5)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_7, plain, (v2_surreal0(k3_surrealc(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_8, negated_conjecture, (~r2_surrealc(k3_surrealc(esk1_0),k3_surrealc(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_9, plain, (r2_surrealc(k3_surrealc(X1),k3_surrealc(X2))|r5_surreal0(X2,X1)|~v2_surreal0(X3)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_6])]), c_0_7]), c_0_7])).
cnf(c_0_10, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_11, negated_conjecture, (v2_surreal0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_12, negated_conjecture, (~r5_surreal0(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_13, negated_conjecture, (~v2_surreal0(X1)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10]), c_0_11])]), c_0_12])).
cnf(c_0_14, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_10, c_0_13]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 15
# Proof object clause steps            : 9
# Proof object formula steps           : 6
# Proof object conjectures             : 9
# Proof object clause conjectures      : 6
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 6
# Proof object initial formulas used   : 2
# Proof object generating inferences   : 1
# Proof object simplifying inferences  : 9
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 2
# 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   : 4
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 7
# ...of the previous two non-trivial   : 4
# Contextual simplify-reflections      : 4
# Paramodulations                      : 3
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 4
# 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  : 7
#    Positive orientable unit clauses  : 0
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 5
# Current number of archived formulas  : 0
# Current number of archived clauses   : 10
# Clause-clause subsumption calls (NU) : 16
# Rec. Clause-clause subsumption calls : 4
# Non-unit clause-clause subsumptions  : 4
# Unit Clause-clause subsumption calls : 4
# 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          : 827

# -------------------------------------------------
# User time                : 0.010 s
# System time              : 0.012 s
# Total time               : 0.021 s
# Maximum resident set size: 3092 pages
