# 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.021 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__t76_number14', cc8_ordinal1)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number14/number14__t76_number14', cc2_int_1)).
fof(spc2_numerals, axiom, (v2_xxreal_0(np__2)&m1_subset_1(np__2,k4_ordinal1)), file('number14/number14__t76_number14', spc2_numerals)).
fof(fraenkel_a_1_0_number14, axiom, ![X1, X2]:(v1_int_1(X2)=>(r2_hidden(X1,a_1_0_number14(X2))<=>?[X3]:(m3_number14(X3,X2)&X1=X3))), file('number14/number14__t76_number14', fraenkel_a_1_0_number14)).
fof(t76_number14, conjecture, ![X1]:(v1_int_1(X1)=>(v1_abian(X1)=>r2_hidden(X1,k7_number14(np__2)))), file('number14/number14__t76_number14', t76_number14)).
fof(d16_number14, axiom, ![X1]:(v1_int_1(X1)=>k7_number14(X1)=a_1_0_number14(X1)), file('number14/number14__t76_number14', d16_number14)).
fof(t75_number14, axiom, ![X1]:(v1_int_1(X1)=>(v1_abian(X1)=>m3_number14(X1,np__2))), file('number14/number14__t76_number14', t75_number14)).
fof(c_0_7, plain, ![X14]:(~m1_subset_1(X14,k4_ordinal1)|v7_ordinal1(X14)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_8, plain, ![X13]:(~v7_ordinal1(X13)|v1_int_1(X13)), 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_7])).
cnf(c_0_10, plain, (m1_subset_1(np__2,k4_ordinal1)), inference(split_conjunct,[status(thm)],[spc2_numerals])).
fof(c_0_11, plain, ![X16, X17, X19]:(((m3_number14(esk2_2(X16,X17),X17)|~r2_hidden(X16,a_1_0_number14(X17))|~v1_int_1(X17))&(X16=esk2_2(X16,X17)|~r2_hidden(X16,a_1_0_number14(X17))|~v1_int_1(X17)))&(~m3_number14(X19,X17)|X16!=X19|r2_hidden(X16,a_1_0_number14(X17))|~v1_int_1(X17))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fraenkel_a_1_0_number14])])])])])).
fof(c_0_12, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>(v1_abian(X1)=>r2_hidden(X1,k7_number14(np__2))))), inference(assume_negation,[status(cth)],[t76_number14])).
fof(c_0_13, plain, ![X15]:(~v1_int_1(X15)|k7_number14(X15)=a_1_0_number14(X15)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_number14])])).
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])).
cnf(c_0_16, plain, (r2_hidden(X3,a_1_0_number14(X2))|~m3_number14(X1,X2)|X3!=X1|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_17, plain, ![X20]:(~v1_int_1(X20)|(~v1_abian(X20)|m3_number14(X20,np__2))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t75_number14])])).
fof(c_0_18, 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_12])])])).
cnf(c_0_19, plain, (k7_number14(X1)=a_1_0_number14(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_20, plain, (v1_int_1(np__2)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_21, plain, (r2_hidden(X1,a_1_0_number14(X2))|~m3_number14(X1,X2)|~v1_int_1(X2)), inference(er,[status(thm)],[c_0_16])).
cnf(c_0_22, plain, (m3_number14(X1,np__2)|~v1_int_1(X1)|~v1_abian(X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_23, negated_conjecture, (v1_abian(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_24, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_25, negated_conjecture, (~r2_hidden(esk1_0,k7_number14(np__2))), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_26, plain, (k7_number14(np__2)=a_1_0_number14(np__2)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_27, plain, (r2_hidden(X1,a_1_0_number14(np__2))|~m3_number14(X1,np__2)), inference(spm,[status(thm)],[c_0_21, c_0_20])).
cnf(c_0_28, negated_conjecture, (m3_number14(esk1_0,np__2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])])).
cnf(c_0_29, negated_conjecture, (~r2_hidden(esk1_0,a_1_0_number14(np__2))), inference(rw,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_30, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 31
# Proof object clause steps            : 17
# Proof object formula steps           : 14
# Proof object conjectures             : 9
# Proof object clause conjectures      : 6
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 6
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 12
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 12
# Processed clauses                    : 33
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 33
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 13
# ...of the previous two non-trivial   : 13
# Contextual simplify-reflections      : 0
# Paramodulations                      : 12
# 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  : 19
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 9
# Current number of unprocessed clauses: 4
# ...number of literals in the above   : 8
# Current number of archived formulas  : 0
# Current number of archived clauses   : 13
# Clause-clause subsumption calls (NU) : 11
# Rec. Clause-clause subsumption calls : 11
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 2
# 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          : 899

# -------------------------------------------------
# User time                : 0.019 s
# System time              : 0.005 s
# Total time               : 0.024 s
# Maximum resident set size: 3068 pages
