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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t6_boole, axiom, ![X1]:(v1_xboole_0(X1)=>X1=k1_xboole_0), file('number14/number14__t15_number14', t6_boole)).
fof(d13_ordinal1, axiom, k5_ordinal1=k1_xboole_0, file('number14/number14__t15_number14', d13_ordinal1)).
fof(redefinition_k5_numbers, axiom, k5_numbers=k5_ordinal1, file('number14/number14__t15_number14', redefinition_k5_numbers)).
fof(spc0_boole, axiom, v1_xboole_0(np__0), file('number14/number14__t15_number14', spc0_boole)).
fof(t4_arithm, axiom, ![X1]:(v1_xcmplx_0(X1)=>k6_xcmplx_0(X1,k5_numbers)=X1), file('number14/number14__t15_number14', t4_arithm)).
fof(cc3_xreal_0, axiom, ![X1]:(v1_xreal_0(X1)=>v1_xcmplx_0(X1)), file('number14/number14__t15_number14', cc3_xreal_0)).
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('number14/number14__t15_number14', cc8_ordinal1)).
fof(spc0_numerals, axiom, m1_subset_1(np__0,k4_ordinal1), file('number14/number14__t15_number14', spc0_numerals)).
fof(cc3_int_1, axiom, ![X1]:(v1_int_1(X1)=>v1_xreal_0(X1)), file('number14/number14__t15_number14', cc3_int_1)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number14/number14__t15_number14', cc2_int_1)).
fof(t15_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_1(X1,X2)=>r2_int_1(X2,k5_numbers,X1)))), file('number14/number14__t15_number14', t15_number14)).
fof(d4_int_1, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>(r2_int_1(X1,X2,X3)<=>r1_int_1(X3,k6_xcmplx_0(X1,X2)))))), file('number14/number14__t15_number14', d4_int_1)).
fof(c_0_12, plain, ![X21]:(~v1_xboole_0(X21)|X21=k1_xboole_0), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])).
cnf(c_0_13, plain, (k5_ordinal1=k1_xboole_0), inference(split_conjunct,[status(thm)],[d13_ordinal1])).
cnf(c_0_14, plain, (k5_numbers=k5_ordinal1), inference(split_conjunct,[status(thm)],[redefinition_k5_numbers])).
cnf(c_0_15, plain, (X1=k1_xboole_0|~v1_xboole_0(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_16, plain, (k1_xboole_0=k5_numbers), inference(rw,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_17, plain, (X1=k5_numbers|~v1_xboole_0(X1)), inference(rw,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_18, plain, (v1_xboole_0(np__0)), inference(split_conjunct,[status(thm)],[spc0_boole])).
fof(c_0_19, plain, ![X20]:(~v1_xcmplx_0(X20)|k6_xcmplx_0(X20,k5_numbers)=X20), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_arithm])])).
fof(c_0_20, plain, ![X18]:(~v1_xreal_0(X18)|v1_xcmplx_0(X18)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_xreal_0])])).
fof(c_0_21, plain, ![X19]:(~m1_subset_1(X19,k4_ordinal1)|v7_ordinal1(X19)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
cnf(c_0_22, plain, (m1_subset_1(np__0,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc0_numerals])).
cnf(c_0_23, plain, (np__0=k5_numbers), inference(spm,[status(thm)],[c_0_17, c_0_18])).
cnf(c_0_24, plain, (k6_xcmplx_0(X1,k5_numbers)=X1|~v1_xcmplx_0(X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_25, plain, (v1_xcmplx_0(X1)|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_20])).
fof(c_0_26, plain, ![X22]:(~v1_int_1(X22)|v1_xreal_0(X22)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_int_1])])).
fof(c_0_27, plain, ![X17]:(~v7_ordinal1(X17)|v1_int_1(X17)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_28, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_29, plain, (m1_subset_1(k5_numbers,k4_ordinal1)), inference(rw,[status(thm)],[c_0_22, c_0_23])).
fof(c_0_30, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_1(X1,X2)=>r2_int_1(X2,k5_numbers,X1))))), inference(assume_negation,[status(cth)],[t15_number14])).
fof(c_0_31, plain, ![X23, X24, X25]:((~r2_int_1(X23,X24,X25)|r1_int_1(X25,k6_xcmplx_0(X23,X24))|~v1_int_1(X25)|~v1_int_1(X24)|~v1_int_1(X23))&(~r1_int_1(X25,k6_xcmplx_0(X23,X24))|r2_int_1(X23,X24,X25)|~v1_int_1(X25)|~v1_int_1(X24)|~v1_int_1(X23))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_int_1])])])])).
cnf(c_0_32, plain, (k6_xcmplx_0(X1,k5_numbers)=X1|~v1_xreal_0(X1)), inference(spm,[status(thm)],[c_0_24, c_0_25])).
cnf(c_0_33, plain, (v1_xreal_0(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_34, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_35, plain, (v7_ordinal1(k5_numbers)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
fof(c_0_36, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&(r1_int_1(esk1_0,esk2_0)&~r2_int_1(esk2_0,k5_numbers,esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])).
cnf(c_0_37, plain, (r2_int_1(X2,X3,X1)|~r1_int_1(X1,k6_xcmplx_0(X2,X3))|~v1_int_1(X1)|~v1_int_1(X3)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_31])).
cnf(c_0_38, plain, (k6_xcmplx_0(X1,k5_numbers)=X1|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_32, c_0_33])).
cnf(c_0_39, plain, (v1_int_1(k5_numbers)), inference(spm,[status(thm)],[c_0_34, c_0_35])).
cnf(c_0_40, negated_conjecture, (~r2_int_1(esk2_0,k5_numbers,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_41, plain, (r2_int_1(X1,k5_numbers,X2)|~r1_int_1(X2,X1)|~v1_int_1(X1)|~v1_int_1(X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_39])])).
cnf(c_0_42, negated_conjecture, (r1_int_1(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_43, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_44, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_45, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42]), c_0_43]), c_0_44])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 46
# Proof object clause steps            : 25
# Proof object formula steps           : 21
# Proof object conjectures             : 8
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 15
# Proof object initial formulas used   : 12
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 9
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 12
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 16
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 16
# Processed clauses                    : 39
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 39
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 9
# ...of the previous two non-trivial   : 8
# Contextual simplify-reflections      : 0
# Paramodulations                      : 9
# 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  : 22
#    Positive orientable unit clauses  : 10
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 4
# Current number of archived formulas  : 0
# Current number of archived clauses   : 17
# Clause-clause subsumption calls (NU) : 56
# Rec. Clause-clause subsumption calls : 22
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 1034

# -------------------------------------------------
# User time                : 0.023 s
# System time              : 0.002 s
# Total time               : 0.025 s
# Maximum resident set size: 3652 pages
