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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d2_surreali, axiom, ![X1, X2, X3, X4]:((v1_relat_1(X4)&v1_funct_1(X4))=>![X5]:(X5=k2_surreali(X1,X2,X3,X4)<=>![X6]:(r2_hidden(X6,X5)<=>?[X7]:((r2_hidden(X7,X3)&X7!=k11_surreal0)&X6=k1_surreali(k12_surrealr(k1_surrealo,k1_surreali(k12_surrealr(X7,k11_surrealr(X2)),X1)),k1_funct_1(X4,X7)))))), file('surreali/surreali__t4_surreali', d2_surreali)).
fof(dt_k1_surreali, axiom, ![X1, X2]:v2_surreal0(k1_surreali(X1,X2)), file('surreali/surreali__t4_surreali', dt_k1_surreali)).
fof(t4_surreali, conjecture, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>![X3, X4]:((v1_relat_1(X4)&v1_funct_1(X4))=>v3_surreal0(k2_surreali(X2,X1,X3,X4))))), file('surreali/surreali__t4_surreali', t4_surreali)).
fof(d16_surreal0, axiom, ![X1]:(v3_surreal0(X1)<=>![X2]:(r2_hidden(X2,X1)=>v2_surreal0(X2))), file('surreali/surreali__t4_surreali', d16_surreal0)).
fof(c_0_4, plain, ![X31, X32, X33, X34, X35, X36, X38, X39, X40, X42]:(((((r2_hidden(esk6_6(X31,X32,X33,X34,X35,X36),X33)|~r2_hidden(X36,X35)|X35!=k2_surreali(X31,X32,X33,X34)|(~v1_relat_1(X34)|~v1_funct_1(X34)))&(esk6_6(X31,X32,X33,X34,X35,X36)!=k11_surreal0|~r2_hidden(X36,X35)|X35!=k2_surreali(X31,X32,X33,X34)|(~v1_relat_1(X34)|~v1_funct_1(X34))))&(X36=k1_surreali(k12_surrealr(k1_surrealo,k1_surreali(k12_surrealr(esk6_6(X31,X32,X33,X34,X35,X36),k11_surrealr(X32)),X31)),k1_funct_1(X34,esk6_6(X31,X32,X33,X34,X35,X36)))|~r2_hidden(X36,X35)|X35!=k2_surreali(X31,X32,X33,X34)|(~v1_relat_1(X34)|~v1_funct_1(X34))))&(~r2_hidden(X39,X33)|X39=k11_surreal0|X38!=k1_surreali(k12_surrealr(k1_surrealo,k1_surreali(k12_surrealr(X39,k11_surrealr(X32)),X31)),k1_funct_1(X34,X39))|r2_hidden(X38,X35)|X35!=k2_surreali(X31,X32,X33,X34)|(~v1_relat_1(X34)|~v1_funct_1(X34))))&((~r2_hidden(esk7_5(X31,X32,X33,X34,X40),X40)|(~r2_hidden(X42,X33)|X42=k11_surreal0|esk7_5(X31,X32,X33,X34,X40)!=k1_surreali(k12_surrealr(k1_surrealo,k1_surreali(k12_surrealr(X42,k11_surrealr(X32)),X31)),k1_funct_1(X34,X42)))|X40=k2_surreali(X31,X32,X33,X34)|(~v1_relat_1(X34)|~v1_funct_1(X34)))&(((r2_hidden(esk8_5(X31,X32,X33,X34,X40),X33)|r2_hidden(esk7_5(X31,X32,X33,X34,X40),X40)|X40=k2_surreali(X31,X32,X33,X34)|(~v1_relat_1(X34)|~v1_funct_1(X34)))&(esk8_5(X31,X32,X33,X34,X40)!=k11_surreal0|r2_hidden(esk7_5(X31,X32,X33,X34,X40),X40)|X40=k2_surreali(X31,X32,X33,X34)|(~v1_relat_1(X34)|~v1_funct_1(X34))))&(esk7_5(X31,X32,X33,X34,X40)=k1_surreali(k12_surrealr(k1_surrealo,k1_surreali(k12_surrealr(esk8_5(X31,X32,X33,X34,X40),k11_surrealr(X32)),X31)),k1_funct_1(X34,esk8_5(X31,X32,X33,X34,X40)))|r2_hidden(esk7_5(X31,X32,X33,X34,X40),X40)|X40=k2_surreali(X31,X32,X33,X34)|(~v1_relat_1(X34)|~v1_funct_1(X34)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_surreali])])])])])])).
fof(c_0_5, plain, ![X44, X45]:v2_surreal0(k1_surreali(X44,X45)), inference(variable_rename,[status(thm)],[dt_k1_surreali])).
cnf(c_0_6, plain, (X1=k1_surreali(k12_surrealr(k1_surrealo,k1_surreali(k12_surrealr(esk6_6(X2,X3,X4,X5,X6,X1),k11_surrealr(X3)),X2)),k1_funct_1(X5,esk6_6(X2,X3,X4,X5,X6,X1)))|~r2_hidden(X1,X6)|X6!=k2_surreali(X2,X3,X4,X5)|~v1_relat_1(X5)|~v1_funct_1(X5)), inference(split_conjunct,[status(thm)],[c_0_4])).
fof(c_0_7, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>![X3, X4]:((v1_relat_1(X4)&v1_funct_1(X4))=>v3_surreal0(k2_surreali(X2,X1,X3,X4)))))), inference(assume_negation,[status(cth)],[t4_surreali])).
cnf(c_0_8, plain, (v2_surreal0(k1_surreali(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_9, plain, (k1_surreali(k12_surrealr(k1_surrealo,k1_surreali(k12_surrealr(esk6_6(X1,X2,X3,X4,k2_surreali(X1,X2,X3,X4),X5),k11_surrealr(X2)),X1)),k1_funct_1(X4,esk6_6(X1,X2,X3,X4,k2_surreali(X1,X2,X3,X4),X5)))=X5|~r2_hidden(X5,k2_surreali(X1,X2,X3,X4))|~v1_funct_1(X4)|~v1_relat_1(X4)), inference(er,[status(thm)],[c_0_6])).
fof(c_0_10, plain, ![X27, X28, X29]:((~v3_surreal0(X27)|(~r2_hidden(X28,X27)|v2_surreal0(X28)))&((r2_hidden(esk5_1(X29),X29)|v3_surreal0(X29))&(~v2_surreal0(esk5_1(X29))|v3_surreal0(X29)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_surreal0])])])])])])).
fof(c_0_11, negated_conjecture, (v2_surreal0(esk1_0)&(v2_surreal0(esk2_0)&((v1_relat_1(esk4_0)&v1_funct_1(esk4_0))&~v3_surreal0(k2_surreali(esk2_0,esk1_0,esk3_0,esk4_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
cnf(c_0_12, plain, (v2_surreal0(X1)|~r2_hidden(X1,k2_surreali(X2,X3,X4,X5))|~v1_funct_1(X5)|~v1_relat_1(X5)), inference(spm,[status(thm)],[c_0_8, c_0_9])).
cnf(c_0_13, plain, (r2_hidden(esk5_1(X1),X1)|v3_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_14, plain, (v3_surreal0(X1)|~v2_surreal0(esk5_1(X1))), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_15, negated_conjecture, (~v3_surreal0(k2_surreali(esk2_0,esk1_0,esk3_0,esk4_0))), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_16, plain, (v3_surreal0(k2_surreali(X1,X2,X3,X4))|~v1_funct_1(X4)|~v1_relat_1(X4)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14])).
cnf(c_0_17, negated_conjecture, (v1_funct_1(esk4_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_18, negated_conjecture, (v1_relat_1(esk4_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_19, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17]), c_0_18])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 20
# Proof object clause steps            : 11
# Proof object formula steps           : 9
# Proof object conjectures             : 7
# Proof object clause conjectures      : 4
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 7
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 3
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 17
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 17
# Processed clauses                    : 45
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 45
# Other redundant clauses eliminated   : 6
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 25
# ...of the previous two non-trivial   : 22
# Contextual simplify-reflections      : 1
# Paramodulations                      : 20
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 6
# 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  : 24
#    Positive orientable unit clauses  : 5
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 18
# Current number of unprocessed clauses: 9
# ...number of literals in the above   : 48
# Current number of archived formulas  : 0
# Current number of archived clauses   : 17
# Clause-clause subsumption calls (NU) : 222
# Rec. Clause-clause subsumption calls : 62
# 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          : 2204

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.005 s
# Total time               : 0.025 s
# Maximum resident set size: 3016 pages
