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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('number14/number14__t18_number14', cc8_ordinal1)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number14/number14__t18_number14', cc2_int_1)).
fof(spc2_numerals, axiom, (v2_xxreal_0(np__2)&m1_subset_1(np__2,k4_ordinal1)), file('number14/number14__t18_number14', spc2_numerals)).
fof(fc1_abian, axiom, ![X1]:(v1_int_1(X1)=>v1_abian(k3_xcmplx_0(np__2,X1))), file('number14/number14__t18_number14', fc1_abian)).
fof(d5_int_1, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>(r2_int_1(X1,X2,X3)<=>?[X4]:(v1_int_1(X4)&k3_xcmplx_0(X3,X4)=k6_xcmplx_0(X1,X2)))))), file('number14/number14__t18_number14', d5_int_1)).
fof(fc14_abian, axiom, ![X1, X2]:((((v1_int_1(X1)&v1_abian(X1))&v1_int_1(X2))&~(v1_abian(X2)))=>~(v1_abian(k6_xcmplx_0(X2,X1)))), file('number14/number14__t18_number14', fc14_abian)).
fof(t18_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r2_int_1(X1,X2,np__2)=>(v1_abian(X1)<=>v1_abian(X2))))), file('number14/number14__t18_number14', t18_number14)).
fof(fc13_abian, axiom, ![X1, X2]:((((v1_int_1(X1)&v1_abian(X1))&v1_int_1(X2))&~(v1_abian(X2)))=>~(v1_abian(k6_xcmplx_0(X1,X2)))), file('number14/number14__t18_number14', fc13_abian)).
fof(c_0_8, plain, ![X21]:(~m1_subset_1(X21,k4_ordinal1)|v7_ordinal1(X21)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_9, plain, ![X20]:(~v7_ordinal1(X20)|v1_int_1(X20)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_10, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_11, plain, (m1_subset_1(np__2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc2_numerals])).
fof(c_0_12, plain, ![X26]:(~v1_int_1(X26)|v1_abian(k3_xcmplx_0(np__2,X26))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_abian])])).
fof(c_0_13, plain, ![X27, X28, X29, X31]:(((v1_int_1(esk3_3(X27,X28,X29))|~r2_int_1(X27,X28,X29)|~v1_int_1(X29)|~v1_int_1(X28)|~v1_int_1(X27))&(k3_xcmplx_0(X29,esk3_3(X27,X28,X29))=k6_xcmplx_0(X27,X28)|~r2_int_1(X27,X28,X29)|~v1_int_1(X29)|~v1_int_1(X28)|~v1_int_1(X27)))&(~v1_int_1(X31)|k3_xcmplx_0(X29,X31)!=k6_xcmplx_0(X27,X28)|r2_int_1(X27,X28,X29)|~v1_int_1(X29)|~v1_int_1(X28)|~v1_int_1(X27))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_int_1])])])])])).
cnf(c_0_14, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_15, plain, (v7_ordinal1(np__2)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
fof(c_0_16, plain, ![X1, X2]:((((v1_int_1(X1)&v1_abian(X1))&v1_int_1(X2))&~v1_abian(X2))=>~v1_abian(k6_xcmplx_0(X2,X1))), inference(fof_simplification,[status(thm)],[fc14_abian])).
cnf(c_0_17, plain, (v1_abian(k3_xcmplx_0(np__2,X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, plain, (k3_xcmplx_0(X1,esk3_3(X2,X3,X1))=k6_xcmplx_0(X2,X3)|~r2_int_1(X2,X3,X1)|~v1_int_1(X1)|~v1_int_1(X3)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_19, plain, (v1_int_1(np__2)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
fof(c_0_20, plain, ![X24, X25]:(~v1_int_1(X24)|~v1_abian(X24)|~v1_int_1(X25)|v1_abian(X25)|~v1_abian(k6_xcmplx_0(X25,X24))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])).
cnf(c_0_21, plain, (v1_abian(k6_xcmplx_0(X1,X2))|~r2_int_1(X1,X2,np__2)|~v1_int_1(esk3_3(X1,X2,np__2))|~v1_int_1(X2)|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19])])).
cnf(c_0_22, plain, (v1_int_1(esk3_3(X1,X2,X3))|~r2_int_1(X1,X2,X3)|~v1_int_1(X3)|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
fof(c_0_23, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r2_int_1(X1,X2,np__2)=>(v1_abian(X1)<=>v1_abian(X2)))))), inference(assume_negation,[status(cth)],[t18_number14])).
fof(c_0_24, plain, ![X1, X2]:((((v1_int_1(X1)&v1_abian(X1))&v1_int_1(X2))&~v1_abian(X2))=>~v1_abian(k6_xcmplx_0(X1,X2))), inference(fof_simplification,[status(thm)],[fc13_abian])).
cnf(c_0_25, plain, (v1_abian(X2)|~v1_int_1(X1)|~v1_abian(X1)|~v1_int_1(X2)|~v1_abian(k6_xcmplx_0(X2,X1))), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_26, plain, (v1_abian(k6_xcmplx_0(X1,X2))|~r2_int_1(X1,X2,np__2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_19])])).
fof(c_0_27, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&(r2_int_1(esk1_0,esk2_0,np__2)&((~v1_abian(esk1_0)|~v1_abian(esk2_0))&(v1_abian(esk1_0)|v1_abian(esk2_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])])).
fof(c_0_28, plain, ![X22, X23]:(~v1_int_1(X22)|~v1_abian(X22)|~v1_int_1(X23)|v1_abian(X23)|~v1_abian(k6_xcmplx_0(X22,X23))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])).
cnf(c_0_29, plain, (v1_abian(X1)|~v1_abian(X2)|~r2_int_1(X1,X2,np__2)|~v1_int_1(X1)|~v1_int_1(X2)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_30, negated_conjecture, (r2_int_1(esk1_0,esk2_0,np__2)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_31, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_32, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_33, negated_conjecture, (v1_abian(esk1_0)|v1_abian(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_34, plain, (v1_abian(X2)|~v1_int_1(X1)|~v1_abian(X1)|~v1_int_1(X2)|~v1_abian(k6_xcmplx_0(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_35, negated_conjecture, (~v1_abian(esk1_0)|~v1_abian(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_36, negated_conjecture, (v1_abian(esk1_0)), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31]), c_0_32])]), c_0_33])).
cnf(c_0_37, plain, (v1_abian(X1)|~v1_abian(X2)|~r2_int_1(X2,X1,np__2)|~v1_int_1(X1)|~v1_int_1(X2)), inference(spm,[status(thm)],[c_0_34, c_0_26])).
cnf(c_0_38, negated_conjecture, (~v1_abian(esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35, c_0_36])])).
cnf(c_0_39, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_30]), c_0_36]), c_0_32]), c_0_31])]), c_0_38]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 40
# Proof object clause steps            : 22
# Proof object formula steps           : 18
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 8
# Proof object generating inferences   : 8
# Proof object simplifying inferences  : 15
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 15
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 15
# Processed clauses                    : 38
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 38
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 2
# Backward-rewritten                   : 1
# Generated clauses                    : 13
# ...of the previous two non-trivial   : 12
# Contextual simplify-reflections      : 1
# Paramodulations                      : 13
# 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  : 20
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 4
# ...number of literals in the above   : 24
# Current number of archived formulas  : 0
# Current number of archived clauses   : 18
# Clause-clause subsumption calls (NU) : 70
# Rec. Clause-clause subsumption calls : 10
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 4
# 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          : 1571

# -------------------------------------------------
# User time                : 0.022 s
# System time              : 0.000 s
# Total time               : 0.022 s
# Maximum resident set size: 3596 pages
