# 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.020 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t40_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>r2_surrealo(k4_surrealc(k2_surrealr(X1)),k4_surrealc(X1))), file('surrealc/surrealc__t40_surrealc', t40_surrealc)).
fof(t39_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>(~(r2_surrealo(X1,k11_surreal0))=>k4_surrealc(k2_surrealr(X1))=k4_surrealc(X1))), file('surrealc/surrealc__t40_surrealc', t39_surrealc)).
fof(reflexivity_r2_surrealo, axiom, ![X1, X2]:((v2_surreal0(X1)&v2_surreal0(X2))=>r2_surrealo(X1,X1)), file('surrealc/surrealc__t40_surrealc', reflexivity_r2_surrealo)).
fof(t38_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>(r2_surrealo(X1,k11_surreal0)=>r2_surrealo(k4_surrealc(k2_surrealr(X1)),k4_surrealc(X1)))), file('surrealc/surrealc__t40_surrealc', t38_surrealc)).
fof(dt_k4_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>v2_surreal0(k4_surrealc(X1))), file('surrealc/surrealc__t40_surrealc', dt_k4_surrealc)).
fof(c_0_5, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>r2_surrealo(k4_surrealc(k2_surrealr(X1)),k4_surrealc(X1)))), inference(assume_negation,[status(cth)],[t40_surrealc])).
fof(c_0_6, plain, ![X1]:(v2_surreal0(X1)=>(~r2_surrealo(X1,k11_surreal0)=>k4_surrealc(k2_surrealr(X1))=k4_surrealc(X1))), inference(fof_simplification,[status(thm)],[t39_surrealc])).
fof(c_0_7, negated_conjecture, (v2_surreal0(esk1_0)&~r2_surrealo(k4_surrealc(k2_surrealr(esk1_0)),k4_surrealc(esk1_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
fof(c_0_8, plain, ![X13]:(~v2_surreal0(X13)|(r2_surrealo(X13,k11_surreal0)|k4_surrealc(k2_surrealr(X13))=k4_surrealc(X13))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])).
cnf(c_0_9, negated_conjecture, (~r2_surrealo(k4_surrealc(k2_surrealr(esk1_0)),k4_surrealc(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_10, plain, (r2_surrealo(X1,k11_surreal0)|k4_surrealc(k2_surrealr(X1))=k4_surrealc(X1)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_11, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_12, plain, ![X10, X11]:(~v2_surreal0(X10)|~v2_surreal0(X11)|r2_surrealo(X10,X10)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[reflexivity_r2_surrealo])])).
fof(c_0_13, plain, ![X14]:(~v2_surreal0(X14)|(~r2_surrealo(X14,k11_surreal0)|r2_surrealo(k4_surrealc(k2_surrealr(X14)),k4_surrealc(X14)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t38_surrealc])])).
cnf(c_0_14, negated_conjecture, (r2_surrealo(esk1_0,k11_surreal0)|~r2_surrealo(k4_surrealc(esk1_0),k4_surrealc(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])])).
cnf(c_0_15, plain, (r2_surrealo(X1,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_16, plain, ![X12]:(~v2_surreal0(X12)|v2_surreal0(k4_surrealc(X12))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_surrealc])])).
cnf(c_0_17, plain, (r2_surrealo(k4_surrealc(k2_surrealr(X1)),k4_surrealc(X1))|~v2_surreal0(X1)|~r2_surrealo(X1,k11_surreal0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_18, negated_conjecture, (r2_surrealo(esk1_0,k11_surreal0)|~v2_surreal0(k4_surrealc(esk1_0))|~v2_surreal0(X1)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_19, plain, (v2_surreal0(k4_surrealc(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_20, negated_conjecture, (~r2_surrealo(esk1_0,k11_surreal0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_17]), c_0_11])])).
cnf(c_0_21, negated_conjecture, (r2_surrealo(esk1_0,k11_surreal0)|~v2_surreal0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_11])])).
cnf(c_0_22, negated_conjecture, (~v2_surreal0(X1)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
cnf(c_0_23, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_11, c_0_22]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 24
# Proof object clause steps            : 12
# Proof object formula steps           : 12
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 6
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 5
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 6
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 6
# Processed clauses                    : 20
# ...of these trivial                  : 0
# ...subsumed                          : 3
# ...remaining for further processing  : 17
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 12
# ...of the previous two non-trivial   : 9
# Contextual simplify-reflections      : 0
# Paramodulations                      : 11
# 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  : 9
#    Positive orientable unit clauses  : 0
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 6
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 5
# Current number of archived formulas  : 0
# Current number of archived clauses   : 8
# Clause-clause subsumption calls (NU) : 9
# Rec. Clause-clause subsumption calls : 9
# Non-unit clause-clause subsumptions  : 4
# Unit Clause-clause subsumption calls : 5
# 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          : 660

# -------------------------------------------------
# User time                : 0.017 s
# System time              : 0.007 s
# Total time               : 0.024 s
# Maximum resident set size: 2796 pages
