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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t47_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>~((r2_surrealc(k4_surrealc(X2),k4_surrealc(X1))&r2_surrealo(X1,k11_surreal0))))), file('surrealc/surrealc__t47_surrealc', t47_surrealc)).
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__t47_surrealc', d6_surrealc)).
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('surrealc/surrealc__t47_surrealc', d2_surrealo)).
fof(t46_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>~((r2_surrealc(k4_surrealc(X2),X1)&r2_surrealo(X1,k11_surreal0))))), file('surrealc/surrealc__t47_surrealc', t46_surrealc)).
fof(fc3_surrealo, axiom, (v2_surreal0(k11_surreal0)&v2_surrealo(k11_surreal0)), file('surrealc/surrealc__t47_surrealc', fc3_surrealo)).
fof(c_0_5, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>~((r2_surrealc(k4_surrealc(X2),k4_surrealc(X1))&r2_surrealo(X1,k11_surreal0)))))), inference(assume_negation,[status(cth)],[t47_surrealc])).
fof(c_0_6, 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_7, plain, ![X12, X13]:(((r1_surrealo(X12,X13)|~r2_surrealo(X12,X13)|~v2_surreal0(X13)|~v2_surreal0(X12))&(r1_surrealo(X13,X12)|~r2_surrealo(X12,X13)|~v2_surreal0(X13)|~v2_surreal0(X12)))&(~r1_surrealo(X12,X13)|~r1_surrealo(X13,X12)|r2_surrealo(X12,X13)|~v2_surreal0(X13)|~v2_surreal0(X12))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_surrealo])])])])).
fof(c_0_8, negated_conjecture, (v2_surreal0(esk1_0)&(v2_surreal0(esk2_0)&(r2_surrealc(k4_surrealc(esk2_0),k4_surrealc(esk1_0))&r2_surrealo(esk1_0,k11_surreal0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
fof(c_0_9, plain, ![X15, X16]:(~v2_surreal0(X15)|(~v2_surreal0(X16)|(~r2_surrealc(k4_surrealc(X16),X15)|~r2_surrealo(X15,k11_surreal0)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t46_surrealc])])])).
fof(c_0_10, plain, ![X14]:((~r1_surrealo(k11_surreal0,X14)|k4_surrealc(X14)=X14|~v2_surreal0(X14))&(r1_surrealo(k11_surreal0,X14)|k4_surrealc(X14)=k2_surrealr(X14)|~v2_surreal0(X14))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
cnf(c_0_11, plain, (r1_surrealo(X1,X2)|~r2_surrealo(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, negated_conjecture, (r2_surrealo(esk1_0,k11_surreal0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, plain, (v2_surreal0(k11_surreal0)), inference(split_conjunct,[status(thm)],[fc3_surrealo])).
cnf(c_0_15, plain, (~v2_surreal0(X1)|~v2_surreal0(X2)|~r2_surrealc(k4_surrealc(X2),X1)|~r2_surrealo(X1,k11_surreal0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_16, negated_conjecture, (r2_surrealc(k4_surrealc(esk2_0),k4_surrealc(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_17, negated_conjecture, (v2_surreal0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_18, plain, (k4_surrealc(X1)=X1|~r1_surrealo(k11_surreal0,X1)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_19, 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_11, c_0_12]), c_0_13]), c_0_14])])).
cnf(c_0_20, negated_conjecture, (~r2_surrealo(k4_surrealc(esk1_0),k11_surreal0)|~v2_surreal0(k4_surrealc(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])])).
cnf(c_0_21, negated_conjecture, (k4_surrealc(esk1_0)=esk1_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_13])])).
cnf(c_0_22, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_21]), c_0_12]), c_0_21]), c_0_13])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 23
# Proof object clause steps            : 12
# Proof object formula steps           : 11
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 8
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 3
# Proof object simplifying inferences  : 12
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 12
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 12
# Processed clauses                    : 25
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 25
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 2
# Generated clauses                    : 5
# ...of the previous two non-trivial   : 4
# Contextual simplify-reflections      : 0
# Paramodulations                      : 5
# 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  : 11
#    Positive orientable unit clauses  : 7
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 3
# ...number of literals in the above   : 9
# Current number of archived formulas  : 0
# Current number of archived clauses   : 14
# Clause-clause subsumption calls (NU) : 6
# Rec. Clause-clause subsumption calls : 5
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 944

# -------------------------------------------------
# User time                : 0.017 s
# System time              : 0.004 s
# Total time               : 0.021 s
# Maximum resident set size: 3068 pages
