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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
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__t8_surrealn', l12_surrealn)).
fof(t8_surrealn, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(k1_funct_1(k1_surrealn,X1)=k1_funct_1(k1_surrealn,X2)=>X1=X2))), file('surrealn/surrealn__t8_surrealn', t8_surrealn)).
fof(fc1_surrealn, axiom, ![X1]:(v1_int_1(X1)=>v2_surreal0(k1_funct_1(k1_surrealn,X1))), file('surrealn/surrealn__t8_surrealn', fc1_surrealn)).
fof(t3_surrealo, axiom, ![X1]:(v2_surreal0(X1)=>r5_surreal0(X1,X1)), file('surrealn/surrealn__t8_surrealn', t3_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__t8_surrealn', t1_xxreal_0)).
fof(cc4_xreal_0, axiom, ![X1]:(v1_xreal_0(X1)=>v1_xxreal_0(X1)), file('surrealn/surrealn__t8_surrealn', cc4_xreal_0)).
fof(cc3_int_1, axiom, ![X1]:(v1_int_1(X1)=>v1_xreal_0(X1)), file('surrealn/surrealn__t8_surrealn', cc3_int_1)).
fof(c_0_7, 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])).
fof(c_0_8, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(k1_funct_1(k1_surrealn,X1)=k1_funct_1(k1_surrealn,X2)=>X1=X2)))), inference(assume_negation,[status(cth)],[t8_surrealn])).
fof(c_0_9, plain, ![X18, X19]:(~v1_int_1(X18)|(~v1_int_1(X19)|(r1_xxreal_0(X19,X18)|~r5_surreal0(k1_funct_1(k1_surrealn,X19),k1_funct_1(k1_surrealn,X18))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
fof(c_0_10, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&(k1_funct_1(k1_surrealn,esk1_0)=k1_funct_1(k1_surrealn,esk2_0)&esk1_0!=esk2_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
fof(c_0_11, plain, ![X17]:(~v1_int_1(X17)|v2_surreal0(k1_funct_1(k1_surrealn,X17))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_surrealn])])).
cnf(c_0_12, 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_9])).
cnf(c_0_13, negated_conjecture, (k1_funct_1(k1_surrealn,esk1_0)=k1_funct_1(k1_surrealn,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_14, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
fof(c_0_15, plain, ![X22]:(~v2_surreal0(X22)|r5_surreal0(X22,X22)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_surrealo])])).
cnf(c_0_16, plain, (v2_surreal0(k1_funct_1(k1_surrealn,X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_17, plain, ![X20, X21]:(~v1_xxreal_0(X20)|(~v1_xxreal_0(X21)|(~r1_xxreal_0(X20,X21)|~r1_xxreal_0(X21,X20)|X20=X21))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xxreal_0])])])).
cnf(c_0_18, negated_conjecture, (r1_xxreal_0(X1,esk1_0)|~r5_surreal0(k1_funct_1(k1_surrealn,X1),k1_funct_1(k1_surrealn,esk2_0))|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])])).
cnf(c_0_19, plain, (r5_surreal0(X1,X1)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_21, negated_conjecture, (v2_surreal0(k1_funct_1(k1_surrealn,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_13]), c_0_14])])).
cnf(c_0_22, 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_17])).
cnf(c_0_23, 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_18, c_0_19]), c_0_20]), c_0_21])])).
cnf(c_0_24, negated_conjecture, (esk1_0!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_25, negated_conjecture, (r1_xxreal_0(esk1_0,X1)|~r5_surreal0(k1_funct_1(k1_surrealn,esk2_0),k1_funct_1(k1_surrealn,X1))|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])])).
fof(c_0_26, plain, ![X16]:(~v1_xreal_0(X16)|v1_xxreal_0(X16)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc4_xreal_0])])).
fof(c_0_27, plain, ![X15]:(~v1_int_1(X15)|v1_xreal_0(X15)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_int_1])])).
cnf(c_0_28, negated_conjecture, (~r1_xxreal_0(esk1_0,esk2_0)|~v1_xxreal_0(esk2_0)|~v1_xxreal_0(esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
cnf(c_0_29, 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_25, c_0_19]), c_0_20]), c_0_21])])).
cnf(c_0_30, plain, (v1_xxreal_0(X1)|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_31, plain, (v1_xreal_0(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_32, negated_conjecture, (~v1_xxreal_0(esk2_0)|~v1_xxreal_0(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_29])])).
cnf(c_0_33, plain, (v1_xxreal_0(X1)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_30, c_0_31])).
cnf(c_0_34, negated_conjecture, (~v1_xxreal_0(esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_14])])).
cnf(c_0_35, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_33]), c_0_20])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 36
# Proof object clause steps            : 20
# Proof object formula steps           : 16
# Proof object conjectures             : 16
# Proof object clause conjectures      : 13
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 9
# Proof object simplifying inferences  : 19
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 10
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 10
# Processed clauses                    : 32
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 32
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 2
# Generated clauses                    : 14
# ...of the previous two non-trivial   : 14
# Contextual simplify-reflections      : 1
# Paramodulations                      : 14
# 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  : 20
#    Positive orientable unit clauses  : 7
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 4
# Current number of archived formulas  : 0
# Current number of archived clauses   : 12
# Clause-clause subsumption calls (NU) : 60
# Rec. Clause-clause subsumption calls : 36
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 2
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 2
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1015

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.002 s
# Total time               : 0.018 s
# Maximum resident set size: 2920 pages
