# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S037I
# and selection function PSelectUnlessUniqPosMax.
#
# Preprocessing time       : 0.016 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t61_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(r2_hidden(X2,k7_number14(X1))=>m3_number14(X2,X1))), file('number14/number14__t61_number14', t61_number14)).
fof(d16_number14, axiom, ![X1]:(v1_int_1(X1)=>k7_number14(X1)=a_1_0_number14(X1)), file('number14/number14__t61_number14', d16_number14)).
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__t61_number14', fraenkel_a_1_0_number14)).
fof(c_0_3, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(r2_hidden(X2,k7_number14(X1))=>m3_number14(X2,X1)))), inference(assume_negation,[status(cth)],[t61_number14])).
fof(c_0_4, plain, ![X12]:(~v1_int_1(X12)|k7_number14(X12)=a_1_0_number14(X12)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_number14])])).
fof(c_0_5, negated_conjecture, (v1_int_1(esk1_0)&(r2_hidden(esk2_0,k7_number14(esk1_0))&~m3_number14(esk2_0,esk1_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])).
cnf(c_0_6, plain, (k7_number14(X1)=a_1_0_number14(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_7, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
fof(c_0_8, plain, ![X13, X14, X16]:(((m3_number14(esk3_2(X13,X14),X14)|~r2_hidden(X13,a_1_0_number14(X14))|~v1_int_1(X14))&(X13=esk3_2(X13,X14)|~r2_hidden(X13,a_1_0_number14(X14))|~v1_int_1(X14)))&(~m3_number14(X16,X14)|X13!=X16|r2_hidden(X13,a_1_0_number14(X14))|~v1_int_1(X14))), 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])])])])])).
cnf(c_0_9, negated_conjecture, (r2_hidden(esk2_0,k7_number14(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_10, negated_conjecture, (k7_number14(esk1_0)=a_1_0_number14(esk1_0)), inference(spm,[status(thm)],[c_0_6, c_0_7])).
cnf(c_0_11, plain, (X1=esk3_2(X1,X2)|~r2_hidden(X1,a_1_0_number14(X2))|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_12, negated_conjecture, (r2_hidden(esk2_0,a_1_0_number14(esk1_0))), inference(rw,[status(thm)],[c_0_9, c_0_10])).
cnf(c_0_13, plain, (m3_number14(esk3_2(X1,X2),X2)|~r2_hidden(X1,a_1_0_number14(X2))|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, negated_conjecture, (esk3_2(esk2_0,esk1_0)=esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_7])])).
cnf(c_0_15, negated_conjecture, (~m3_number14(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_16, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_12]), c_0_7])]), c_0_15]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 17
# Proof object clause steps            : 10
# Proof object formula steps           : 7
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 6
# Proof object initial formulas used   : 3
# Proof object generating inferences   : 3
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 3
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 7
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 7
# Processed clauses                    : 18
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 18
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 5
# ...of the previous two non-trivial   : 5
# Contextual simplify-reflections      : 0
# Paramodulations                      : 4
# 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  : 9
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 3
# Current number of archived formulas  : 0
# Current number of archived clauses   : 8
# Clause-clause subsumption calls (NU) : 2
# Rec. Clause-clause subsumption calls : 2
# 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          : 536

# -------------------------------------------------
# User time                : 0.015 s
# System time              : 0.004 s
# Total time               : 0.019 s
# Maximum resident set size: 2852 pages
