# 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(d7_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>(~(r2_surrealo(X1,k11_surreal0))=>![X2]:((v2_surreal0(X2)&v2_surrealo(X2))=>(X2=k5_surrealc(X1)<=>r1_surrealc(k4_surrealc(X1),k3_surrealc(X2)))))), file('surrealc/surrealc__t56_surrealc', d7_surrealc)).
fof(dt_k5_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>(v2_surreal0(k5_surrealc(X1))&v2_surrealo(k5_surrealc(X1)))), file('surrealc/surrealc__t56_surrealc', dt_k5_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__t56_surrealc', t39_surrealc)).
fof(fc3_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>v2_surreal0(k2_surrealr(X1))), file('surrealc/surrealc__t56_surrealc', fc3_surrealr)).
fof(t24_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>(r2_surrealo(X1,k11_surreal0)<=>r2_surrealo(k2_surrealr(X1),k11_surreal0))), file('surrealc/surrealc__t56_surrealc', t24_surrealr)).
fof(t56_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>(~(r2_surrealo(X1,k11_surreal0))=>k5_surrealc(X1)=k5_surrealc(k2_surrealr(X1)))), file('surrealc/surrealc__t56_surrealc', t56_surrealc)).
fof(c_0_6, plain, ![X1]:(v2_surreal0(X1)=>(~r2_surrealo(X1,k11_surreal0)=>![X2]:((v2_surreal0(X2)&v2_surrealo(X2))=>(X2=k5_surrealc(X1)<=>r1_surrealc(k4_surrealc(X1),k3_surrealc(X2)))))), inference(fof_simplification,[status(thm)],[d7_surrealc])).
fof(c_0_7, plain, ![X11, X12]:((X12!=k5_surrealc(X11)|r1_surrealc(k4_surrealc(X11),k3_surrealc(X12))|(~v2_surreal0(X12)|~v2_surrealo(X12))|r2_surrealo(X11,k11_surreal0)|~v2_surreal0(X11))&(~r1_surrealc(k4_surrealc(X11),k3_surrealc(X12))|X12=k5_surrealc(X11)|(~v2_surreal0(X12)|~v2_surrealo(X12))|r2_surrealo(X11,k11_surreal0)|~v2_surreal0(X11))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])).
fof(c_0_8, plain, ![X13]:((v2_surreal0(k5_surrealc(X13))|~v2_surreal0(X13))&(v2_surrealo(k5_surrealc(X13))|~v2_surreal0(X13))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_surrealc])])])).
fof(c_0_9, 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])).
cnf(c_0_10, plain, (r1_surrealc(k4_surrealc(X2),k3_surrealc(X1))|r2_surrealo(X2,k11_surreal0)|X1!=k5_surrealc(X2)|~v2_surreal0(X1)|~v2_surrealo(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_11, plain, (v2_surreal0(k5_surrealc(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_12, plain, (v2_surrealo(k5_surrealc(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
fof(c_0_13, plain, ![X16]:(~v2_surreal0(X16)|(r2_surrealo(X16,k11_surreal0)|k4_surrealc(k2_surrealr(X16))=k4_surrealc(X16))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
fof(c_0_14, plain, ![X14]:(~v2_surreal0(X14)|v2_surreal0(k2_surrealr(X14))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_surrealr])])).
fof(c_0_15, plain, ![X15]:((~r2_surrealo(X15,k11_surreal0)|r2_surrealo(k2_surrealr(X15),k11_surreal0)|~v2_surreal0(X15))&(~r2_surrealo(k2_surrealr(X15),k11_surreal0)|r2_surrealo(X15,k11_surreal0)|~v2_surreal0(X15))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t24_surrealr])])])).
cnf(c_0_16, plain, (r1_surrealc(k4_surrealc(X1),k3_surrealc(k5_surrealc(X1)))|r2_surrealo(X1,k11_surreal0)|~v2_surreal0(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_10]), c_0_11]), c_0_12])).
cnf(c_0_17, plain, (r2_surrealo(X1,k11_surreal0)|k4_surrealc(k2_surrealr(X1))=k4_surrealc(X1)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_18, plain, (v2_surreal0(k2_surrealr(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_19, plain, (r2_surrealo(k2_surrealr(X1),k11_surreal0)|~r2_surrealo(X1,k11_surreal0)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, plain, (X2=k5_surrealc(X1)|r2_surrealo(X1,k11_surreal0)|~r1_surrealc(k4_surrealc(X1),k3_surrealc(X2))|~v2_surreal0(X2)|~v2_surrealo(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_21, plain, (r1_surrealc(k4_surrealc(X1),k3_surrealc(k5_surrealc(k2_surrealr(X1))))|r2_surrealo(k2_surrealr(X1),k11_surreal0)|~v2_surreal0(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_19])).
fof(c_0_22, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>(~r2_surrealo(X1,k11_surreal0)=>k5_surrealc(X1)=k5_surrealc(k2_surrealr(X1))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t56_surrealc])])).
cnf(c_0_23, plain, (k5_surrealc(k2_surrealr(X1))=k5_surrealc(X1)|r2_surrealo(k2_surrealr(X1),k11_surreal0)|~v2_surrealo(k5_surrealc(k2_surrealr(X1)))|~v2_surreal0(k5_surrealc(k2_surrealr(X1)))|~v2_surreal0(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_19])).
fof(c_0_24, negated_conjecture, (v2_surreal0(esk1_0)&(~r2_surrealo(esk1_0,k11_surreal0)&k5_surrealc(esk1_0)!=k5_surrealc(k2_surrealr(esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])).
cnf(c_0_25, plain, (k5_surrealc(k2_surrealr(X1))=k5_surrealc(X1)|r2_surrealo(k2_surrealr(X1),k11_surreal0)|~v2_surreal0(k5_surrealc(k2_surrealr(X1)))|~v2_surreal0(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_12]), c_0_18])).
cnf(c_0_26, negated_conjecture, (k5_surrealc(esk1_0)!=k5_surrealc(k2_surrealr(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_27, plain, (k5_surrealc(k2_surrealr(X1))=k5_surrealc(X1)|r2_surrealo(k2_surrealr(X1),k11_surreal0)|~v2_surreal0(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_11]), c_0_18])).
cnf(c_0_28, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_29, plain, (r2_surrealo(X1,k11_surreal0)|~r2_surrealo(k2_surrealr(X1),k11_surreal0)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_30, negated_conjecture, (r2_surrealo(k2_surrealr(esk1_0),k11_surreal0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])])).
cnf(c_0_31, negated_conjecture, (~r2_surrealo(esk1_0,k11_surreal0)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_32, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_28])]), c_0_31]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 33
# Proof object clause steps            : 18
# Proof object formula steps           : 15
# Proof object conjectures             : 8
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 6
# Proof object simplifying inferences  : 13
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 11
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 11
# Processed clauses                    : 29
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 29
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 2
# Backward-rewritten                   : 0
# Generated clauses                    : 16
# ...of the previous two non-trivial   : 14
# Contextual simplify-reflections      : 9
# Paramodulations                      : 15
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# 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  : 15
#    Positive orientable unit clauses  : 2
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 7
# ...number of literals in the above   : 34
# Current number of archived formulas  : 0
# Current number of archived clauses   : 13
# Clause-clause subsumption calls (NU) : 88
# Rec. Clause-clause subsumption calls : 26
# Non-unit clause-clause subsumptions  : 11
# 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          : 1395

# -------------------------------------------------
# User time                : 0.023 s
# System time              : 0.000 s
# Total time               : 0.023 s
# Maximum resident set size: 3024 pages
