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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t43_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>![X3]:(v2_surreal0(X3)=>((r2_surrealc(k4_surrealc(X1),X3)&r2_surrealc(k4_surrealc(X2),X3))=>r2_surrealc(k4_surrealc(k10_surrealr(X1,X2)),X3))))), file('surrealc/surrealc__t43_surrealc', t43_surrealc)).
fof(d9_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>k10_surrealr(X1,X2)=k8_surrealr(X1,k2_surrealr(X2)))), file('surrealc/surrealc__t43_surrealc', d9_surrealr)).
fof(t42_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r2_surrealc(k4_surrealc(X1),X2)=>r2_surrealc(k4_surrealc(k2_surrealr(X1)),X2)))), file('surrealc/surrealc__t43_surrealc', t42_surrealc)).
fof(t41_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>![X3]:(v2_surreal0(X3)=>((r2_surrealc(k4_surrealc(X1),X3)&r2_surrealc(k4_surrealc(X2),X3))=>r2_surrealc(k4_surrealc(k8_surrealr(X1,X2)),X3))))), file('surrealc/surrealc__t43_surrealc', t41_surrealc)).
fof(fc3_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>v2_surreal0(k2_surrealr(X1))), file('surrealc/surrealc__t43_surrealc', fc3_surrealr)).
fof(c_0_5, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>![X3]:(v2_surreal0(X3)=>((r2_surrealc(k4_surrealc(X1),X3)&r2_surrealc(k4_surrealc(X2),X3))=>r2_surrealc(k4_surrealc(k10_surrealr(X1,X2)),X3)))))), inference(assume_negation,[status(cth)],[t43_surrealc])).
fof(c_0_6, plain, ![X18, X19]:(~v2_surreal0(X18)|(~v2_surreal0(X19)|k10_surrealr(X18,X19)=k8_surrealr(X18,k2_surrealr(X19)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_surrealr])])])).
fof(c_0_7, negated_conjecture, (v2_surreal0(esk1_0)&(v2_surreal0(esk2_0)&(v2_surreal0(esk3_0)&((r2_surrealc(k4_surrealc(esk1_0),esk3_0)&r2_surrealc(k4_surrealc(esk2_0),esk3_0))&~r2_surrealc(k4_surrealc(k10_surrealr(esk1_0,esk2_0)),esk3_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
fof(c_0_8, plain, ![X24, X25]:(~v2_surreal0(X24)|(~v2_surreal0(X25)|(~r2_surrealc(k4_surrealc(X24),X25)|r2_surrealc(k4_surrealc(k2_surrealr(X24)),X25)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t42_surrealc])])])).
fof(c_0_9, plain, ![X21, X22, X23]:(~v2_surreal0(X21)|(~v2_surreal0(X22)|(~v2_surreal0(X23)|(~r2_surrealc(k4_surrealc(X21),X23)|~r2_surrealc(k4_surrealc(X22),X23)|r2_surrealc(k4_surrealc(k8_surrealr(X21,X22)),X23))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t41_surrealc])])])).
cnf(c_0_10, plain, (k10_surrealr(X1,X2)=k8_surrealr(X1,k2_surrealr(X2))|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, negated_conjecture, (v2_surreal0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, plain, (r2_surrealc(k4_surrealc(k2_surrealr(X1)),X2)|~v2_surreal0(X1)|~v2_surreal0(X2)|~r2_surrealc(k4_surrealc(X1),X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, negated_conjecture, (v2_surreal0(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_14, plain, ![X20]:(~v2_surreal0(X20)|v2_surreal0(k2_surrealr(X20))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_surrealr])])).
cnf(c_0_15, plain, (r2_surrealc(k4_surrealc(k8_surrealr(X1,X2)),X3)|~v2_surreal0(X1)|~v2_surreal0(X2)|~v2_surreal0(X3)|~r2_surrealc(k4_surrealc(X1),X3)|~r2_surrealc(k4_surrealc(X2),X3)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_16, negated_conjecture, (k8_surrealr(X1,k2_surrealr(esk2_0))=k10_surrealr(X1,esk2_0)|~v2_surreal0(X1)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
cnf(c_0_17, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_18, negated_conjecture, (r2_surrealc(k4_surrealc(k2_surrealr(X1)),esk3_0)|~r2_surrealc(k4_surrealc(X1),esk3_0)|~v2_surreal0(X1)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_19, negated_conjecture, (r2_surrealc(k4_surrealc(esk2_0),esk3_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_20, plain, (v2_surreal0(k2_surrealr(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_21, negated_conjecture, (r2_surrealc(k4_surrealc(k8_surrealr(X1,X2)),esk3_0)|~r2_surrealc(k4_surrealc(X2),esk3_0)|~r2_surrealc(k4_surrealc(X1),esk3_0)|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(spm,[status(thm)],[c_0_15, c_0_13])).
cnf(c_0_22, negated_conjecture, (k8_surrealr(esk1_0,k2_surrealr(esk2_0))=k10_surrealr(esk1_0,esk2_0)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_23, negated_conjecture, (r2_surrealc(k4_surrealc(k2_surrealr(esk2_0)),esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_11]), c_0_19])])).
cnf(c_0_24, negated_conjecture, (r2_surrealc(k4_surrealc(esk1_0),esk3_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_25, negated_conjecture, (v2_surreal0(k2_surrealr(esk2_0))), inference(spm,[status(thm)],[c_0_20, c_0_11])).
cnf(c_0_26, negated_conjecture, (~r2_surrealc(k4_surrealc(k10_surrealr(esk1_0,esk2_0)),esk3_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_27, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_24]), c_0_25]), c_0_17])]), c_0_26]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 28
# Proof object clause steps            : 17
# Proof object formula steps           : 11
# Proof object conjectures             : 16
# Proof object clause conjectures      : 13
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 8
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 10
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 10
# Processed clauses                    : 54
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 54
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 168
# ...of the previous two non-trivial   : 167
# Contextual simplify-reflections      : 0
# Paramodulations                      : 168
# 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  : 44
#    Positive orientable unit clauses  : 25
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 18
# Current number of unprocessed clauses: 113
# ...number of literals in the above   : 252
# Current number of archived formulas  : 0
# Current number of archived clauses   : 10
# Clause-clause subsumption calls (NU) : 10
# Rec. Clause-clause subsumption calls : 10
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 31
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 3968

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.002 s
# Total time               : 0.022 s
# Maximum resident set size: 3016 pages
