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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t71_surrealn, conjecture, ![X1]:(v3_ordinal1(X1)=>![X2]:(v2_surreal0(X2)=>~((r2_tarski(X2,k1_surreal0(k8_surrealn(X1)))&![X3]:(v3_ordinal1(X3)=>~((r2_tarski(X3,X1)&X2=k8_surrealn(X3)))))))), file('surrealn/surrealn__t71_surrealn', t71_surrealn)).
fof(rd1_xtuple_0, axiom, ![X1, X2]:k1_xtuple_0(k4_tarski(X1,X2))=X1, file('surrealn/surrealn__t71_surrealn', rd1_xtuple_0)).
fof(redefinition_k1_surreal0, axiom, ![X1]:k1_surreal0(X1)=k1_xtuple_0(X1), file('surrealn/surrealn__t71_surrealn', redefinition_k1_surreal0)).
fof(t66_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>~((v4_ordinal1(X1)&![X2]:~((k8_surrealn(X1)=k4_tarski(X2,k1_xboole_0)&![X3]:(r2_hidden(X3,X2)<=>?[X4]:((v3_ordinal1(X4)&r2_tarski(X4,X1))&X3=k8_surrealn(X4)))))))), file('surrealn/surrealn__t71_surrealn', t66_surrealn)).
fof(t29_ordinal1, axiom, ![X1]:(v3_ordinal1(X1)=>(~((~(v4_ordinal1(X1))&![X2]:(v3_ordinal1(X2)=>X1!=k1_ordinal1(X2))))&~((?[X2]:(v3_ordinal1(X2)&X1=k1_ordinal1(X2))&v4_ordinal1(X1))))), file('surrealn/surrealn__t71_surrealn', t29_ordinal1)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('surrealn/surrealn__t71_surrealn', redefinition_r2_tarski)).
fof(d1_ordinal1, axiom, ![X1]:k1_ordinal1(X1)=k2_xboole_0(X1,k1_tarski(X1)), file('surrealn/surrealn__t71_surrealn', d1_ordinal1)).
fof(t65_surrealn, axiom, ![X1]:(v3_ordinal1(X1)=>k8_surrealn(k1_ordinal1(X1))=k4_tarski(k1_tarski(k8_surrealn(X1)),k1_xboole_0)), file('surrealn/surrealn__t71_surrealn', t65_surrealn)).
fof(t6_ordinal1, axiom, ![X1]:r2_tarski(X1,k1_ordinal1(X1)), file('surrealn/surrealn__t71_surrealn', t6_ordinal1)).
fof(d1_tarski, axiom, ![X1, X2]:(X2=k1_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>X3=X1)), file('surrealn/surrealn__t71_surrealn', d1_tarski)).
fof(c_0_10, negated_conjecture, ~(![X1]:(v3_ordinal1(X1)=>![X2]:(v2_surreal0(X2)=>~((r2_tarski(X2,k1_surreal0(k8_surrealn(X1)))&![X3]:(v3_ordinal1(X3)=>~((r2_tarski(X3,X1)&X2=k8_surrealn(X3))))))))), inference(assume_negation,[status(cth)],[t71_surrealn])).
fof(c_0_11, plain, ![X37, X38]:k1_xtuple_0(k4_tarski(X37,X38))=X37, inference(variable_rename,[status(thm)],[rd1_xtuple_0])).
fof(c_0_12, plain, ![X39]:k1_surreal0(X39)=k1_xtuple_0(X39), inference(variable_rename,[status(thm)],[redefinition_k1_surreal0])).
fof(c_0_13, negated_conjecture, ![X28]:(v3_ordinal1(esk1_0)&(v2_surreal0(esk2_0)&(r2_tarski(esk2_0,k1_surreal0(k8_surrealn(esk1_0)))&(~v3_ordinal1(X28)|(~r2_tarski(X28,esk1_0)|esk2_0!=k8_surrealn(X28)))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])])).
fof(c_0_14, plain, ![X46, X48, X50, X51]:((k8_surrealn(X46)=k4_tarski(esk5_1(X46),k1_xboole_0)|~v4_ordinal1(X46)|~v3_ordinal1(X46))&((((v3_ordinal1(esk6_2(X46,X48))|~r2_hidden(X48,esk5_1(X46))|~v4_ordinal1(X46)|~v3_ordinal1(X46))&(r2_tarski(esk6_2(X46,X48),X46)|~r2_hidden(X48,esk5_1(X46))|~v4_ordinal1(X46)|~v3_ordinal1(X46)))&(X48=k8_surrealn(esk6_2(X46,X48))|~r2_hidden(X48,esk5_1(X46))|~v4_ordinal1(X46)|~v3_ordinal1(X46)))&(~v3_ordinal1(X51)|~r2_tarski(X51,X46)|X50!=k8_surrealn(X51)|r2_hidden(X50,esk5_1(X46))|~v4_ordinal1(X46)|~v3_ordinal1(X46)))), 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)],[t66_surrealn])])])])])])).
fof(c_0_15, plain, ![X1]:(v3_ordinal1(X1)=>(~((~v4_ordinal1(X1)&![X2]:(v3_ordinal1(X2)=>X1!=k1_ordinal1(X2))))&~((?[X2]:(v3_ordinal1(X2)&X1=k1_ordinal1(X2))&v4_ordinal1(X1))))), inference(fof_simplification,[status(thm)],[t29_ordinal1])).
fof(c_0_16, plain, ![X40, X41]:((~r2_tarski(X40,X41)|r2_hidden(X40,X41))&(~r2_hidden(X40,X41)|r2_tarski(X40,X41))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_17, plain, (k1_xtuple_0(k4_tarski(X1,X2))=X1), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_18, plain, (k1_surreal0(X1)=k1_xtuple_0(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_19, negated_conjecture, (~v3_ordinal1(X1)|~r2_tarski(X1,esk1_0)|esk2_0!=k8_surrealn(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_20, plain, (r2_tarski(esk6_2(X1,X2),X1)|~r2_hidden(X2,esk5_1(X1))|~v4_ordinal1(X1)|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_21, negated_conjecture, (v3_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
fof(c_0_22, plain, ![X42, X44]:(((v3_ordinal1(esk4_1(X42))|v4_ordinal1(X42)|~v3_ordinal1(X42))&(X42=k1_ordinal1(esk4_1(X42))|v4_ordinal1(X42)|~v3_ordinal1(X42)))&(~v3_ordinal1(X44)|X42!=k1_ordinal1(X44)|~v4_ordinal1(X42)|~v3_ordinal1(X42))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])).
cnf(c_0_23, plain, (r2_hidden(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_24, negated_conjecture, (r2_tarski(esk2_0,k1_surreal0(k8_surrealn(esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_25, plain, (k1_surreal0(k4_tarski(X1,X2))=X1), inference(rw,[status(thm)],[c_0_17, c_0_18])).
cnf(c_0_26, plain, (k8_surrealn(X1)=k4_tarski(esk5_1(X1),k1_xboole_0)|~v4_ordinal1(X1)|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_27, negated_conjecture, (k8_surrealn(esk6_2(esk1_0,X1))!=esk2_0|~v4_ordinal1(esk1_0)|~r2_hidden(X1,esk5_1(esk1_0))|~v3_ordinal1(esk6_2(esk1_0,X1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])])).
cnf(c_0_28, plain, (X1=k8_surrealn(esk6_2(X2,X1))|~r2_hidden(X1,esk5_1(X2))|~v4_ordinal1(X2)|~v3_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_29, plain, (v3_ordinal1(esk4_1(X1))|v4_ordinal1(X1)|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_30, negated_conjecture, (r2_hidden(esk2_0,k1_surreal0(k8_surrealn(esk1_0)))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_31, plain, (k1_surreal0(k8_surrealn(X1))=esk5_1(X1)|~v4_ordinal1(X1)|~v3_ordinal1(X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
fof(c_0_32, plain, ![X29]:k1_ordinal1(X29)=k2_xboole_0(X29,k1_tarski(X29)), inference(variable_rename,[status(thm)],[d1_ordinal1])).
cnf(c_0_33, negated_conjecture, (~v4_ordinal1(esk1_0)|~r2_hidden(esk2_0,esk5_1(esk1_0))|~v3_ordinal1(esk6_2(esk1_0,esk2_0))), inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_21])])])).
cnf(c_0_34, negated_conjecture, (v4_ordinal1(esk1_0)|v3_ordinal1(esk4_1(esk1_0))), inference(spm,[status(thm)],[c_0_29, c_0_21])).
cnf(c_0_35, negated_conjecture, (r2_hidden(esk2_0,esk5_1(esk1_0))|~v4_ordinal1(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_21])])).
fof(c_0_36, plain, ![X45]:(~v3_ordinal1(X45)|k8_surrealn(k1_ordinal1(X45))=k4_tarski(k1_tarski(k8_surrealn(X45)),k1_xboole_0)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t65_surrealn])])).
cnf(c_0_37, plain, (X1=k1_ordinal1(esk4_1(X1))|v4_ordinal1(X1)|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_38, plain, (k1_ordinal1(X1)=k2_xboole_0(X1,k1_tarski(X1))), inference(split_conjunct,[status(thm)],[c_0_32])).
cnf(c_0_39, negated_conjecture, (v3_ordinal1(esk4_1(esk1_0))|~r2_hidden(esk2_0,esk5_1(esk1_0))|~v3_ordinal1(esk6_2(esk1_0,esk2_0))), inference(spm,[status(thm)],[c_0_33, c_0_34])).
cnf(c_0_40, negated_conjecture, (r2_hidden(esk2_0,esk5_1(esk1_0))|v3_ordinal1(esk4_1(esk1_0))), inference(spm,[status(thm)],[c_0_35, c_0_34])).
cnf(c_0_41, plain, (k8_surrealn(k1_ordinal1(X1))=k4_tarski(k1_tarski(k8_surrealn(X1)),k1_xboole_0)|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_42, plain, (X1=k2_xboole_0(esk4_1(X1),k1_tarski(esk4_1(X1)))|v4_ordinal1(X1)|~v3_ordinal1(X1)), inference(rw,[status(thm)],[c_0_37, c_0_38])).
cnf(c_0_43, plain, (v3_ordinal1(esk6_2(X1,X2))|~r2_hidden(X2,esk5_1(X1))|~v4_ordinal1(X1)|~v3_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_44, negated_conjecture, (v3_ordinal1(esk4_1(esk1_0))|~v3_ordinal1(esk6_2(esk1_0,esk2_0))), inference(spm,[status(thm)],[c_0_39, c_0_40])).
fof(c_0_45, plain, ![X52]:r2_tarski(X52,k1_ordinal1(X52)), inference(variable_rename,[status(thm)],[t6_ordinal1])).
cnf(c_0_46, plain, (k8_surrealn(k2_xboole_0(X1,k1_tarski(X1)))=k4_tarski(k1_tarski(k8_surrealn(X1)),k1_xboole_0)|~v3_ordinal1(X1)), inference(rw,[status(thm)],[c_0_41, c_0_38])).
cnf(c_0_47, negated_conjecture, (k2_xboole_0(esk4_1(esk1_0),k1_tarski(esk4_1(esk1_0)))=esk1_0|v4_ordinal1(esk1_0)), inference(spm,[status(thm)],[c_0_42, c_0_21])).
cnf(c_0_48, negated_conjecture, (v3_ordinal1(esk4_1(esk1_0))), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_40]), c_0_21])]), c_0_34]), c_0_44])).
cnf(c_0_49, plain, (r2_tarski(X1,k1_ordinal1(X1))), inference(split_conjunct,[status(thm)],[c_0_45])).
fof(c_0_50, plain, ![X30, X31, X32, X33, X34, X35]:(((~r2_hidden(X32,X31)|X32=X30|X31!=k1_tarski(X30))&(X33!=X30|r2_hidden(X33,X31)|X31!=k1_tarski(X30)))&((~r2_hidden(esk3_2(X34,X35),X35)|esk3_2(X34,X35)!=X34|X35=k1_tarski(X34))&(r2_hidden(esk3_2(X34,X35),X35)|esk3_2(X34,X35)=X34|X35=k1_tarski(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)],[d1_tarski])])])])])])).
cnf(c_0_51, negated_conjecture, (k4_tarski(k1_tarski(k8_surrealn(esk4_1(esk1_0))),k1_xboole_0)=k8_surrealn(esk1_0)|v4_ordinal1(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46, c_0_47]), c_0_48])])).
cnf(c_0_52, plain, (r2_tarski(X1,k2_xboole_0(X1,k1_tarski(X1)))), inference(rw,[status(thm)],[c_0_49, c_0_38])).
cnf(c_0_53, plain, (X1=X3|~r2_hidden(X1,X2)|X2!=k1_tarski(X3)), inference(split_conjunct,[status(thm)],[c_0_50])).
cnf(c_0_54, negated_conjecture, (k1_surreal0(k8_surrealn(esk1_0))=k1_tarski(k8_surrealn(esk4_1(esk1_0)))|v4_ordinal1(esk1_0)), inference(spm,[status(thm)],[c_0_25, c_0_51])).
cnf(c_0_55, negated_conjecture, (v4_ordinal1(esk1_0)|r2_tarski(esk4_1(esk1_0),esk1_0)), inference(spm,[status(thm)],[c_0_52, c_0_47])).
cnf(c_0_56, plain, (X1=X2|~r2_hidden(X1,k1_tarski(X2))), inference(er,[status(thm)],[c_0_53])).
cnf(c_0_57, negated_conjecture, (v4_ordinal1(esk1_0)|r2_hidden(esk2_0,k1_tarski(k8_surrealn(esk4_1(esk1_0))))), inference(spm,[status(thm)],[c_0_30, c_0_54])).
cnf(c_0_58, negated_conjecture, (v4_ordinal1(esk1_0)|k8_surrealn(esk4_1(esk1_0))!=esk2_0), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_55]), c_0_34])).
cnf(c_0_59, negated_conjecture, (v4_ordinal1(esk1_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_57]), c_0_58])).
cnf(c_0_60, negated_conjecture, (r2_hidden(esk2_0,esk5_1(esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_59])])).
cnf(c_0_61, negated_conjecture, (v3_ordinal1(esk6_2(esk1_0,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_60]), c_0_59]), c_0_21])])).
cnf(c_0_62, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_33, c_0_59])]), c_0_60]), c_0_61])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 63
# Proof object clause steps            : 41
# Proof object formula steps           : 22
# Proof object conjectures             : 25
# Proof object clause conjectures      : 22
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 16
# Proof object initial formulas used   : 10
# Proof object generating inferences   : 18
# Proof object simplifying inferences  : 30
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 10
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 23
# Removed in clause preprocessing      : 2
# Initial clauses in saturation        : 21
# Processed clauses                    : 100
# ...of these trivial                  : 0
# ...subsumed                          : 4
# ...remaining for further processing  : 95
# Other redundant clauses eliminated   : 11
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 5
# Backward-rewritten                   : 21
# Generated clauses                    : 190
# ...of the previous two non-trivial   : 175
# Contextual simplify-reflections      : 7
# Paramodulations                      : 178
# Factorizations                       : 2
# NegExts                              : 0
# Equation resolutions                 : 11
# 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  : 13
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 31
# Current number of unprocessed clauses: 117
# ...number of literals in the above   : 498
# Current number of archived formulas  : 0
# Current number of archived clauses   : 49
# Clause-clause subsumption calls (NU) : 509
# Rec. Clause-clause subsumption calls : 236
# Non-unit clause-clause subsumptions  : 14
# Unit Clause-clause subsumption calls : 17
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 3
# BW rewrite match successes           : 3
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 4470

# -------------------------------------------------
# User time                : 0.024 s
# System time              : 0.004 s
# Total time               : 0.028 s
# Maximum resident set size: 3572 pages
