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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t22_surreals, conjecture, ![X1]:(v2_surreal0(X1)=>(r2_surrealo(k11_surreal0,X1)=>r2_surrealo(k8_surreals(X1),k11_surreal0))), file('surreals/surreals__t22_surreals', t22_surreals)).
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('surreals/surreals__t22_surreals', d2_surrealo)).
fof(t19_surreals, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r1_surrealo(k11_surreal0,X1)=>((((X2=k8_surreals(X1)=>(((r1_surrealo(k11_surreal0,X2)&r2_surrealo(k16_surrealr(X2,X2),X1))&(r2_surrealo(X1,k11_surreal0)=>r2_surrealo(X2,k11_surreal0)))&~((~(r5_surreal0(X1,k11_surreal0))&r5_surreal0(X2,k11_surreal0)))))&(r2_tarski(X2,k1_surreal0(k8_surreals(X1)))=>(r1_surrealo(k11_surreal0,X2)&~(r5_surreal0(X1,k16_surrealr(X2,X2))))))&(r2_tarski(X2,k2_surreal0(k8_surreals(X1)))=>(~(r5_surreal0(X2,k11_surreal0))&~(r5_surreal0(k16_surrealr(X2,X2),X1)))))&v2_surreal0(k8_surreals(X1)))))), file('surreals/surreals__t22_surreals', t19_surreals)).
fof(dt_k11_surreal0, axiom, v2_surreal0(k11_surreal0), file('surreals/surreals__t22_surreals', dt_k11_surreal0)).
fof(c_0_4, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>(r2_surrealo(k11_surreal0,X1)=>r2_surrealo(k8_surreals(X1),k11_surreal0)))), inference(assume_negation,[status(cth)],[t22_surreals])).
fof(c_0_5, plain, ![X13, X14]:(((r1_surrealo(X13,X14)|~r2_surrealo(X13,X14)|~v2_surreal0(X14)|~v2_surreal0(X13))&(r1_surrealo(X14,X13)|~r2_surrealo(X13,X14)|~v2_surreal0(X14)|~v2_surreal0(X13)))&(~r1_surrealo(X13,X14)|~r1_surrealo(X14,X13)|r2_surrealo(X13,X14)|~v2_surreal0(X14)|~v2_surreal0(X13))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_surrealo])])])])).
fof(c_0_6, negated_conjecture, (v2_surreal0(esk1_0)&(r2_surrealo(k11_surreal0,esk1_0)&~r2_surrealo(k8_surreals(esk1_0),k11_surreal0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
fof(c_0_7, plain, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r1_surrealo(k11_surreal0,X1)=>((((X2=k8_surreals(X1)=>(((r1_surrealo(k11_surreal0,X2)&r2_surrealo(k16_surrealr(X2,X2),X1))&(r2_surrealo(X1,k11_surreal0)=>r2_surrealo(X2,k11_surreal0)))&~((~r5_surreal0(X1,k11_surreal0)&r5_surreal0(X2,k11_surreal0)))))&(r2_tarski(X2,k1_surreal0(k8_surreals(X1)))=>(r1_surrealo(k11_surreal0,X2)&~r5_surreal0(X1,k16_surrealr(X2,X2)))))&(r2_tarski(X2,k2_surreal0(k8_surreals(X1)))=>(~r5_surreal0(X2,k11_surreal0)&~r5_surreal0(k16_surrealr(X2,X2),X1))))&v2_surreal0(k8_surreals(X1)))))), inference(fof_simplification,[status(thm)],[t19_surreals])).
cnf(c_0_8, plain, (r1_surrealo(X1,X2)|~r2_surrealo(X1,X2)|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_9, negated_conjecture, (r2_surrealo(k11_surreal0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, plain, (v2_surreal0(k11_surreal0)), inference(split_conjunct,[status(thm)],[dt_k11_surreal0])).
cnf(c_0_12, plain, (r1_surrealo(X1,X2)|~r2_surrealo(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_5])).
fof(c_0_13, plain, ![X15, X16]:(((((((r1_surrealo(k11_surreal0,X16)|X16!=k8_surreals(X15)|~r1_surrealo(k11_surreal0,X15)|~v2_surreal0(X16)|~v2_surreal0(X15))&(r2_surrealo(k16_surrealr(X16,X16),X15)|X16!=k8_surreals(X15)|~r1_surrealo(k11_surreal0,X15)|~v2_surreal0(X16)|~v2_surreal0(X15)))&(~r2_surrealo(X15,k11_surreal0)|r2_surrealo(X16,k11_surreal0)|X16!=k8_surreals(X15)|~r1_surrealo(k11_surreal0,X15)|~v2_surreal0(X16)|~v2_surreal0(X15)))&(r5_surreal0(X15,k11_surreal0)|~r5_surreal0(X16,k11_surreal0)|X16!=k8_surreals(X15)|~r1_surrealo(k11_surreal0,X15)|~v2_surreal0(X16)|~v2_surreal0(X15)))&((r1_surrealo(k11_surreal0,X16)|~r2_tarski(X16,k1_surreal0(k8_surreals(X15)))|~r1_surrealo(k11_surreal0,X15)|~v2_surreal0(X16)|~v2_surreal0(X15))&(~r5_surreal0(X15,k16_surrealr(X16,X16))|~r2_tarski(X16,k1_surreal0(k8_surreals(X15)))|~r1_surrealo(k11_surreal0,X15)|~v2_surreal0(X16)|~v2_surreal0(X15))))&((~r5_surreal0(X16,k11_surreal0)|~r2_tarski(X16,k2_surreal0(k8_surreals(X15)))|~r1_surrealo(k11_surreal0,X15)|~v2_surreal0(X16)|~v2_surreal0(X15))&(~r5_surreal0(k16_surrealr(X16,X16),X15)|~r2_tarski(X16,k2_surreal0(k8_surreals(X15)))|~r1_surrealo(k11_surreal0,X15)|~v2_surreal0(X16)|~v2_surreal0(X15))))&(v2_surreal0(k8_surreals(X15))|~r1_surrealo(k11_surreal0,X15)|~v2_surreal0(X16)|~v2_surreal0(X15))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])).
cnf(c_0_14, 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_5])).
cnf(c_0_15, negated_conjecture, (r1_surrealo(k11_surreal0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10]), c_0_11])])).
cnf(c_0_16, negated_conjecture, (r1_surrealo(esk1_0,k11_surreal0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_9]), c_0_11]), c_0_10])])).
cnf(c_0_17, plain, (v2_surreal0(k8_surreals(X1))|~r1_surrealo(k11_surreal0,X1)|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_18, plain, (r2_surrealo(X2,k11_surreal0)|~r2_surrealo(X1,k11_surreal0)|X2!=k8_surreals(X1)|~r1_surrealo(k11_surreal0,X1)|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_19, negated_conjecture, (r2_surrealo(esk1_0,k11_surreal0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_16]), c_0_11]), c_0_10])])).
cnf(c_0_20, negated_conjecture, (v2_surreal0(k8_surreals(esk1_0))|~v2_surreal0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_15]), c_0_10])])).
cnf(c_0_21, negated_conjecture, (r2_surrealo(X1,k11_surreal0)|X1!=k8_surreals(esk1_0)|~v2_surreal0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_15]), c_0_10])]), c_0_19])])).
cnf(c_0_22, negated_conjecture, (v2_surreal0(k8_surreals(esk1_0))), inference(spm,[status(thm)],[c_0_20, c_0_10])).
cnf(c_0_23, negated_conjecture, (~r2_surrealo(k8_surreals(esk1_0),k11_surreal0)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_24, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_21]), c_0_22])]), c_0_23]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 25
# Proof object clause steps            : 16
# Proof object formula steps           : 9
# Proof object conjectures             : 13
# Proof object clause conjectures      : 10
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 19
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 18
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 18
# Processed clauses                    : 48
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 47
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 23
# ...of the previous two non-trivial   : 18
# Contextual simplify-reflections      : 0
# Paramodulations                      : 22
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# 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  : 28
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 18
# Current number of unprocessed clauses: 3
# ...number of literals in the above   : 11
# Current number of archived formulas  : 0
# Current number of archived clauses   : 19
# Clause-clause subsumption calls (NU) : 34
# Rec. Clause-clause subsumption calls : 9
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 10
# 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          : 2114

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.000 s
# Total time               : 0.020 s
# Maximum resident set size: 2904 pages
