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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t9_surrealn, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(~((~(r1_xxreal_0(X2,X1))&r5_surreal0(k1_funct_1(k1_surrealn,X2),k1_funct_1(k1_surrealn,X1))))&~((~(r5_surreal0(k1_funct_1(k1_surrealn,X2),k1_funct_1(k1_surrealn,X1)))&r1_xxreal_0(X2,X1)))))), file('surrealn/surrealn__t9_surrealn', t9_surrealn)).
fof(fc1_surrealn, axiom, ![X1]:(v1_int_1(X1)=>v2_surreal0(k1_funct_1(k1_surrealn,X1))), file('surrealn/surrealn__t9_surrealn', fc1_surrealn)).
fof(connectedness_r1_surrealo, axiom, ![X1, X2]:((v2_surreal0(X1)&v2_surreal0(X2))=>(r1_surrealo(X1,X2)|r1_surrealo(X2,X1))), file('surrealn/surrealn__t9_surrealn', connectedness_r1_surrealo)).
fof(l12_surrealn, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>~((~(r1_xxreal_0(X2,X1))&r5_surreal0(k1_funct_1(k1_surrealn,X2),k1_funct_1(k1_surrealn,X1)))))), file('surrealn/surrealn__t9_surrealn', l12_surrealn)).
fof(redefinition_r1_surrealo, axiom, ![X1, X2]:((v2_surreal0(X1)&v2_surreal0(X2))=>(r1_surrealo(X1,X2)<=>r5_surreal0(X1,X2))), file('surrealn/surrealn__t9_surrealn', redefinition_r1_surrealo)).
fof(t1_xxreal_0, axiom, ![X1]:(v1_xxreal_0(X1)=>![X2]:(v1_xxreal_0(X2)=>((r1_xxreal_0(X1,X2)&r1_xxreal_0(X2,X1))=>X1=X2))), file('surrealn/surrealn__t9_surrealn', t1_xxreal_0)).
fof(cc4_xreal_0, axiom, ![X1]:(v1_xreal_0(X1)=>v1_xxreal_0(X1)), file('surrealn/surrealn__t9_surrealn', cc4_xreal_0)).
fof(cc1_rat_1, axiom, ![X1]:(v1_rat_1(X1)=>v1_xreal_0(X1)), file('surrealn/surrealn__t9_surrealn', cc1_rat_1)).
fof(cc2_rat_1, axiom, ![X1]:(v1_int_1(X1)=>v1_rat_1(X1)), file('surrealn/surrealn__t9_surrealn', cc2_rat_1)).
fof(c_0_9, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(~((~r1_xxreal_0(X2,X1)&r5_surreal0(k1_funct_1(k1_surrealn,X2),k1_funct_1(k1_surrealn,X1))))&~((~r5_surreal0(k1_funct_1(k1_surrealn,X2),k1_funct_1(k1_surrealn,X1))&r1_xxreal_0(X2,X1))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t9_surrealn])])).
fof(c_0_10, plain, ![X24]:(~v1_int_1(X24)|v2_surreal0(k1_funct_1(k1_surrealn,X24))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_surrealn])])).
fof(c_0_11, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&(((~r5_surreal0(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk1_0))|~r1_xxreal_0(esk2_0,esk1_0))&(r1_xxreal_0(esk2_0,esk1_0)|~r1_xxreal_0(esk2_0,esk1_0)))&((~r5_surreal0(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk1_0))|r5_surreal0(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk1_0)))&(r1_xxreal_0(esk2_0,esk1_0)|r5_surreal0(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk1_0))))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])).
fof(c_0_12, plain, ![X22, X23]:(~v2_surreal0(X22)|~v2_surreal0(X23)|(r1_surrealo(X22,X23)|r1_surrealo(X23,X22))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[connectedness_r1_surrealo])])).
cnf(c_0_13, plain, (v2_surreal0(k1_funct_1(k1_surrealn,X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_14, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_15, plain, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>~((~r1_xxreal_0(X2,X1)&r5_surreal0(k1_funct_1(k1_surrealn,X2),k1_funct_1(k1_surrealn,X1)))))), inference(fof_simplification,[status(thm)],[l12_surrealn])).
cnf(c_0_16, plain, (r1_surrealo(X1,X2)|r1_surrealo(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_17, negated_conjecture, (v2_surreal0(k1_funct_1(k1_surrealn,esk2_0))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_18, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_19, plain, ![X25, X26]:(~v1_int_1(X25)|(~v1_int_1(X26)|(r1_xxreal_0(X26,X25)|~r5_surreal0(k1_funct_1(k1_surrealn,X26),k1_funct_1(k1_surrealn,X25))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])).
fof(c_0_20, plain, ![X27, X28]:((~r1_surrealo(X27,X28)|r5_surreal0(X27,X28)|(~v2_surreal0(X27)|~v2_surreal0(X28)))&(~r5_surreal0(X27,X28)|r1_surrealo(X27,X28)|(~v2_surreal0(X27)|~v2_surreal0(X28)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_surrealo])])])).
cnf(c_0_21, negated_conjecture, (r1_surrealo(X1,k1_funct_1(k1_surrealn,esk2_0))|r1_surrealo(k1_funct_1(k1_surrealn,esk2_0),X1)|~v2_surreal0(X1)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_22, negated_conjecture, (v2_surreal0(k1_funct_1(k1_surrealn,esk1_0))), inference(spm,[status(thm)],[c_0_13, c_0_18])).
cnf(c_0_23, plain, (r1_xxreal_0(X2,X1)|~v1_int_1(X1)|~v1_int_1(X2)|~r5_surreal0(k1_funct_1(k1_surrealn,X2),k1_funct_1(k1_surrealn,X1))), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_24, negated_conjecture, (r1_xxreal_0(esk2_0,esk1_0)|r5_surreal0(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_25, plain, (r5_surreal0(X1,X2)|~r1_surrealo(X1,X2)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_26, negated_conjecture, (r1_surrealo(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk1_0))|r1_surrealo(k1_funct_1(k1_surrealn,esk1_0),k1_funct_1(k1_surrealn,esk2_0))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_27, negated_conjecture, (~r5_surreal0(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk1_0))|~r1_xxreal_0(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_28, negated_conjecture, (r1_xxreal_0(esk2_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_14]), c_0_18])])).
fof(c_0_29, plain, ![X29, X30]:(~v1_xxreal_0(X29)|(~v1_xxreal_0(X30)|(~r1_xxreal_0(X29,X30)|~r1_xxreal_0(X30,X29)|X29=X30))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xxreal_0])])])).
cnf(c_0_30, negated_conjecture, (r1_surrealo(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk1_0))|r5_surreal0(k1_funct_1(k1_surrealn,esk1_0),k1_funct_1(k1_surrealn,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_17]), c_0_22])])).
cnf(c_0_31, negated_conjecture, (~r5_surreal0(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_28])])).
fof(c_0_32, plain, ![X21]:(~v1_xreal_0(X21)|v1_xxreal_0(X21)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc4_xreal_0])])).
fof(c_0_33, plain, ![X19]:(~v1_rat_1(X19)|v1_xreal_0(X19)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_rat_1])])).
cnf(c_0_34, plain, (X1=X2|~v1_xxreal_0(X1)|~v1_xxreal_0(X2)|~r1_xxreal_0(X1,X2)|~r1_xxreal_0(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
cnf(c_0_35, negated_conjecture, (r5_surreal0(k1_funct_1(k1_surrealn,esk1_0),k1_funct_1(k1_surrealn,esk2_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_30]), c_0_22]), c_0_17])]), c_0_31])).
cnf(c_0_36, plain, (v1_xxreal_0(X1)|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_32])).
cnf(c_0_37, plain, (v1_xreal_0(X1)|~v1_rat_1(X1)), inference(split_conjunct,[status(thm)],[c_0_33])).
fof(c_0_38, plain, ![X20]:(~v1_int_1(X20)|v1_rat_1(X20)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_rat_1])])).
cnf(c_0_39, negated_conjecture, (esk1_0=esk2_0|~v1_xxreal_0(esk2_0)|~v1_xxreal_0(esk1_0)|~r1_xxreal_0(esk1_0,esk2_0)), inference(spm,[status(thm)],[c_0_34, c_0_28])).
cnf(c_0_40, negated_conjecture, (r1_xxreal_0(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_35]), c_0_18]), c_0_14])])).
cnf(c_0_41, plain, (v1_xxreal_0(X1)|~v1_rat_1(X1)), inference(spm,[status(thm)],[c_0_36, c_0_37])).
cnf(c_0_42, plain, (v1_rat_1(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_38])).
cnf(c_0_43, negated_conjecture, (esk1_0=esk2_0|~v1_xxreal_0(esk2_0)|~v1_xxreal_0(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39, c_0_40])])).
cnf(c_0_44, plain, (v1_xxreal_0(X1)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_41, c_0_42])).
cnf(c_0_45, negated_conjecture, (esk1_0=esk2_0|~v1_xxreal_0(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_14])])).
cnf(c_0_46, negated_conjecture, (r1_surrealo(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(ef,[status(thm)],[c_0_21]), c_0_17])])).
cnf(c_0_47, negated_conjecture, (esk1_0=esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_44]), c_0_18])])).
cnf(c_0_48, negated_conjecture, (r5_surreal0(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_46]), c_0_17])])).
cnf(c_0_49, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31, c_0_47]), c_0_48])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 50
# Proof object clause steps            : 30
# Proof object formula steps           : 20
# Proof object conjectures             : 23
# Proof object clause conjectures      : 20
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 12
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 15
# Proof object simplifying inferences  : 28
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 15
# Removed in clause preprocessing      : 2
# Initial clauses in saturation        : 13
# Processed clauses                    : 56
# ...of these trivial                  : 4
# ...subsumed                          : 1
# ...remaining for further processing  : 51
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 16
# Generated clauses                    : 32
# ...of the previous two non-trivial   : 32
# Contextual simplify-reflections      : 1
# Paramodulations                      : 26
# Factorizations                       : 6
# 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  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 15
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 5
# Current number of archived formulas  : 0
# Current number of archived clauses   : 30
# Clause-clause subsumption calls (NU) : 244
# Rec. Clause-clause subsumption calls : 170
# Non-unit clause-clause subsumptions  : 3
# Unit Clause-clause subsumption calls : 10
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 4
# BW rewrite match successes           : 4
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1800

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.002 s
# Total time               : 0.023 s
# Maximum resident set size: 3632 pages
