# 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.022 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__t77_number14', cc8_ordinal1)).
fof(fc1_int_1, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>v1_int_1(k2_xcmplx_0(X1,X2))), file('number14/number14__t77_number14', fc1_int_1)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number14/number14__t77_number14', cc2_int_1)).
fof(spc1_numerals, axiom, (v2_xxreal_0(np__1)&m1_subset_1(np__1,k4_ordinal1)), file('number14/number14__t77_number14', spc1_numerals)).
fof(rqRealAdd__k2_xcmplx_0__r1_r1_r2, axiom, k2_xcmplx_0(np__1,np__1)=np__2, file('number14/number14__t77_number14', rqRealAdd__k2_xcmplx_0__r1_r1_r2)).
fof(fc1_abian, axiom, ![X1]:(v1_int_1(X1)=>v1_abian(k3_xcmplx_0(np__2,X1))), file('number14/number14__t77_number14', fc1_abian)).
fof(d3_int_1, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_1(X1,X2)<=>?[X3]:(v1_int_1(X3)&X2=k3_xcmplx_0(X1,X3))))), file('number14/number14__t77_number14', d3_int_1)).
fof(d15_number14, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(m3_number14(X2,X1)<=>r1_int_1(X1,X2)))), file('number14/number14__t77_number14', d15_number14)).
fof(dt_m3_number14, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(m3_number14(X2,X1)=>v1_int_1(X2))), file('number14/number14__t77_number14', dt_m3_number14)).
fof(t77_number14, conjecture, ![X1]:(v1_int_1(X1)=>~((~(v1_abian(X1))&m3_number14(X1,np__2)))), file('number14/number14__t77_number14', t77_number14)).
fof(c_0_10, plain, ![X19]:(~m1_subset_1(X19,k4_ordinal1)|v7_ordinal1(X19)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_11, plain, ![X29, X30]:(~v1_int_1(X29)|~v1_int_1(X30)|v1_int_1(k2_xcmplx_0(X29,X30))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_int_1])])).
fof(c_0_12, plain, ![X18]:(~v7_ordinal1(X18)|v1_int_1(X18)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_13, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_14, plain, (m1_subset_1(np__1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc1_numerals])).
cnf(c_0_15, plain, (v1_int_1(k2_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_16, plain, (k2_xcmplx_0(np__1,np__1)=np__2), inference(split_conjunct,[status(thm)],[rqRealAdd__k2_xcmplx_0__r1_r1_r2])).
cnf(c_0_17, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, plain, (v7_ordinal1(np__1)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
fof(c_0_19, plain, ![X28]:(~v1_int_1(X28)|v1_abian(k3_xcmplx_0(np__2,X28))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_abian])])).
fof(c_0_20, plain, ![X22, X23, X25]:(((v1_int_1(esk2_2(X22,X23))|~r1_int_1(X22,X23)|~v1_int_1(X23)|~v1_int_1(X22))&(X23=k3_xcmplx_0(X22,esk2_2(X22,X23))|~r1_int_1(X22,X23)|~v1_int_1(X23)|~v1_int_1(X22)))&(~v1_int_1(X25)|X23!=k3_xcmplx_0(X22,X25)|r1_int_1(X22,X23)|~v1_int_1(X23)|~v1_int_1(X22))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_int_1])])])])])).
cnf(c_0_21, plain, (v1_int_1(np__2)|~v1_int_1(np__1)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_22, plain, (v1_int_1(np__1)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
fof(c_0_23, plain, ![X20, X21]:((~m3_number14(X21,X20)|r1_int_1(X20,X21)|~v1_int_1(X21)|~v1_int_1(X20))&(~r1_int_1(X20,X21)|m3_number14(X21,X20)|~v1_int_1(X21)|~v1_int_1(X20))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d15_number14])])])])).
fof(c_0_24, plain, ![X26, X27]:(~v1_int_1(X26)|(~m3_number14(X27,X26)|v1_int_1(X27))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m3_number14])])])).
fof(c_0_25, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>~((~v1_abian(X1)&m3_number14(X1,np__2))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t77_number14])])).
cnf(c_0_26, plain, (v1_abian(k3_xcmplx_0(np__2,X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_27, plain, (X1=k3_xcmplx_0(X2,esk2_2(X2,X1))|~r1_int_1(X2,X1)|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_28, plain, (v1_int_1(np__2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_22])])).
cnf(c_0_29, plain, (r1_int_1(X2,X1)|~m3_number14(X1,X2)|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_30, plain, (v1_int_1(X2)|~v1_int_1(X1)|~m3_number14(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
fof(c_0_31, negated_conjecture, (v1_int_1(esk1_0)&(~v1_abian(esk1_0)&m3_number14(esk1_0,np__2))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])).
cnf(c_0_32, plain, (v1_abian(X1)|~r1_int_1(np__2,X1)|~v1_int_1(esk2_2(np__2,X1))|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])])).
cnf(c_0_33, plain, (v1_int_1(esk2_2(X1,X2))|~r1_int_1(X1,X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_34, plain, (r1_int_1(X1,X2)|~m3_number14(X2,X1)|~v1_int_1(X1)), inference(csr,[status(thm)],[c_0_29, c_0_30])).
cnf(c_0_35, negated_conjecture, (m3_number14(esk1_0,np__2)), inference(split_conjunct,[status(thm)],[c_0_31])).
cnf(c_0_36, negated_conjecture, (~v1_abian(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_31])).
cnf(c_0_37, plain, (v1_abian(X1)|~r1_int_1(np__2,X1)|~v1_int_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_28])])).
cnf(c_0_38, negated_conjecture, (r1_int_1(np__2,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_28])])).
cnf(c_0_39, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_31])).
cnf(c_0_40, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_38]), c_0_39])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 41
# Proof object clause steps            : 22
# Proof object formula steps           : 19
# Proof object conjectures             : 8
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 10
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 12
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 10
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 16
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 16
# Processed clauses                    : 40
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 40
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 1
# Generated clauses                    : 12
# ...of the previous two non-trivial   : 8
# Contextual simplify-reflections      : 1
# Paramodulations                      : 11
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# 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  : 21
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 18
# Clause-clause subsumption calls (NU) : 46
# Rec. Clause-clause subsumption calls : 41
# Non-unit clause-clause subsumptions  : 2
# 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          : 1328

# -------------------------------------------------
# User time                : 0.025 s
# System time              : 0.000 s
# Total time               : 0.025 s
# Maximum resident set size: 3056 pages
