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

# Failure: User resource limit exceeded!
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 14
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 14
# Processed clauses                    : 49818
# ...of these trivial                  : 1651
# ...subsumed                          : 9968
# ...remaining for further processing  : 38199
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 234
# Backward-subsumed                    : 789
# Backward-rewritten                   : 5548
# Generated clauses                    : 6786081
# ...of the previous two non-trivial   : 6782142
# Contextual simplify-reflections      : 99
# Paramodulations                      : 6786081
# 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  : 31848
#    Positive orientable unit clauses  : 6812
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 25035
# Current number of unprocessed clauses: 805321
# ...number of literals in the above   : 1735504
# Current number of archived formulas  : 0
# Current number of archived clauses   : 6351
# Clause-clause subsumption calls (NU) : 24482951
# Rec. Clause-clause subsumption calls : 23934168
# Non-unit clause-clause subsumptions  : 10856
# Unit Clause-clause subsumption calls : 8466232
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 594416
# BW rewrite match successes           : 3340
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 213096626
# No success with AutoSched0
# Trying AutoSched1 for 71 seconds
# AutoSched1-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
# and selection function PSelectComplexExceptUniqMaxHorn.
#
# Preprocessing time       : 0.021 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t43_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>![X3]:(v2_surreal0(X3)=>![X4]:(v2_surreal0(X4)=>((r1_surrealo(X1,X2)&r1_surrealo(X3,X4))=>r1_surrealo(k8_surrealr(X1,X3),k8_surrealr(X2,X4))))))), file('surrealc/surrealc__t37_surrealc', t43_surrealr)).
fof(t40_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>k2_surrealr(k8_surrealr(X1,X2))=k8_surrealr(k2_surrealr(X1),k2_surrealr(X2)))), file('surrealc/surrealc__t37_surrealc', t40_surrealr)).
fof(fc3_surrealr, axiom, ![X1]:(v2_surreal0(X1)=>v2_surreal0(k2_surrealr(X1))), file('surrealc/surrealc__t37_surrealc', fc3_surrealr)).
fof(fc6_surrealr, axiom, ![X1, X2]:((v2_surreal0(X1)&v2_surreal0(X2))=>v2_surreal0(k6_surrealr(X1,X2))), file('surrealc/surrealc__t37_surrealc', fc6_surrealr)).
fof(redefinition_k8_surrealr, axiom, ![X1, X2]:((v2_surreal0(X1)&v2_surreal0(X2))=>k8_surrealr(X1,X2)=k6_surrealr(X1,X2)), file('surrealc/surrealc__t37_surrealc', redefinition_k8_surrealr)).
fof(t37_surrealc, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>r1_surrealo(k4_surrealc(k8_surrealr(X1,X2)),k8_surrealr(k4_surrealc(X1),k4_surrealc(X2))))), file('surrealc/surrealc__t37_surrealc', t37_surrealc)).
fof(t35_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>((r1_surrealo(k2_surrealr(X2),X1)&r1_surrealo(X1,X2))<=>r1_surrealo(k4_surrealc(X1),X2)))), file('surrealc/surrealc__t37_surrealc', t35_surrealc)).
fof(t34_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>(r1_surrealo(k2_surrealr(k4_surrealc(X1)),X1)&r1_surrealo(X1,k4_surrealc(X1)))), file('surrealc/surrealc__t37_surrealc', t34_surrealc)).
fof(dt_k4_surrealc, axiom, ![X1]:(v2_surreal0(X1)=>v2_surreal0(k4_surrealc(X1))), file('surrealc/surrealc__t37_surrealc', dt_k4_surrealc)).
fof(c_0_9, plain, ![X35, X36, X37, X38]:(~v2_surreal0(X35)|(~v2_surreal0(X36)|(~v2_surreal0(X37)|(~v2_surreal0(X38)|(~r1_surrealo(X35,X36)|~r1_surrealo(X37,X38)|r1_surrealo(k8_surrealr(X35,X37),k8_surrealr(X36,X38))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t43_surrealr])])])).
fof(c_0_10, plain, ![X33, X34]:(~v2_surreal0(X33)|(~v2_surreal0(X34)|k2_surrealr(k8_surrealr(X33,X34))=k8_surrealr(k2_surrealr(X33),k2_surrealr(X34)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t40_surrealr])])])).
fof(c_0_11, plain, ![X25]:(~v2_surreal0(X25)|v2_surreal0(k2_surrealr(X25))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_surrealr])])).
fof(c_0_12, plain, ![X26, X27]:(~v2_surreal0(X26)|~v2_surreal0(X27)|v2_surreal0(k6_surrealr(X26,X27))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc6_surrealr])])).
fof(c_0_13, plain, ![X28, X29]:(~v2_surreal0(X28)|~v2_surreal0(X29)|k8_surrealr(X28,X29)=k6_surrealr(X28,X29)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k8_surrealr])])).
fof(c_0_14, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>r1_surrealo(k4_surrealc(k8_surrealr(X1,X2)),k8_surrealr(k4_surrealc(X1),k4_surrealc(X2)))))), inference(assume_negation,[status(cth)],[t37_surrealc])).
fof(c_0_15, plain, ![X31, X32]:((~r1_surrealo(k2_surrealr(X32),X31)|~r1_surrealo(X31,X32)|r1_surrealo(k4_surrealc(X31),X32)|~v2_surreal0(X32)|~v2_surreal0(X31))&((r1_surrealo(k2_surrealr(X32),X31)|~r1_surrealo(k4_surrealc(X31),X32)|~v2_surreal0(X32)|~v2_surreal0(X31))&(r1_surrealo(X31,X32)|~r1_surrealo(k4_surrealc(X31),X32)|~v2_surreal0(X32)|~v2_surreal0(X31)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t35_surrealc])])])])).
cnf(c_0_16, plain, (r1_surrealo(k8_surrealr(X1,X3),k8_surrealr(X2,X4))|~v2_surreal0(X1)|~v2_surreal0(X2)|~v2_surreal0(X3)|~v2_surreal0(X4)|~r1_surrealo(X1,X2)|~r1_surrealo(X3,X4)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_17, plain, (k2_surrealr(k8_surrealr(X1,X2))=k8_surrealr(k2_surrealr(X1),k2_surrealr(X2))|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_18, plain, (v2_surreal0(k2_surrealr(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_19, plain, (v2_surreal0(k6_surrealr(X1,X2))|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_20, plain, (k8_surrealr(X1,X2)=k6_surrealr(X1,X2)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
fof(c_0_21, negated_conjecture, (v2_surreal0(esk1_0)&(v2_surreal0(esk2_0)&~r1_surrealo(k4_surrealc(k8_surrealr(esk1_0,esk2_0)),k8_surrealr(k4_surrealc(esk1_0),k4_surrealc(esk2_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])).
cnf(c_0_22, plain, (r1_surrealo(k4_surrealc(X2),X1)|~r1_surrealo(k2_surrealr(X1),X2)|~r1_surrealo(X2,X1)|~v2_surreal0(X1)|~v2_surreal0(X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_23, plain, (r1_surrealo(k2_surrealr(k8_surrealr(X1,X2)),k8_surrealr(X3,X4))|~r1_surrealo(k2_surrealr(X2),X4)|~r1_surrealo(k2_surrealr(X1),X3)|~v2_surreal0(X4)|~v2_surreal0(X3)|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18]), c_0_18])).
cnf(c_0_24, plain, (v2_surreal0(k8_surrealr(X1,X2))|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_25, negated_conjecture, (~r1_surrealo(k4_surrealc(k8_surrealr(esk1_0,esk2_0)),k8_surrealr(k4_surrealc(esk1_0),k4_surrealc(esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_26, plain, (r1_surrealo(k4_surrealc(k8_surrealr(X1,X2)),k8_surrealr(X3,X4))|~r1_surrealo(k8_surrealr(X1,X2),k8_surrealr(X3,X4))|~r1_surrealo(k2_surrealr(X4),X2)|~r1_surrealo(k2_surrealr(X3),X1)|~v2_surreal0(X2)|~v2_surreal0(X1)|~v2_surreal0(X4)|~v2_surreal0(X3)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24]), c_0_24])).
cnf(c_0_27, negated_conjecture, (v2_surreal0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_28, negated_conjecture, (v2_surreal0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_29, negated_conjecture, (~r1_surrealo(k8_surrealr(esk1_0,esk2_0),k8_surrealr(k4_surrealc(esk1_0),k4_surrealc(esk2_0)))|~r1_surrealo(k2_surrealr(k4_surrealc(esk2_0)),esk2_0)|~r1_surrealo(k2_surrealr(k4_surrealc(esk1_0)),esk1_0)|~v2_surreal0(k4_surrealc(esk2_0))|~v2_surreal0(k4_surrealc(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27]), c_0_28])])).
fof(c_0_30, plain, ![X30]:((r1_surrealo(k2_surrealr(k4_surrealc(X30)),X30)|~v2_surreal0(X30))&(r1_surrealo(X30,k4_surrealc(X30))|~v2_surreal0(X30))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t34_surrealc])])])).
cnf(c_0_31, negated_conjecture, (~r1_surrealo(k2_surrealr(k4_surrealc(esk2_0)),esk2_0)|~r1_surrealo(k2_surrealr(k4_surrealc(esk1_0)),esk1_0)|~r1_surrealo(esk2_0,k4_surrealc(esk2_0))|~r1_surrealo(esk1_0,k4_surrealc(esk1_0))|~v2_surreal0(k4_surrealc(esk2_0))|~v2_surreal0(k4_surrealc(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_16]), c_0_27]), c_0_28])])).
cnf(c_0_32, plain, (r1_surrealo(k2_surrealr(k4_surrealc(X1)),X1)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_33, negated_conjecture, (~r1_surrealo(k2_surrealr(k4_surrealc(esk2_0)),esk2_0)|~r1_surrealo(esk2_0,k4_surrealc(esk2_0))|~r1_surrealo(esk1_0,k4_surrealc(esk1_0))|~v2_surreal0(k4_surrealc(esk2_0))|~v2_surreal0(k4_surrealc(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_28])])).
cnf(c_0_34, negated_conjecture, (~r1_surrealo(esk2_0,k4_surrealc(esk2_0))|~r1_surrealo(esk1_0,k4_surrealc(esk1_0))|~v2_surreal0(k4_surrealc(esk2_0))|~v2_surreal0(k4_surrealc(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_32]), c_0_27])])).
cnf(c_0_35, plain, (r1_surrealo(X1,k4_surrealc(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_36, negated_conjecture, (~r1_surrealo(esk2_0,k4_surrealc(esk2_0))|~v2_surreal0(k4_surrealc(esk2_0))|~v2_surreal0(k4_surrealc(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_28])])).
fof(c_0_37, plain, ![X24]:(~v2_surreal0(X24)|v2_surreal0(k4_surrealc(X24))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_surrealc])])).
cnf(c_0_38, negated_conjecture, (~v2_surreal0(k4_surrealc(esk2_0))|~v2_surreal0(k4_surrealc(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_35]), c_0_27])])).
cnf(c_0_39, plain, (v2_surreal0(k4_surrealc(X1))|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_37])).
cnf(c_0_40, negated_conjecture, (~v2_surreal0(k4_surrealc(esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_28])])).
cnf(c_0_41, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_39]), c_0_27])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 42
# Proof object clause steps            : 23
# Proof object formula steps           : 19
# Proof object conjectures             : 14
# Proof object clause conjectures      : 11
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 12
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 11
# Proof object simplifying inferences  : 22
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 14
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 14
# Processed clauses                    : 81
# ...of these trivial                  : 0
# ...subsumed                          : 2
# ...remaining for further processing  : 79
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 5
# Backward-rewritten                   : 0
# Generated clauses                    : 90
# ...of the previous two non-trivial   : 80
# Contextual simplify-reflections      : 60
# Paramodulations                      : 90
# 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  : 60
#    Positive orientable unit clauses  : 2
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 56
# Current number of unprocessed clauses: 27
# ...number of literals in the above   : 179
# Current number of archived formulas  : 0
# Current number of archived clauses   : 19
# Clause-clause subsumption calls (NU) : 1380
# Rec. Clause-clause subsumption calls : 549
# Non-unit clause-clause subsumptions  : 67
# Unit Clause-clause subsumption calls : 1
# 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          : 6466

# -------------------------------------------------
# User time                : 158.686 s
# System time              : 2.480 s
# Total time               : 161.166 s
# Maximum resident set size: 3500 pages
