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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t63_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>r2_tarski(k3_xcmplx_0(X1,X2),k7_number14(X1)))), file('number14/number14__t63_number14', t63_number14)).
fof(d16_number14, axiom, ![X1]:(v1_int_1(X1)=>k7_number14(X1)=a_1_0_number14(X1)), file('number14/number14__t63_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__t63_number14', fraenkel_a_1_0_number14)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('number14/number14__t63_number14', redefinition_r2_tarski)).
fof(t57_number14, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>m3_number14(k3_xcmplx_0(X1,X2),X1))), file('number14/number14__t63_number14', t57_number14)).
fof(c_0_5, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>r2_tarski(k3_xcmplx_0(X1,X2),k7_number14(X1))))), inference(assume_negation,[status(cth)],[t63_number14])).
fof(c_0_6, plain, ![X16]:(~v1_int_1(X16)|k7_number14(X16)=a_1_0_number14(X16)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_number14])])).
fof(c_0_7, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&~r2_tarski(k3_xcmplx_0(esk1_0,esk2_0),k7_number14(esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
cnf(c_0_8, plain, (k7_number14(X1)=a_1_0_number14(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_9, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_10, plain, ![X17, X18, X20]:(((m3_number14(esk3_2(X17,X18),X18)|~r2_hidden(X17,a_1_0_number14(X18))|~v1_int_1(X18))&(X17=esk3_2(X17,X18)|~r2_hidden(X17,a_1_0_number14(X18))|~v1_int_1(X18)))&(~m3_number14(X20,X18)|X17!=X20|r2_hidden(X17,a_1_0_number14(X18))|~v1_int_1(X18))), 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_11, negated_conjecture, (~r2_tarski(k3_xcmplx_0(esk1_0,esk2_0),k7_number14(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, negated_conjecture, (k7_number14(esk1_0)=a_1_0_number14(esk1_0)), inference(spm,[status(thm)],[c_0_8, c_0_9])).
fof(c_0_13, plain, ![X21, X22]:((~r2_tarski(X21,X22)|r2_hidden(X21,X22))&(~r2_hidden(X21,X22)|r2_tarski(X21,X22))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_14, 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_10])).
fof(c_0_15, plain, ![X23, X24]:(~v1_int_1(X23)|(~v1_int_1(X24)|m3_number14(k3_xcmplx_0(X23,X24),X23))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t57_number14])])])).
cnf(c_0_16, negated_conjecture, (~r2_tarski(k3_xcmplx_0(esk1_0,esk2_0),a_1_0_number14(esk1_0))), inference(rw,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_17, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_18, plain, (r2_hidden(X1,a_1_0_number14(X2))|~m3_number14(X1,X2)|~v1_int_1(X2)), inference(er,[status(thm)],[c_0_14])).
cnf(c_0_19, plain, (m3_number14(k3_xcmplx_0(X1,X2),X1)|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, negated_conjecture, (~r2_hidden(k3_xcmplx_0(esk1_0,esk2_0),a_1_0_number14(esk1_0))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_21, plain, (r2_hidden(k3_xcmplx_0(X1,X2),a_1_0_number14(X1))|~v1_int_1(X1)|~v1_int_1(X2)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
cnf(c_0_22, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_23, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_9]), c_0_22])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 24
# Proof object clause steps            : 13
# Proof object formula steps           : 11
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 7
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 10
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 10
# Processed clauses                    : 25
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 25
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 8
# ...of the previous two non-trivial   : 7
# Contextual simplify-reflections      : 0
# Paramodulations                      : 7
# 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  : 13
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 7
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 3
# Current number of archived formulas  : 0
# Current number of archived clauses   : 11
# Clause-clause subsumption calls (NU) : 2
# Rec. Clause-clause subsumption calls : 2
# 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          : 780

# -------------------------------------------------
# User time                : 0.018 s
# System time              : 0.004 s
# Total time               : 0.022 s
# Maximum resident set size: 3012 pages
