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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t57_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>m3_number14(k3_xcmplx_0(X1,X2),X1))), file('number14/number14__t57_number14', t57_number14)).
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__t57_number14', d15_number14)).
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__t57_number14', d3_int_1)).
fof(fc2_int_1, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>v1_int_1(k3_xcmplx_0(X1,X2))), file('number14/number14__t57_number14', fc2_int_1)).
fof(c_0_4, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>m3_number14(k3_xcmplx_0(X1,X2),X1)))), inference(assume_negation,[status(cth)],[t57_number14])).
fof(c_0_5, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&~m3_number14(k3_xcmplx_0(esk1_0,esk2_0),esk1_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
fof(c_0_6, plain, ![X15, X16]:((~m3_number14(X16,X15)|r1_int_1(X15,X16)|~v1_int_1(X16)|~v1_int_1(X15))&(~r1_int_1(X15,X16)|m3_number14(X16,X15)|~v1_int_1(X16)|~v1_int_1(X15))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d15_number14])])])])).
fof(c_0_7, plain, ![X17, X18, X20]:(((v1_int_1(esk3_2(X17,X18))|~r1_int_1(X17,X18)|~v1_int_1(X18)|~v1_int_1(X17))&(X18=k3_xcmplx_0(X17,esk3_2(X17,X18))|~r1_int_1(X17,X18)|~v1_int_1(X18)|~v1_int_1(X17)))&(~v1_int_1(X20)|X18!=k3_xcmplx_0(X17,X20)|r1_int_1(X17,X18)|~v1_int_1(X18)|~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)],[d3_int_1])])])])])).
fof(c_0_8, plain, ![X21, X22]:(~v1_int_1(X21)|~v1_int_1(X22)|v1_int_1(k3_xcmplx_0(X21,X22))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc2_int_1])])).
cnf(c_0_9, negated_conjecture, (~m3_number14(k3_xcmplx_0(esk1_0,esk2_0),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_10, plain, (m3_number14(X2,X1)|~r1_int_1(X1,X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_11, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_12, plain, (r1_int_1(X3,X2)|~v1_int_1(X1)|X2!=k3_xcmplx_0(X3,X1)|~v1_int_1(X2)|~v1_int_1(X3)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_13, plain, (v1_int_1(k3_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, negated_conjecture, (~r1_int_1(esk1_0,k3_xcmplx_0(esk1_0,esk2_0))|~v1_int_1(k3_xcmplx_0(esk1_0,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11])])).
cnf(c_0_15, plain, (r1_int_1(X1,k3_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_12]), c_0_13])).
cnf(c_0_16, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_17, negated_conjecture, (~v1_int_1(k3_xcmplx_0(esk1_0,esk2_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_11]), c_0_16])])).
cnf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_13]), c_0_16]), c_0_11])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 19
# Proof object clause steps            : 10
# Proof object formula steps           : 9
# Proof object conjectures             : 9
# Proof object clause conjectures      : 6
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 6
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 3
# Proof object simplifying inferences  : 10
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 9
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 9
# Processed clauses                    : 20
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 20
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 5
# ...of the previous two non-trivial   : 3
# Contextual simplify-reflections      : 1
# 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  : 10
#    Positive orientable unit clauses  : 2
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 6
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 4
# 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  : 1
# Unit Clause-clause subsumption calls : 1
# 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          : 804

# -------------------------------------------------
# User time                : 0.023 s
# System time              : 0.000 s
# Total time               : 0.023 s
# Maximum resident set size: 2896 pages
