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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t39_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>(~(r2_surrealo(X1,k11_surreal0))=>k4_surrealc(k2_surrealr(X1))=k4_surrealc(X1))), file('surrealc/surrealc__t39_surrealc', t39_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__t39_surrealc', d6_surrealc)).
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__t39_surrealc', t10_surrealr)).
fof(rd1_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>k2_surrealr(k2_surrealr(X1))=X1), file('surrealc/surrealc__t39_surrealc', rd1_surrealr)).
fof(rd2_surrealr, axiom, k2_surrealr(k11_surreal0)=k11_surreal0, file('surrealc/surrealc__t39_surrealc', rd2_surrealr)).
fof(fc21_surrealn, axiom, (v2_surreal0(k11_surreal0)&v3_surrealn(k11_surreal0)), file('surrealc/surrealc__t39_surrealc', fc21_surrealn)).
fof(d2_surrealo, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r2_surrealo(X1,X2)<=>(r1_surrealo(X1,X2)&r1_surrealo(X2,X1))))), file('surrealc/surrealc__t39_surrealc', d2_surrealo)).
fof(connectedness_r1_surrealo, axiom, ![X1, X2]:((v2_surreal0(X1)&v2_surreal0(X2))=>(r1_surrealo(X1,X2)|r1_surrealo(X2,X1))), file('surrealc/surrealc__t39_surrealc', connectedness_r1_surrealo)).
fof(fc3_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>v2_surreal0(k2_surrealr(X1))), file('surrealc/surrealc__t39_surrealc', fc3_surrealr)).
fof(c_0_9, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>(~r2_surrealo(X1,k11_surreal0)=>k4_surrealc(k2_surrealr(X1))=k4_surrealc(X1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t39_surrealc])])).
fof(c_0_10, 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_11, negated_conjecture, (v2_surreal0(esk1_0)&(~r2_surrealo(esk1_0,k11_surreal0)&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_9])])])).
fof(c_0_12, plain, ![X18]:((~r1_surrealo(k11_surreal0,X18)|k4_surrealc(X18)=X18|~v2_surreal0(X18))&(r1_surrealo(k11_surreal0,X18)|k4_surrealc(X18)=k2_surrealr(X18)|~v2_surreal0(X18))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
fof(c_0_13, plain, ![X21, X22]:((~r1_surrealo(X21,X22)|r1_surrealo(k2_surrealr(X22),k2_surrealr(X21))|~v2_surreal0(X22)|~v2_surreal0(X21))&(~r1_surrealo(k2_surrealr(X22),k2_surrealr(X21))|r1_surrealo(X21,X22)|~v2_surreal0(X22)|~v2_surreal0(X21))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t10_surrealr])])])])).
cnf(c_0_14, negated_conjecture, (k4_surrealc(k2_surrealr(esk1_0))!=k4_surrealc(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_15, plain, (r1_surrealo(k11_surreal0,X1)|k4_surrealc(X1)=k2_surrealr(X1)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_16, plain, ![X20]:(~v2_surreal0(X20)|k2_surrealr(k2_surrealr(X20))=X20), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rd1_surrealr])])).
cnf(c_0_17, plain, (r1_surrealo(X2,X1)|~r1_surrealo(k2_surrealr(X1),k2_surrealr(X2))|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
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)],[fc21_surrealn])).
cnf(c_0_20, negated_conjecture, (r1_surrealo(k11_surreal0,k2_surrealr(esk1_0))|k2_surrealr(k2_surrealr(esk1_0))!=k4_surrealc(esk1_0)|~v2_surreal0(k2_surrealr(esk1_0))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_21, plain, (k2_surrealr(k2_surrealr(X1))=X1|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_22, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_23, plain, ![X16, X17]:(((r1_surrealo(X16,X17)|~r2_surrealo(X16,X17)|~v2_surreal0(X17)|~v2_surreal0(X16))&(r1_surrealo(X17,X16)|~r2_surrealo(X16,X17)|~v2_surreal0(X17)|~v2_surreal0(X16)))&(~r1_surrealo(X16,X17)|~r1_surrealo(X17,X16)|r2_surrealo(X16,X17)|~v2_surreal0(X17)|~v2_surreal0(X16))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_surrealo])])])])).
cnf(c_0_24, plain, (r1_surrealo(X1,k11_surreal0)|~r1_surrealo(k11_surreal0,k2_surrealr(X1))|~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_25, negated_conjecture, (r1_surrealo(k11_surreal0,k2_surrealr(esk1_0))|k4_surrealc(esk1_0)!=esk1_0|~v2_surreal0(k2_surrealr(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])])).
cnf(c_0_26, negated_conjecture, (~r2_surrealo(esk1_0,k11_surreal0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_27, plain, (r2_surrealo(X1,X2)|~r1_surrealo(X1,X2)|~r1_surrealo(X2,X1)|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
fof(c_0_28, plain, ![X14, X15]:(~v2_surreal0(X14)|~v2_surreal0(X15)|(r1_surrealo(X14,X15)|r1_surrealo(X15,X14))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_surrealo])])).
cnf(c_0_29, negated_conjecture, (r1_surrealo(esk1_0,k11_surreal0)|k4_surrealc(esk1_0)!=esk1_0|~v2_surreal0(k2_surrealr(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_22])])).
cnf(c_0_30, plain, (k4_surrealc(X1)=X1|~r1_surrealo(k11_surreal0,X1)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_31, negated_conjecture, (~r1_surrealo(k11_surreal0,esk1_0)|~r1_surrealo(esk1_0,k11_surreal0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_19]), c_0_22])])).
fof(c_0_32, plain, ![X19]:(~v2_surreal0(X19)|v2_surreal0(k2_surrealr(X19))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_surrealr])])).
cnf(c_0_33, plain, (r1_surrealo(X1,X2)|r1_surrealo(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_34, negated_conjecture, (~r1_surrealo(k11_surreal0,esk1_0)|~v2_surreal0(k2_surrealr(esk1_0))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_22])]), c_0_31])).
cnf(c_0_35, plain, (v2_surreal0(k2_surrealr(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_32])).
cnf(c_0_36, 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_13])).
cnf(c_0_37, negated_conjecture, (r1_surrealo(X1,esk1_0)|r1_surrealo(esk1_0,X1)|~v2_surreal0(X1)), inference(spm,[status(thm)],[c_0_33, c_0_22])).
cnf(c_0_38, negated_conjecture, (~r1_surrealo(k11_surreal0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_22])])).
cnf(c_0_39, negated_conjecture, (k4_surrealc(esk1_0)!=k2_surrealr(esk1_0)|~r1_surrealo(k11_surreal0,k2_surrealr(esk1_0))|~v2_surreal0(k2_surrealr(esk1_0))), inference(spm,[status(thm)],[c_0_14, c_0_30])).
cnf(c_0_40, 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_36, c_0_18]), c_0_19])])).
cnf(c_0_41, negated_conjecture, (r1_surrealo(esk1_0,k11_surreal0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_19]), c_0_38])).
cnf(c_0_42, negated_conjecture, (k4_surrealc(esk1_0)!=k2_surrealr(esk1_0)|~v2_surreal0(k2_surrealr(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_41]), c_0_22])])).
cnf(c_0_43, negated_conjecture, (~v2_surreal0(k2_surrealr(esk1_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_15]), c_0_22])]), c_0_38])).
cnf(c_0_44, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_35]), c_0_22])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 45
# Proof object clause steps            : 27
# Proof object formula steps           : 18
# Proof object conjectures             : 18
# Proof object clause conjectures      : 15
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 14
# Proof object simplifying inferences  : 25
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 16
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 16
# Processed clauses                    : 58
# ...of these trivial                  : 0
# ...subsumed                          : 2
# ...remaining for further processing  : 56
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 3
# Backward-rewritten                   : 2
# Generated clauses                    : 55
# ...of the previous two non-trivial   : 40
# Contextual simplify-reflections      : 3
# Paramodulations                      : 55
# 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  : 35
#    Positive orientable unit clauses  : 7
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 5
#    Non-unit-clauses                  : 23
# Current number of unprocessed clauses: 14
# ...number of literals in the above   : 57
# Current number of archived formulas  : 0
# Current number of archived clauses   : 21
# Clause-clause subsumption calls (NU) : 66
# Rec. Clause-clause subsumption calls : 49
# Non-unit clause-clause subsumptions  : 6
# Unit Clause-clause subsumption calls : 34
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 1
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1908

# -------------------------------------------------
# User time                : 0.018 s
# System time              : 0.006 s
# Total time               : 0.024 s
# Maximum resident set size: 3000 pages
