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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t1_newton02, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>k3_int_2(X1,X2)=k3_int_2(k4_xcmplx_0(X1),X2))), file('number14/number14__t12_number14', t1_newton02)).
fof(d3_int_2, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_2(X1,X2)<=>k3_int_2(X1,X2)=np__1))), file('number14/number14__t12_number14', d3_int_2)).
fof(fc3_int_1, axiom, ![X1]:(v1_int_1(X1)=>(v1_xcmplx_0(k4_xcmplx_0(X1))&v1_int_1(k4_xcmplx_0(X1)))), file('number14/number14__t12_number14', fc3_int_1)).
fof(t12_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_2(X1,X2)<=>r1_int_2(k4_xcmplx_0(X1),X2)))), file('number14/number14__t12_number14', t12_number14)).
fof(c_0_4, plain, ![X15, X16]:(~v1_int_1(X15)|(~v1_int_1(X16)|k3_int_2(X15,X16)=k3_int_2(k4_xcmplx_0(X15),X16))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_newton02])])])).
fof(c_0_5, plain, ![X13, X14]:((~r1_int_2(X13,X14)|k3_int_2(X13,X14)=np__1|~v1_int_1(X14)|~v1_int_1(X13))&(k3_int_2(X13,X14)!=np__1|r1_int_2(X13,X14)|~v1_int_1(X14)|~v1_int_1(X13))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_int_2])])])])).
fof(c_0_6, plain, ![X12]:((v1_xcmplx_0(k4_xcmplx_0(X12))|~v1_int_1(X12))&(v1_int_1(k4_xcmplx_0(X12))|~v1_int_1(X12))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_int_1])])])).
fof(c_0_7, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_2(X1,X2)<=>r1_int_2(k4_xcmplx_0(X1),X2))))), inference(assume_negation,[status(cth)],[t12_number14])).
cnf(c_0_8, plain, (k3_int_2(X1,X2)=k3_int_2(k4_xcmplx_0(X1),X2)|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_9, plain, (k3_int_2(X1,X2)=np__1|~r1_int_2(X1,X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_10, plain, (v1_int_1(k4_xcmplx_0(X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
fof(c_0_11, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&((~r1_int_2(esk1_0,esk2_0)|~r1_int_2(k4_xcmplx_0(esk1_0),esk2_0))&(r1_int_2(esk1_0,esk2_0)|r1_int_2(k4_xcmplx_0(esk1_0),esk2_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
cnf(c_0_12, plain, (k3_int_2(X1,X2)=np__1|~r1_int_2(k4_xcmplx_0(X1),X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8, c_0_9]), c_0_10])).
cnf(c_0_13, negated_conjecture, (r1_int_2(esk1_0,esk2_0)|r1_int_2(k4_xcmplx_0(esk1_0),esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_14, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_15, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_16, plain, (r1_int_2(X1,X2)|k3_int_2(X1,X2)!=np__1|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_5])).
cnf(c_0_17, negated_conjecture, (k3_int_2(esk1_0,esk2_0)=np__1|r1_int_2(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_14]), c_0_15])])).
cnf(c_0_18, negated_conjecture, (~r1_int_2(esk1_0,esk2_0)|~r1_int_2(k4_xcmplx_0(esk1_0),esk2_0)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_19, negated_conjecture, (r1_int_2(esk1_0,esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_14]), c_0_15])])).
cnf(c_0_20, negated_conjecture, (~r1_int_2(k4_xcmplx_0(esk1_0),esk2_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19])])).
cnf(c_0_21, plain, (r1_int_2(k4_xcmplx_0(X1),X2)|k3_int_2(X1,X2)!=np__1|~v1_int_1(X2)|~v1_int_1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_8]), c_0_10])).
cnf(c_0_22, negated_conjecture, (k3_int_2(esk1_0,esk2_0)!=np__1), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20, c_0_21]), c_0_14]), c_0_15])])).
cnf(c_0_23, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_9]), c_0_19]), c_0_14]), c_0_15])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 24
# Proof object clause steps            : 15
# Proof object formula steps           : 9
# Proof object conjectures             : 12
# Proof object clause conjectures      : 9
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 8
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 6
# Proof object simplifying inferences  : 17
# 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                    : 24
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 24
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 3
# Generated clauses                    : 9
# ...of the previous two non-trivial   : 6
# Contextual simplify-reflections      : 2
# Paramodulations                      : 9
# 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  : 3
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 7
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 12
# Clause-clause subsumption calls (NU) : 15
# Rec. Clause-clause subsumption calls : 13
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 1
# 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          : 832

# -------------------------------------------------
# User time                : 0.022 s
# System time              : 0.002 s
# Total time               : 0.024 s
# Maximum resident set size: 2928 pages
