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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t6_surreals, axiom, ![X1, X2]:(v1_xtuple_0(X2)=>(k1_funct_1(k4_surreals(X2,X1),k5_numbers)=k1_surreal0(X2)&k1_funct_1(k5_surreals(X2,X1),k5_numbers)=k2_surreal0(X2))), file('surreals/surreals__t16_surreals', t6_surreals)).
fof(t16_surreals, conjecture, ![X1, X2]:(v1_xtuple_0(X2)=>(k3_card_3(k4_surreals(X2,X1))=k1_xboole_0=>k1_surreal0(X2)=k1_xboole_0)), file('surreals/surreals__t16_surreals', t16_surreals)).
fof(redefinition_k5_numbers, axiom, k5_numbers=k5_ordinal1, file('surreals/surreals__t16_surreals', redefinition_k5_numbers)).
fof(dt_k4_surreals, axiom, ![X1, X2]:(v1_xtuple_0(X1)=>(v1_relat_1(k4_surreals(X1,X2))&v1_funct_1(k4_surreals(X1,X2)))), file('surreals/surreals__t16_surreals', dt_k4_surreals)).
fof(t1_abcmiz_1, axiom, ![X1, X2]:((v1_relat_1(X2)&v1_funct_1(X2))=>r1_tarski(k1_funct_1(X2,X1),k3_card_3(X2))), file('surreals/surreals__t16_surreals', t1_abcmiz_1)).
fof(cc1_subset_1, axiom, ![X1]:(v1_xboole_0(X1)=>![X2]:(m1_subset_1(X2,k1_zfmisc_1(X1))=>v1_xboole_0(X2))), file('surreals/surreals__t16_surreals', cc1_subset_1)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('surreals/surreals__t16_surreals', t3_subset)).
fof(fc1_xboole_0, axiom, v1_xboole_0(k1_xboole_0), file('surreals/surreals__t16_surreals', fc1_xboole_0)).
fof(t6_boole, axiom, ![X1]:(v1_xboole_0(X1)=>X1=k1_xboole_0), file('surreals/surreals__t16_surreals', t6_boole)).
fof(c_0_9, plain, ![X29, X30]:((k1_funct_1(k4_surreals(X30,X29),k5_numbers)=k1_surreal0(X30)|~v1_xtuple_0(X30))&(k1_funct_1(k5_surreals(X30,X29),k5_numbers)=k2_surreal0(X30)|~v1_xtuple_0(X30))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_surreals])])])).
fof(c_0_10, negated_conjecture, ~(![X1, X2]:(v1_xtuple_0(X2)=>(k3_card_3(k4_surreals(X2,X1))=k1_xboole_0=>k1_surreal0(X2)=k1_xboole_0))), inference(assume_negation,[status(cth)],[t16_surreals])).
cnf(c_0_11, plain, (k1_funct_1(k4_surreals(X1,X2),k5_numbers)=k1_surreal0(X1)|~v1_xtuple_0(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_12, plain, (k5_numbers=k5_ordinal1), inference(split_conjunct,[status(thm)],[redefinition_k5_numbers])).
fof(c_0_13, negated_conjecture, (v1_xtuple_0(esk2_0)&(k3_card_3(k4_surreals(esk2_0,esk1_0))=k1_xboole_0&k1_surreal0(esk2_0)!=k1_xboole_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
fof(c_0_14, plain, ![X21, X22]:((v1_relat_1(k4_surreals(X21,X22))|~v1_xtuple_0(X21))&(v1_funct_1(k4_surreals(X21,X22))|~v1_xtuple_0(X21))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_surreals])])])).
fof(c_0_15, plain, ![X24, X25]:(~v1_relat_1(X25)|~v1_funct_1(X25)|r1_tarski(k1_funct_1(X25,X24),k3_card_3(X25))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_abcmiz_1])])).
cnf(c_0_16, plain, (k1_funct_1(k4_surreals(X1,X2),k5_ordinal1)=k1_surreal0(X1)|~v1_xtuple_0(X1)), inference(rw,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_17, negated_conjecture, (v1_xtuple_0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_18, plain, (v1_funct_1(k4_surreals(X1,X2))|~v1_xtuple_0(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_19, plain, (v1_relat_1(k4_surreals(X1,X2))|~v1_xtuple_0(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_20, plain, (r1_tarski(k1_funct_1(X1,X2),k3_card_3(X1))|~v1_relat_1(X1)|~v1_funct_1(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_21, negated_conjecture, (k1_funct_1(k4_surreals(esk2_0,X1),k5_ordinal1)=k1_surreal0(esk2_0)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_22, negated_conjecture, (v1_funct_1(k4_surreals(esk2_0,X1))), inference(spm,[status(thm)],[c_0_18, c_0_17])).
cnf(c_0_23, negated_conjecture, (v1_relat_1(k4_surreals(esk2_0,X1))), inference(spm,[status(thm)],[c_0_19, c_0_17])).
fof(c_0_24, plain, ![X19, X20]:(~v1_xboole_0(X19)|(~m1_subset_1(X20,k1_zfmisc_1(X19))|v1_xboole_0(X20))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_subset_1])])])).
fof(c_0_25, plain, ![X26, X27]:((~m1_subset_1(X26,k1_zfmisc_1(X27))|r1_tarski(X26,X27))&(~r1_tarski(X26,X27)|m1_subset_1(X26,k1_zfmisc_1(X27)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
cnf(c_0_26, negated_conjecture, (r1_tarski(k1_surreal0(esk2_0),k3_card_3(k4_surreals(esk2_0,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22]), c_0_23])])).
cnf(c_0_27, negated_conjecture, (k3_card_3(k4_surreals(esk2_0,esk1_0))=k1_xboole_0), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_28, plain, (v1_xboole_0(X2)|~v1_xboole_0(X1)|~m1_subset_1(X2,k1_zfmisc_1(X1))), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_29, plain, (v1_xboole_0(k1_xboole_0)), inference(split_conjunct,[status(thm)],[fc1_xboole_0])).
cnf(c_0_30, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_31, negated_conjecture, (r1_tarski(k1_surreal0(esk2_0),k1_xboole_0)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
fof(c_0_32, plain, ![X28]:(~v1_xboole_0(X28)|X28=k1_xboole_0), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])).
cnf(c_0_33, plain, (v1_xboole_0(X1)|~m1_subset_1(X1,k1_zfmisc_1(k1_xboole_0))), inference(spm,[status(thm)],[c_0_28, c_0_29])).
cnf(c_0_34, negated_conjecture, (m1_subset_1(k1_surreal0(esk2_0),k1_zfmisc_1(k1_xboole_0))), inference(spm,[status(thm)],[c_0_30, c_0_31])).
cnf(c_0_35, plain, (X1=k1_xboole_0|~v1_xboole_0(X1)), inference(split_conjunct,[status(thm)],[c_0_32])).
cnf(c_0_36, negated_conjecture, (v1_xboole_0(k1_surreal0(esk2_0))), inference(spm,[status(thm)],[c_0_33, c_0_34])).
cnf(c_0_37, negated_conjecture, (k1_surreal0(esk2_0)!=k1_xboole_0), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_38, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 39
# Proof object clause steps            : 22
# Proof object formula steps           : 17
# 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   : 9
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 10
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 15
# Removed in clause preprocessing      : 1
# Initial clauses in saturation        : 14
# Processed clauses                    : 37
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 37
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 16
# ...of the previous two non-trivial   : 13
# Contextual simplify-reflections      : 0
# Paramodulations                      : 16
# 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  : 23
#    Positive orientable unit clauses  : 12
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 10
# Current number of unprocessed clauses: 4
# ...number of literals in the above   : 8
# Current number of archived formulas  : 0
# Current number of archived clauses   : 15
# Clause-clause subsumption calls (NU) : 32
# Rec. Clause-clause subsumption calls : 28
# Non-unit clause-clause subsumptions  : 0
# 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          : 1155

# -------------------------------------------------
# User time                : 0.014 s
# System time              : 0.006 s
# Total time               : 0.020 s
# Maximum resident set size: 3028 pages
