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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('surrealc/surrealc__t9_surrealc', cc8_ordinal1)).
fof(d3_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r2_surrealc(X1,X2)<=>![X3]:((v1_xreal_0(X3)&v2_xxreal_0(X3))=>~(r5_surreal0(X2,k16_surrealr(X1,k1_funct_1(k6_surrealn,X3)))))))), file('surrealc/surrealc__t9_surrealc', d3_surrealc)).
fof(cc2_xreal_0, axiom, ![X1]:(v7_ordinal1(X1)=>v1_xreal_0(X1)), file('surrealc/surrealc__t9_surrealc', cc2_xreal_0)).
fof(spc1_numerals, axiom, (v2_xxreal_0(np__1)&m1_subset_1(np__1,k4_ordinal1)), file('surrealc/surrealc__t9_surrealc', spc1_numerals)).
fof(t48_surrealn, axiom, k1_funct_1(k6_surrealn,np__1)=k1_surrealo, file('surrealc/surrealc__t9_surrealc', t48_surrealn)).
fof(rd5_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>k16_surrealr(X1,k1_surrealo)=X1), file('surrealc/surrealc__t9_surrealc', rd5_surrealr)).
fof(t9_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>~((r2_surrealc(X1,X2)&r5_surreal0(X2,X1))))), file('surrealc/surrealc__t9_surrealc', t9_surrealc)).
fof(c_0_7, plain, ![X15]:(~m1_subset_1(X15,k4_ordinal1)|v7_ordinal1(X15)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_8, plain, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r2_surrealc(X1,X2)<=>![X3]:((v1_xreal_0(X3)&v2_xxreal_0(X3))=>~r5_surreal0(X2,k16_surrealr(X1,k1_funct_1(k6_surrealn,X3))))))), inference(fof_simplification,[status(thm)],[d3_surrealc])).
fof(c_0_9, plain, ![X14]:(~v7_ordinal1(X14)|v1_xreal_0(X14)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_xreal_0])])).
cnf(c_0_10, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_11, plain, (m1_subset_1(np__1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc1_numerals])).
fof(c_0_12, plain, ![X16, X17, X18]:((~r2_surrealc(X16,X17)|(~v1_xreal_0(X18)|~v2_xxreal_0(X18)|~r5_surreal0(X17,k16_surrealr(X16,k1_funct_1(k6_surrealn,X18))))|~v2_surreal0(X17)|~v2_surreal0(X16))&(((v1_xreal_0(esk3_2(X16,X17))|r2_surrealc(X16,X17)|~v2_surreal0(X17)|~v2_surreal0(X16))&(v2_xxreal_0(esk3_2(X16,X17))|r2_surrealc(X16,X17)|~v2_surreal0(X17)|~v2_surreal0(X16)))&(r5_surreal0(X17,k16_surrealr(X16,k1_funct_1(k6_surrealn,esk3_2(X16,X17))))|r2_surrealc(X16,X17)|~v2_surreal0(X17)|~v2_surreal0(X16)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])).
cnf(c_0_13, plain, (v1_xreal_0(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, plain, (v7_ordinal1(np__1)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
cnf(c_0_15, plain, (~r2_surrealc(X1,X2)|~v1_xreal_0(X3)|~v2_xxreal_0(X3)|~r5_surreal0(X2,k16_surrealr(X1,k1_funct_1(k6_surrealn,X3)))|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_16, plain, (k1_funct_1(k6_surrealn,np__1)=k1_surrealo), inference(split_conjunct,[status(thm)],[t48_surrealn])).
cnf(c_0_17, plain, (v2_xxreal_0(np__1)), inference(split_conjunct,[status(thm)],[spc1_numerals])).
cnf(c_0_18, plain, (v1_xreal_0(np__1)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
fof(c_0_19, plain, ![X20]:(~v2_surreal0(X20)|k16_surrealr(X20,k1_surrealo)=X20), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rd5_surrealr])])).
fof(c_0_20, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>~((r2_surrealc(X1,X2)&r5_surreal0(X2,X1)))))), inference(assume_negation,[status(cth)],[t9_surrealc])).
cnf(c_0_21, plain, (~r5_surreal0(X1,k16_surrealr(X2,k1_surrealo))|~r2_surrealc(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17]), c_0_18])])).
cnf(c_0_22, plain, (k16_surrealr(X1,k1_surrealo)=X1|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
fof(c_0_23, negated_conjecture, (v2_surreal0(esk1_0)&(v2_surreal0(esk2_0)&(r2_surrealc(esk1_0,esk2_0)&r5_surreal0(esk2_0,esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])).
cnf(c_0_24, plain, (~r5_surreal0(X1,X2)|~r2_surrealc(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_25, negated_conjecture, (r5_surreal0(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_26, negated_conjecture, (r2_surrealc(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_27, negated_conjecture, (v2_surreal0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_28, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26]), c_0_27]), c_0_28])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 30
# Proof object clause steps            : 16
# Proof object formula steps           : 14
# Proof object conjectures             : 8
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 5
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 14
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 14
# 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                   : 0
# Generated clauses                    : 11
# ...of the previous two non-trivial   : 9
# Contextual simplify-reflections      : 0
# Paramodulations                      : 11
# 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  : 18
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 9
# Current number of unprocessed clauses: 5
# ...number of literals in the above   : 15
# Current number of archived formulas  : 0
# Current number of archived clauses   : 14
# Clause-clause subsumption calls (NU) : 67
# Rec. Clause-clause subsumption calls : 14
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 1117

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.000 s
# Total time               : 0.021 s
# Maximum resident set size: 3008 pages
