# 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.017 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d3_surreali, axiom, ![X1, X2, X3, X4]:((v1_relat_1(X4)&v1_funct_1(X4))=>![X5]:(X5=k3_surreali(X1,X2,X3,X4)<=>![X6]:(r2_hidden(X6,X5)<=>?[X7]:(r2_hidden(X7,X1)&r2_hidden(X6,k2_surreali(X7,X2,X3,X4)))))), file('surreali/surreali__t11_surreali', d3_surreali)).
fof(d3_tarski, axiom, ![X1, X2]:(r1_tarski(X1,X2)<=>![X3]:(r2_hidden(X3,X1)=>r2_hidden(X3,X2))), file('surreali/surreali__t11_surreali', d3_tarski)).
fof(t11_surreali, conjecture, ![X1]:(v2_surreal0(X1)=>![X2, X3, X4, X5]:((v1_relat_1(X5)&v1_funct_1(X5))=>(r1_tarski(X3,X4)=>r1_tarski(k3_surreali(X3,X1,X2,X5),k3_surreali(X4,X1,X2,X5))))), file('surreali/surreali__t11_surreali', t11_surreali)).
fof(c_0_3, plain, ![X28, X29, X30, X31, X32, X33, X35, X36, X37, X39]:((((r2_hidden(esk6_6(X28,X29,X30,X31,X32,X33),X28)|~r2_hidden(X33,X32)|X32!=k3_surreali(X28,X29,X30,X31)|(~v1_relat_1(X31)|~v1_funct_1(X31)))&(r2_hidden(X33,k2_surreali(esk6_6(X28,X29,X30,X31,X32,X33),X29,X30,X31))|~r2_hidden(X33,X32)|X32!=k3_surreali(X28,X29,X30,X31)|(~v1_relat_1(X31)|~v1_funct_1(X31))))&(~r2_hidden(X36,X28)|~r2_hidden(X35,k2_surreali(X36,X29,X30,X31))|r2_hidden(X35,X32)|X32!=k3_surreali(X28,X29,X30,X31)|(~v1_relat_1(X31)|~v1_funct_1(X31))))&((~r2_hidden(esk7_5(X28,X29,X30,X31,X37),X37)|(~r2_hidden(X39,X28)|~r2_hidden(esk7_5(X28,X29,X30,X31,X37),k2_surreali(X39,X29,X30,X31)))|X37=k3_surreali(X28,X29,X30,X31)|(~v1_relat_1(X31)|~v1_funct_1(X31)))&((r2_hidden(esk8_5(X28,X29,X30,X31,X37),X28)|r2_hidden(esk7_5(X28,X29,X30,X31,X37),X37)|X37=k3_surreali(X28,X29,X30,X31)|(~v1_relat_1(X31)|~v1_funct_1(X31)))&(r2_hidden(esk7_5(X28,X29,X30,X31,X37),k2_surreali(esk8_5(X28,X29,X30,X31,X37),X29,X30,X31))|r2_hidden(esk7_5(X28,X29,X30,X31,X37),X37)|X37=k3_surreali(X28,X29,X30,X31)|(~v1_relat_1(X31)|~v1_funct_1(X31)))))), 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)],[d3_surreali])])])])])])).
cnf(c_0_4, plain, (r2_hidden(X3,X7)|~r2_hidden(X1,X2)|~r2_hidden(X3,k2_surreali(X1,X4,X5,X6))|X7!=k3_surreali(X2,X4,X5,X6)|~v1_relat_1(X6)|~v1_funct_1(X6)), inference(split_conjunct,[status(thm)],[c_0_3])).
cnf(c_0_5, plain, (r2_hidden(X1,k2_surreali(esk6_6(X2,X3,X4,X5,X6,X1),X3,X4,X5))|~r2_hidden(X1,X6)|X6!=k3_surreali(X2,X3,X4,X5)|~v1_relat_1(X5)|~v1_funct_1(X5)), inference(split_conjunct,[status(thm)],[c_0_3])).
fof(c_0_6, plain, ![X41, X42, X43, X44, X45]:((~r1_tarski(X41,X42)|(~r2_hidden(X43,X41)|r2_hidden(X43,X42)))&((r2_hidden(esk9_2(X44,X45),X44)|r1_tarski(X44,X45))&(~r2_hidden(esk9_2(X44,X45),X45)|r1_tarski(X44,X45)))), 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)],[d3_tarski])])])])])])).
cnf(c_0_7, plain, (r2_hidden(esk6_6(X1,X2,X3,X4,X5,X6),X1)|~r2_hidden(X6,X5)|X5!=k3_surreali(X1,X2,X3,X4)|~v1_relat_1(X4)|~v1_funct_1(X4)), inference(split_conjunct,[status(thm)],[c_0_3])).
cnf(c_0_8, plain, (r2_hidden(X1,k3_surreali(X2,X3,X4,X5))|~r2_hidden(X1,k2_surreali(X6,X3,X4,X5))|~r2_hidden(X6,X2)|~v1_funct_1(X5)|~v1_relat_1(X5)), inference(er,[status(thm)],[c_0_4])).
cnf(c_0_9, plain, (r2_hidden(X1,k2_surreali(esk6_6(X2,X3,X4,X5,k3_surreali(X2,X3,X4,X5),X1),X3,X4,X5))|~r2_hidden(X1,k3_surreali(X2,X3,X4,X5))|~v1_funct_1(X5)|~v1_relat_1(X5)), inference(er,[status(thm)],[c_0_5])).
cnf(c_0_10, plain, (r2_hidden(X3,X2)|~r1_tarski(X1,X2)|~r2_hidden(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, plain, (r2_hidden(esk6_6(X1,X2,X3,X4,k3_surreali(X1,X2,X3,X4),X5),X1)|~r2_hidden(X5,k3_surreali(X1,X2,X3,X4))|~v1_funct_1(X4)|~v1_relat_1(X4)), inference(er,[status(thm)],[c_0_7])).
cnf(c_0_12, plain, (r2_hidden(X1,k3_surreali(X2,X3,X4,X5))|~r2_hidden(esk6_6(X6,X3,X4,X5,k3_surreali(X6,X3,X4,X5),X1),X2)|~r2_hidden(X1,k3_surreali(X6,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(esk6_6(X1,X2,X3,X4,k3_surreali(X1,X2,X3,X4),X5),X6)|~r2_hidden(X5,k3_surreali(X1,X2,X3,X4))|~r1_tarski(X1,X6)|~v1_funct_1(X4)|~v1_relat_1(X4)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
fof(c_0_14, negated_conjecture, ~(![X1]:(v2_surreal0(X1)=>![X2, X3, X4, X5]:((v1_relat_1(X5)&v1_funct_1(X5))=>(r1_tarski(X3,X4)=>r1_tarski(k3_surreali(X3,X1,X2,X5),k3_surreali(X4,X1,X2,X5)))))), inference(assume_negation,[status(cth)],[t11_surreali])).
cnf(c_0_15, plain, (r2_hidden(X1,k3_surreali(X2,X3,X4,X5))|~r2_hidden(X1,k3_surreali(X6,X3,X4,X5))|~r1_tarski(X6,X2)|~v1_funct_1(X5)|~v1_relat_1(X5)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_16, plain, (r2_hidden(esk9_2(X1,X2),X1)|r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
fof(c_0_17, negated_conjecture, (v2_surreal0(esk1_0)&((v1_relat_1(esk5_0)&v1_funct_1(esk5_0))&(r1_tarski(esk3_0,esk4_0)&~r1_tarski(k3_surreali(esk3_0,esk1_0,esk2_0,esk5_0),k3_surreali(esk4_0,esk1_0,esk2_0,esk5_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])).
cnf(c_0_18, plain, (r2_hidden(esk9_2(k3_surreali(X1,X2,X3,X4),X5),k3_surreali(X6,X2,X3,X4))|r1_tarski(k3_surreali(X1,X2,X3,X4),X5)|~r1_tarski(X1,X6)|~v1_funct_1(X4)|~v1_relat_1(X4)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_19, negated_conjecture, (r1_tarski(esk3_0,esk4_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_20, negated_conjecture, (r2_hidden(esk9_2(k3_surreali(esk3_0,X1,X2,X3),X4),k3_surreali(esk4_0,X1,X2,X3))|r1_tarski(k3_surreali(esk3_0,X1,X2,X3),X4)|~v1_funct_1(X3)|~v1_relat_1(X3)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
cnf(c_0_21, negated_conjecture, (v1_funct_1(esk5_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_22, negated_conjecture, (v1_relat_1(esk5_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_23, plain, (r1_tarski(X1,X2)|~r2_hidden(esk9_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_24, negated_conjecture, (r2_hidden(esk9_2(k3_surreali(esk3_0,X1,X2,esk5_0),X3),k3_surreali(esk4_0,X1,X2,esk5_0))|r1_tarski(k3_surreali(esk3_0,X1,X2,esk5_0),X3)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])])).
cnf(c_0_25, negated_conjecture, (~r1_tarski(k3_surreali(esk3_0,esk1_0,esk2_0,esk5_0),k3_surreali(esk4_0,esk1_0,esk2_0,esk5_0))), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_26, negated_conjecture, (r1_tarski(k3_surreali(esk3_0,X1,X2,esk5_0),k3_surreali(esk4_0,X1,X2,esk5_0))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_27, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 28
# Proof object clause steps            : 21
# Proof object formula steps           : 7
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 3
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 3
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 14
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 14
# Processed clauses                    : 58
# ...of these trivial                  : 0
# ...subsumed                          : 5
# ...remaining for further processing  : 53
# Other redundant clauses eliminated   : 3
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 82
# ...of the previous two non-trivial   : 76
# Contextual simplify-reflections      : 0
# Paramodulations                      : 79
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 3
# 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  : 35
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 29
# Current number of unprocessed clauses: 46
# ...number of literals in the above   : 300
# Current number of archived formulas  : 0
# Current number of archived clauses   : 15
# Clause-clause subsumption calls (NU) : 305
# Rec. Clause-clause subsumption calls : 65
# Non-unit clause-clause subsumptions  : 5
# Unit Clause-clause subsumption calls : 5
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 4
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 3277

# -------------------------------------------------
# User time                : 0.023 s
# System time              : 0.000 s
# Total time               : 0.023 s
# Maximum resident set size: 3644 pages
