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

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

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.004 s
# Total time               : 0.020 s
# Maximum resident set size: 2856 pages
