# 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.020 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__t78_number14', cc8_ordinal1)).
fof(t78_number14, conjecture, ![X1]:(v1_int_1(X1)=>~((~(v1_abian(X1))&r2_hidden(X1,k7_number14(np__2))))), file('number14/number14__t78_number14', t78_number14)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number14/number14__t78_number14', cc2_int_1)).
fof(spc2_numerals, axiom, (v2_xxreal_0(np__2)&m1_subset_1(np__2,k4_ordinal1)), file('number14/number14__t78_number14', spc2_numerals)).
fof(t77_number14, axiom, ![X1]:(v1_int_1(X1)=>~((~(v1_abian(X1))&m3_number14(X1,np__2)))), file('number14/number14__t78_number14', t77_number14)).
fof(t61_number14, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(r2_hidden(X2,k7_number14(X1))=>m3_number14(X2,X1))), file('number14/number14__t78_number14', t61_number14)).
fof(c_0_6, plain, ![X11]:(~m1_subset_1(X11,k4_ordinal1)|v7_ordinal1(X11)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_7, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>~((~v1_abian(X1)&r2_hidden(X1,k7_number14(np__2)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t78_number14])])).
fof(c_0_8, plain, ![X10]:(~v7_ordinal1(X10)|v1_int_1(X10)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_9, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10, plain, (m1_subset_1(np__2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc2_numerals])).
fof(c_0_11, plain, ![X1]:(v1_int_1(X1)=>~((~v1_abian(X1)&m3_number14(X1,np__2)))), inference(fof_simplification,[status(thm)],[t77_number14])).
fof(c_0_12, plain, ![X12, X13]:(~v1_int_1(X12)|(~r2_hidden(X13,k7_number14(X12))|m3_number14(X13,X12))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_number14])])])).
fof(c_0_13, negated_conjecture, (v1_int_1(esk1_0)&(~v1_abian(esk1_0)&r2_hidden(esk1_0,k7_number14(np__2)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
cnf(c_0_14, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_15, plain, (v7_ordinal1(np__2)), inference(spm,[status(thm)],[c_0_9, c_0_10])).
fof(c_0_16, plain, ![X14]:(~v1_int_1(X14)|(v1_abian(X14)|~m3_number14(X14,np__2))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])).
cnf(c_0_17, plain, (m3_number14(X2,X1)|~v1_int_1(X1)|~r2_hidden(X2,k7_number14(X1))), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, negated_conjecture, (r2_hidden(esk1_0,k7_number14(np__2))), 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])).
cnf(c_0_20, plain, (v1_abian(X1)|~v1_int_1(X1)|~m3_number14(X1,np__2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_21, negated_conjecture, (m3_number14(esk1_0,np__2)), 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, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_23, negated_conjecture, (~v1_abian(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_24, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_22])]), c_0_23]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 25
# Proof object clause steps            : 12
# Proof object formula steps           : 13
# Proof object conjectures             : 8
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 8
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 9
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 9
# Processed clauses                    : 21
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 21
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 4
# ...of the previous two non-trivial   : 3
# Contextual simplify-reflections      : 0
# Paramodulations                      : 4
# 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  : 12
#    Positive orientable unit clauses  : 7
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 9
# Clause-clause subsumption calls (NU) : 4
# Rec. Clause-clause subsumption calls : 4
# 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          : 597

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.002 s
# Total time               : 0.023 s
# Maximum resident set size: 2964 pages
