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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t78_surrealn, conjecture, ![X1]:(v7_ordinal1(X1)=>k1_funct_1(k1_surrealn,X1)=k9_surrealn(X1)), file('surrealn/surrealn__t78_surrealn', t78_surrealn)).
fof(t72_surrealn, axiom, ![X1]:(v7_ordinal1(X1)=>k1_funct_1(k1_surrealn,X1)=k8_surrealn(X1)), file('surrealn/surrealn__t78_surrealn', t72_surrealn)).
fof(cc6_ordinal1, axiom, ![X1]:(v7_ordinal1(X1)=>v3_ordinal1(X1)), file('surrealn/surrealn__t78_surrealn', cc6_ordinal1)).
fof(t50_surrealo, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(((((v2_surreal0(X1)&v2_surrealo(X1))&v2_surreal0(X2))&v2_surrealo(X2))&r2_surrealo(X1,X2))=>X1=X2))), file('surrealn/surrealn__t78_surrealn', t50_surrealo)).
fof(t73_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>(r2_surrealo(k9_surrealn(X1),k8_surrealn(X1))&k12_surreal0(k9_surrealn(X1))=X1)), file('surrealn/surrealn__t78_surrealn', t73_surrealn)).
fof(fc3_surrealn, axiom, ![X1]:(v1_int_1(X1)=>v2_surrealo(k1_funct_1(k1_surrealn,X1))), file('surrealn/surrealn__t78_surrealn', fc3_surrealn)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('surrealn/surrealn__t78_surrealn', cc2_int_1)).
fof(fc1_surrealn, axiom, ![X1]:(v1_int_1(X1)=>v2_surreal0(k1_funct_1(k1_surrealn,X1))), file('surrealn/surrealn__t78_surrealn', fc1_surrealn)).
fof(dt_k9_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>((v2_surreal0(k9_surrealn(X1))&v2_surrealo(k9_surrealn(X1)))&v3_surrealn(k9_surrealn(X1)))), file('surrealn/surrealn__t78_surrealn', dt_k9_surrealn)).
fof(c_0_9, negated_conjecture, ~(![X1]:(v7_ordinal1(X1)=>k1_funct_1(k1_surrealn,X1)=k9_surrealn(X1))), inference(assume_negation,[status(cth)],[t78_surrealn])).
fof(c_0_10, plain, ![X21]:(~v7_ordinal1(X21)|k1_funct_1(k1_surrealn,X21)=k8_surrealn(X21)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t72_surrealn])])).
fof(c_0_11, negated_conjecture, (v7_ordinal1(esk1_0)&k1_funct_1(k1_surrealn,esk1_0)!=k9_surrealn(esk1_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
fof(c_0_12, plain, ![X15]:(~v7_ordinal1(X15)|v3_ordinal1(X15)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc6_ordinal1])])).
fof(c_0_13, plain, ![X19, X20]:(~v2_surreal0(X19)|(~v2_surreal0(X20)|(~v2_surreal0(X19)|~v2_surrealo(X19)|~v2_surreal0(X20)|~v2_surrealo(X20)|~r2_surrealo(X19,X20)|X19=X20))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t50_surrealo])])])).
fof(c_0_14, plain, ![X22]:((r2_surrealo(k9_surrealn(X22),k8_surrealn(X22))|~v3_ordinal1(X22))&(k12_surreal0(k9_surrealn(X22))=X22|~v3_ordinal1(X22))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t73_surrealn])])])).
cnf(c_0_15, plain, (k1_funct_1(k1_surrealn,X1)=k8_surrealn(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_16, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_17, plain, (v3_ordinal1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, plain, (X1=X2|~v2_surreal0(X1)|~v2_surreal0(X2)|~v2_surreal0(X1)|~v2_surrealo(X1)|~v2_surreal0(X2)|~v2_surrealo(X2)|~r2_surrealo(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_19, plain, (r2_surrealo(k9_surrealn(X1),k8_surrealn(X1))|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_20, negated_conjecture, (k8_surrealn(esk1_0)=k1_funct_1(k1_surrealn,esk1_0)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_21, negated_conjecture, (v3_ordinal1(esk1_0)), inference(spm,[status(thm)],[c_0_17, c_0_16])).
fof(c_0_22, plain, ![X18]:(~v1_int_1(X18)|v2_surrealo(k1_funct_1(k1_surrealn,X18))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_surrealn])])).
fof(c_0_23, plain, ![X14]:(~v7_ordinal1(X14)|v1_int_1(X14)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_24, plain, (X1=X2|~v2_surreal0(X2)|~v2_surreal0(X1)|~v2_surrealo(X2)|~v2_surrealo(X1)|~r2_surrealo(X1,X2)), inference(cn,[status(thm)],[c_0_18])).
cnf(c_0_25, negated_conjecture, (r2_surrealo(k9_surrealn(esk1_0),k1_funct_1(k1_surrealn,esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])])).
cnf(c_0_26, negated_conjecture, (k1_funct_1(k1_surrealn,esk1_0)!=k9_surrealn(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_27, plain, (v2_surrealo(k1_funct_1(k1_surrealn,X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_28, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
fof(c_0_29, 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_30, negated_conjecture, (~v2_surrealo(k1_funct_1(k1_surrealn,esk1_0))|~v2_surrealo(k9_surrealn(esk1_0))|~v2_surreal0(k1_funct_1(k1_surrealn,esk1_0))|~v2_surreal0(k9_surrealn(esk1_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])).
cnf(c_0_31, plain, (v2_surrealo(k1_funct_1(k1_surrealn,X1))|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_27, c_0_28])).
cnf(c_0_32, plain, (v2_surreal0(k1_funct_1(k1_surrealn,X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
cnf(c_0_33, negated_conjecture, (~v2_surrealo(k9_surrealn(esk1_0))|~v2_surreal0(k1_funct_1(k1_surrealn,esk1_0))|~v2_surreal0(k9_surrealn(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_16])])).
cnf(c_0_34, plain, (v2_surreal0(k1_funct_1(k1_surrealn,X1))|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_32, c_0_28])).
fof(c_0_35, plain, ![X16]:(((v2_surreal0(k9_surrealn(X16))|~v3_ordinal1(X16))&(v2_surrealo(k9_surrealn(X16))|~v3_ordinal1(X16)))&(v3_surrealn(k9_surrealn(X16))|~v3_ordinal1(X16))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k9_surrealn])])])).
cnf(c_0_36, negated_conjecture, (~v2_surrealo(k9_surrealn(esk1_0))|~v2_surreal0(k9_surrealn(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_16])])).
cnf(c_0_37, plain, (v2_surrealo(k9_surrealn(X1))|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_38, negated_conjecture, (~v2_surreal0(k9_surrealn(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_21])])).
cnf(c_0_39, plain, (v2_surreal0(k9_surrealn(X1))|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_40, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_21])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 41
# Proof object clause steps            : 22
# Proof object formula steps           : 19
# Proof object conjectures             : 13
# Proof object clause conjectures      : 10
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 10
# Proof object simplifying inferences  : 12
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 13
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 13
# Processed clauses                    : 36
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 36
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 2
# Backward-rewritten                   : 0
# Generated clauses                    : 12
# ...of the previous two non-trivial   : 11
# Contextual simplify-reflections      : 0
# Paramodulations                      : 12
# 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  : 5
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 14
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 6
# Current number of archived formulas  : 0
# Current number of archived clauses   : 15
# Clause-clause subsumption calls (NU) : 24
# Rec. Clause-clause subsumption calls : 24
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 1
# 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          : 1181

# -------------------------------------------------
# User time                : 0.024 s
# System time              : 0.000 s
# Total time               : 0.024 s
# Maximum resident set size: 2932 pages
