# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
# and selection function SelectMaxLComplexAvoidPosPred.
#
# Preprocessing time       : 0.018 s

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d1_tarski, axiom, ![X1, X2]:(X2=k1_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>X3=X1)), file('surrealn/surrealn__l3_surrealn', d1_tarski)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('surrealn/surrealn__l3_surrealn', redefinition_r2_tarski)).
fof(d20_surreal0, axiom, ![X1, X2]:(r7_surreal0(X1,X2)<=>![X3]:(v2_surreal0(X3)=>![X4]:(v2_surreal0(X4)=>~(((r2_tarski(X3,X1)&r2_tarski(X4,X2))&r5_surreal0(X4,X3)))))), file('surrealn/surrealn__l3_surrealn', d20_surreal0)).
fof(t43_surreal0, axiom, ![X1]:(v2_surreal0(X1)=>![X2]:(v2_surreal0(X2)=>(r5_surreal0(X1,X2)<=>(r7_surreal0(k1_surreal0(X1),k1_tarski(X2))&r7_surreal0(k1_tarski(X1),k2_surreal0(X2)))))), file('surrealn/surrealn__l3_surrealn', t43_surreal0)).
fof(redefinition_k1_surreal0, axiom, ![X1]:k1_surreal0(X1)=k1_xtuple_0(X1), file('surrealn/surrealn__l3_surrealn', redefinition_k1_surreal0)).
fof(fc1_surrealn, axiom, ![X1]:(v1_int_1(X1)=>v2_surreal0(k1_funct_1(k1_surrealn,X1))), file('surrealn/surrealn__l3_surrealn', fc1_surrealn)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('surrealn/surrealn__l3_surrealn', cc2_int_1)).
fof(l3_surrealn, conjecture, ![X1]:(v7_ordinal1(X1)=>~(r5_surreal0(k1_funct_1(k1_surrealn,k2_xcmplx_0(X1,np__1)),k1_funct_1(k1_surrealn,X1)))), file('surrealn/surrealn__l3_surrealn', l3_surrealn)).
fof(t3_surrealo, axiom, ![X1]:(v2_surreal0(X1)=>r5_surreal0(X1,X1)), file('surrealn/surrealn__l3_surrealn', t3_surrealo)).
fof(rd1_xtuple_0, axiom, ![X1, X2]:k1_xtuple_0(k4_tarski(X1,X2))=X1, file('surrealn/surrealn__l3_surrealn', rd1_xtuple_0)).
fof(d1_surrealn, axiom, ![X1]:((((v1_relat_1(X1)&v4_relat_1(X1,k4_numbers))&v1_funct_1(X1))&v1_partfun1(X1,k4_numbers))=>(X1=k1_surrealn<=>![X2]:(v7_ordinal1(X2)=>((k1_funct_1(X1,k5_numbers)=k11_surreal0&k1_funct_1(X1,k2_xcmplx_0(X2,np__1))=k4_tarski(k1_tarski(k1_funct_1(X1,X2)),k1_xboole_0))&k1_funct_1(X1,k4_xcmplx_0(k2_xcmplx_0(X2,np__1)))=k4_tarski(k1_xboole_0,k1_tarski(k1_funct_1(X1,k4_xcmplx_0(X2)))))))), file('surrealn/surrealn__l3_surrealn', d1_surrealn)).
fof(fc7_int_1, axiom, ![X1]:(v2_int_1(X1)=>v7_ordinal1(k2_xcmplx_0(X1,np__1))), file('surrealn/surrealn__l3_surrealn', fc7_int_1)).
fof(dt_k1_surrealn, axiom, (((v1_relat_1(k1_surrealn)&v4_relat_1(k1_surrealn,k4_numbers))&v1_funct_1(k1_surrealn))&v1_partfun1(k1_surrealn,k4_numbers)), file('surrealn/surrealn__l3_surrealn', dt_k1_surrealn)).
fof(cc4_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v2_int_1(X1)), file('surrealn/surrealn__l3_surrealn', cc4_int_1)).
fof(c_0_14, plain, ![X33, X34, X35, X36, X37, X38]:(((~r2_hidden(X35,X34)|X35=X33|X34!=k1_tarski(X33))&(X36!=X33|r2_hidden(X36,X34)|X34!=k1_tarski(X33)))&((~r2_hidden(esk3_2(X37,X38),X38)|esk3_2(X37,X38)!=X37|X38=k1_tarski(X37))&(r2_hidden(esk3_2(X37,X38),X38)|esk3_2(X37,X38)=X37|X38=k1_tarski(X37)))), 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)],[d1_tarski])])])])])])).
fof(c_0_15, plain, ![X53, X54]:((~r2_tarski(X53,X54)|r2_hidden(X53,X54))&(~r2_hidden(X53,X54)|r2_tarski(X53,X54))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_16, plain, (r2_hidden(X1,X3)|X1!=X2|X3!=k1_tarski(X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
fof(c_0_17, plain, ![X40, X41, X42, X43, X44, X45]:((~r7_surreal0(X40,X41)|(~v2_surreal0(X42)|(~v2_surreal0(X43)|(~r2_tarski(X42,X40)|~r2_tarski(X43,X41)|~r5_surreal0(X43,X42)))))&((v2_surreal0(esk4_2(X44,X45))|r7_surreal0(X44,X45))&((v2_surreal0(esk5_2(X44,X45))|r7_surreal0(X44,X45))&(((r2_tarski(esk4_2(X44,X45),X44)|r7_surreal0(X44,X45))&(r2_tarski(esk5_2(X44,X45),X45)|r7_surreal0(X44,X45)))&(r5_surreal0(esk5_2(X44,X45),esk4_2(X44,X45))|r7_surreal0(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)],[d20_surreal0])])])])])])).
cnf(c_0_18, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_19, plain, (r2_hidden(X1,X2)|X2!=k1_tarski(X1)), inference(er,[status(thm)],[c_0_16])).
cnf(c_0_20, plain, (~r7_surreal0(X1,X2)|~v2_surreal0(X3)|~v2_surreal0(X4)|~r2_tarski(X3,X1)|~r2_tarski(X4,X2)|~r5_surreal0(X4,X3)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_21, plain, (r2_tarski(X1,X2)|X2!=k1_tarski(X1)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
fof(c_0_22, plain, ![X56, X57]:(((r7_surreal0(k1_surreal0(X56),k1_tarski(X57))|~r5_surreal0(X56,X57)|~v2_surreal0(X57)|~v2_surreal0(X56))&(r7_surreal0(k1_tarski(X56),k2_surreal0(X57))|~r5_surreal0(X56,X57)|~v2_surreal0(X57)|~v2_surreal0(X56)))&(~r7_surreal0(k1_surreal0(X56),k1_tarski(X57))|~r7_surreal0(k1_tarski(X56),k2_surreal0(X57))|r5_surreal0(X56,X57)|~v2_surreal0(X57)|~v2_surreal0(X56))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t43_surreal0])])])])).
fof(c_0_23, plain, ![X52]:k1_surreal0(X52)=k1_xtuple_0(X52), inference(variable_rename,[status(thm)],[redefinition_k1_surreal0])).
cnf(c_0_24, plain, (X1!=k1_tarski(X2)|~r2_tarski(X3,X4)|~v2_surreal0(X2)|~v2_surreal0(X3)|~r7_surreal0(X4,X1)|~r5_surreal0(X2,X3)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
cnf(c_0_25, plain, (r7_surreal0(k1_surreal0(X1),k1_tarski(X2))|~r5_surreal0(X1,X2)|~v2_surreal0(X2)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_26, plain, (k1_surreal0(X1)=k1_xtuple_0(X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
fof(c_0_27, plain, ![X48]:(~v1_int_1(X48)|v2_surreal0(k1_funct_1(k1_surrealn,X48))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_surrealn])])).
fof(c_0_28, plain, ![X28]:(~v7_ordinal1(X28)|v1_int_1(X28)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
fof(c_0_29, negated_conjecture, ~(![X1]:(v7_ordinal1(X1)=>~r5_surreal0(k1_funct_1(k1_surrealn,k2_xcmplx_0(X1,np__1)),k1_funct_1(k1_surrealn,X1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l3_surrealn])])).
cnf(c_0_30, plain, (X1!=k1_tarski(X2)|X3!=k1_tarski(X4)|~v2_surreal0(X2)|~v2_surreal0(X4)|~r7_surreal0(X3,X1)|~r5_surreal0(X2,X4)), inference(spm,[status(thm)],[c_0_24, c_0_21])).
cnf(c_0_31, plain, (r7_surreal0(k1_xtuple_0(X1),k1_tarski(X2))|~v2_surreal0(X2)|~v2_surreal0(X1)|~r5_surreal0(X1,X2)), inference(rw,[status(thm)],[c_0_25, c_0_26])).
fof(c_0_32, plain, ![X55]:(~v2_surreal0(X55)|r5_surreal0(X55,X55)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_surrealo])])).
cnf(c_0_33, plain, (v2_surreal0(k1_funct_1(k1_surrealn,X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_34, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_28])).
fof(c_0_35, negated_conjecture, (v7_ordinal1(esk1_0)&r5_surreal0(k1_funct_1(k1_surrealn,k2_xcmplx_0(esk1_0,np__1)),k1_funct_1(k1_surrealn,esk1_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])).
cnf(c_0_36, plain, (k1_tarski(X1)!=k1_tarski(X2)|k1_xtuple_0(X3)!=k1_tarski(X4)|~v2_surreal0(X2)|~v2_surreal0(X4)|~v2_surreal0(X1)|~v2_surreal0(X3)|~r5_surreal0(X2,X4)|~r5_surreal0(X3,X1)), inference(spm,[status(thm)],[c_0_30, c_0_31])).
cnf(c_0_37, plain, (r5_surreal0(X1,X1)|~v2_surreal0(X1)), inference(split_conjunct,[status(thm)],[c_0_32])).
cnf(c_0_38, plain, (v2_surreal0(k1_funct_1(k1_surrealn,X1))|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_33, c_0_34])).
cnf(c_0_39, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_35])).
fof(c_0_40, plain, ![X50, X51]:k1_xtuple_0(k4_tarski(X50,X51))=X50, inference(variable_rename,[status(thm)],[rd1_xtuple_0])).
fof(c_0_41, plain, ![X30, X31]:((((k1_funct_1(X30,k5_numbers)=k11_surreal0|~v7_ordinal1(X31)|X30!=k1_surrealn|(~v1_relat_1(X30)|~v4_relat_1(X30,k4_numbers)|~v1_funct_1(X30)|~v1_partfun1(X30,k4_numbers)))&(k1_funct_1(X30,k2_xcmplx_0(X31,np__1))=k4_tarski(k1_tarski(k1_funct_1(X30,X31)),k1_xboole_0)|~v7_ordinal1(X31)|X30!=k1_surrealn|(~v1_relat_1(X30)|~v4_relat_1(X30,k4_numbers)|~v1_funct_1(X30)|~v1_partfun1(X30,k4_numbers))))&(k1_funct_1(X30,k4_xcmplx_0(k2_xcmplx_0(X31,np__1)))=k4_tarski(k1_xboole_0,k1_tarski(k1_funct_1(X30,k4_xcmplx_0(X31))))|~v7_ordinal1(X31)|X30!=k1_surrealn|(~v1_relat_1(X30)|~v4_relat_1(X30,k4_numbers)|~v1_funct_1(X30)|~v1_partfun1(X30,k4_numbers))))&((v7_ordinal1(esk2_1(X30))|X30=k1_surrealn|(~v1_relat_1(X30)|~v4_relat_1(X30,k4_numbers)|~v1_funct_1(X30)|~v1_partfun1(X30,k4_numbers)))&(k1_funct_1(X30,k5_numbers)!=k11_surreal0|k1_funct_1(X30,k2_xcmplx_0(esk2_1(X30),np__1))!=k4_tarski(k1_tarski(k1_funct_1(X30,esk2_1(X30))),k1_xboole_0)|k1_funct_1(X30,k4_xcmplx_0(k2_xcmplx_0(esk2_1(X30),np__1)))!=k4_tarski(k1_xboole_0,k1_tarski(k1_funct_1(X30,k4_xcmplx_0(esk2_1(X30)))))|X30=k1_surrealn|(~v1_relat_1(X30)|~v4_relat_1(X30,k4_numbers)|~v1_funct_1(X30)|~v1_partfun1(X30,k4_numbers))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_surrealn])])])])])).
cnf(c_0_42, plain, (k1_tarski(X1)!=k1_tarski(X2)|k1_xtuple_0(X3)!=k1_tarski(X2)|~v2_surreal0(X2)|~v2_surreal0(X1)|~v2_surreal0(X3)|~r5_surreal0(X3,X1)), inference(spm,[status(thm)],[c_0_36, c_0_37])).
cnf(c_0_43, negated_conjecture, (r5_surreal0(k1_funct_1(k1_surrealn,k2_xcmplx_0(esk1_0,np__1)),k1_funct_1(k1_surrealn,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_44, negated_conjecture, (v2_surreal0(k1_funct_1(k1_surrealn,esk1_0))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
cnf(c_0_45, plain, (k1_xtuple_0(k4_tarski(X1,X2))=X1), inference(split_conjunct,[status(thm)],[c_0_40])).
cnf(c_0_46, plain, (k1_funct_1(X1,k2_xcmplx_0(X2,np__1))=k4_tarski(k1_tarski(k1_funct_1(X1,X2)),k1_xboole_0)|~v7_ordinal1(X2)|X1!=k1_surrealn|~v1_relat_1(X1)|~v4_relat_1(X1,k4_numbers)|~v1_funct_1(X1)|~v1_partfun1(X1,k4_numbers)), inference(split_conjunct,[status(thm)],[c_0_41])).
fof(c_0_47, plain, ![X49]:(~v2_int_1(X49)|v7_ordinal1(k2_xcmplx_0(X49,np__1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc7_int_1])])).
cnf(c_0_48, negated_conjecture, (k1_xtuple_0(k1_funct_1(k1_surrealn,k2_xcmplx_0(esk1_0,np__1)))!=k1_tarski(X1)|k1_tarski(k1_funct_1(k1_surrealn,esk1_0))!=k1_tarski(X1)|~v2_surreal0(k1_funct_1(k1_surrealn,k2_xcmplx_0(esk1_0,np__1)))|~v2_surreal0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_43]), c_0_44])])).
cnf(c_0_49, plain, (k1_xtuple_0(k1_funct_1(X1,k2_xcmplx_0(X2,np__1)))=k1_tarski(k1_funct_1(X1,X2))|X1!=k1_surrealn|~v1_partfun1(X1,k4_numbers)|~v1_funct_1(X1)|~v4_relat_1(X1,k4_numbers)|~v1_relat_1(X1)|~v7_ordinal1(X2)), inference(spm,[status(thm)],[c_0_45, c_0_46])).
cnf(c_0_50, plain, (v1_partfun1(k1_surrealn,k4_numbers)), inference(split_conjunct,[status(thm)],[dt_k1_surrealn])).
cnf(c_0_51, plain, (v1_funct_1(k1_surrealn)), inference(split_conjunct,[status(thm)],[dt_k1_surrealn])).
cnf(c_0_52, plain, (v4_relat_1(k1_surrealn,k4_numbers)), inference(split_conjunct,[status(thm)],[dt_k1_surrealn])).
cnf(c_0_53, plain, (v1_relat_1(k1_surrealn)), inference(split_conjunct,[status(thm)],[dt_k1_surrealn])).
cnf(c_0_54, plain, (v7_ordinal1(k2_xcmplx_0(X1,np__1))|~v2_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_47])).
cnf(c_0_55, negated_conjecture, (k1_tarski(k1_funct_1(k1_surrealn,esk1_0))!=k1_tarski(X1)|~v2_surreal0(k1_funct_1(k1_surrealn,k2_xcmplx_0(esk1_0,np__1)))|~v2_surreal0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_49]), c_0_50]), c_0_51]), c_0_52]), c_0_53]), c_0_39])])).
cnf(c_0_56, plain, (v2_surreal0(k1_funct_1(k1_surrealn,k2_xcmplx_0(X1,np__1)))|~v2_int_1(X1)), inference(spm,[status(thm)],[c_0_38, c_0_54])).
fof(c_0_57, plain, ![X29]:(~v7_ordinal1(X29)|v2_int_1(X29)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc4_int_1])])).
cnf(c_0_58, negated_conjecture, (k1_tarski(k1_funct_1(k1_surrealn,esk1_0))!=k1_tarski(X1)|~v2_surreal0(X1)|~v2_int_1(esk1_0)), inference(spm,[status(thm)],[c_0_55, c_0_56])).
cnf(c_0_59, plain, (v2_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_57])).
cnf(c_0_60, negated_conjecture, (k1_tarski(k1_funct_1(k1_surrealn,esk1_0))!=k1_tarski(X1)|~v2_surreal0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_59]), c_0_39])])).
cnf(c_0_61, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_60]), c_0_44])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 62
# Proof object clause steps            : 34
# Proof object formula steps           : 28
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 18
# Proof object initial formulas used   : 14
# Proof object generating inferences   : 14
# Proof object simplifying inferences  : 14
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 14
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 33
# Removed in clause preprocessing      : 1
# Initial clauses in saturation        : 32
# Processed clauses                    : 91
# ...of these trivial                  : 1
# ...subsumed                          : 4
# ...remaining for further processing  : 86
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 3
# Backward-rewritten                   : 1
# Generated clauses                    : 106
# ...of the previous two non-trivial   : 95
# Contextual simplify-reflections      : 6
# Paramodulations                      : 96
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 10
# 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  : 81
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 72
# Current number of unprocessed clauses: 35
# ...number of literals in the above   : 236
# Current number of archived formulas  : 0
# Current number of archived clauses   : 5
# Clause-clause subsumption calls (NU) : 1780
# Rec. Clause-clause subsumption calls : 381
# Non-unit clause-clause subsumptions  : 13
# Unit Clause-clause subsumption calls : 6
# 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          : 4873

# -------------------------------------------------
# User time                : 0.026 s
# System time              : 0.000 s
# Total time               : 0.026 s
# Maximum resident set size: 3400 pages
