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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d6_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>((r1_surrealo(k11_surreal0,X1)=>k4_surrealc(X1)=X1)&(~(r1_surrealo(k11_surreal0,X1))=>k4_surrealc(X1)=k2_surrealr(X1)))), file('surrealc/surrealc__t50_surrealc', d6_surrealc)).
fof(t31_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>r1_surrealo(k11_surreal0,k4_surrealc(X1))), file('surrealc/surrealc__t50_surrealc', t31_surrealc)).
fof(dt_k4_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>v2_surreal0(k4_surrealc(X1))), file('surrealc/surrealc__t50_surrealc', dt_k4_surrealc)).
fof(t50_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>k4_surrealc(k4_surrealc(X1))=k4_surrealc(X1)), file('surrealc/surrealc__t50_surrealc', t50_surrealc)).
fof(c_0_4, plain, ![X1]:(v2_surreal0(X1)=>((r1_surrealo(k11_surreal0,X1)=>k4_surrealc(X1)=X1)&(~r1_surrealo(k11_surreal0,X1)=>k4_surrealc(X1)=k2_surrealr(X1)))), inference(fof_simplification,[status(thm)],[d6_surrealc])).
fof(c_0_5, plain, ![X9]:((~r1_surrealo(k11_surreal0,X9)|k4_surrealc(X9)=X9|~v2_surreal0(X9))&(r1_surrealo(k11_surreal0,X9)|k4_surrealc(X9)=k2_surrealr(X9)|~v2_surreal0(X9))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
fof(c_0_6, plain, ![X8]:(~v2_surreal0(X8)|r1_surrealo(k11_surreal0,k4_surrealc(X8))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t31_surrealc])])).
fof(c_0_7, plain, ![X7]:(~v2_surreal0(X7)|v2_surreal0(k4_surrealc(X7))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_surrealc])])).
fof(c_0_8, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>k4_surrealc(k4_surrealc(X1))=k4_surrealc(X1))), inference(assume_negation,[status(cth)],[t50_surrealc])).
cnf(c_0_9, plain, (k4_surrealc(X1)=X1|~r1_surrealo(k11_surreal0,X1)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_10, plain, (r1_surrealo(k11_surreal0,k4_surrealc(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, plain, (v2_surreal0(k4_surrealc(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_12, negated_conjecture, (v2_surreal0(esk1_0)&k4_surrealc(k4_surrealc(esk1_0))!=k4_surrealc(esk1_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
cnf(c_0_13, plain, (k4_surrealc(k4_surrealc(X1))=k4_surrealc(X1)|~v2_surreal0(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])).
cnf(c_0_14, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_15, negated_conjecture, (k4_surrealc(k4_surrealc(esk1_0))!=k4_surrealc(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_16, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 17
# Proof object clause steps            : 7
# Proof object formula steps           : 10
# Proof object conjectures             : 6
# Proof object clause conjectures      : 3
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 5
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 2
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 6
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 6
# Processed clauses                    : 13
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 13
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 3
# ...of the previous two non-trivial   : 1
# Contextual simplify-reflections      : 1
# Paramodulations                      : 3
# 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  : 7
#    Positive orientable unit clauses  : 1
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 5
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 6
# Clause-clause subsumption calls (NU) : 7
# Rec. Clause-clause subsumption calls : 7
# Non-unit clause-clause subsumptions  : 1
# 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          : 482

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.001 s
# Total time               : 0.022 s
# Maximum resident set size: 2956 pages
