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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(cc3_xreal_0, axiom, ![X1]:(v1_xreal_0(X1)=>v1_xcmplx_0(X1)), file('newton06/newton06__t35_newton06', cc3_xreal_0)).
fof(cc3_int_1, axiom, ![X1]:(v1_int_1(X1)=>v1_xreal_0(X1)), file('newton06/newton06__t35_newton06', cc3_int_1)).
fof(t191_xcmplx_1, axiom, ![X1]:(v1_xcmplx_0(X1)=>![X2]:(v1_xcmplx_0(X2)=>k7_xcmplx_0(k4_xcmplx_0(X1),k4_xcmplx_0(X2))=k7_xcmplx_0(X1,X2))), file('newton06/newton06__t35_newton06', t191_xcmplx_1)).
fof(t35_newton06, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>k4_int_1(X1,X2)=k4_int_1(k4_xcmplx_0(X1),k4_xcmplx_0(X2)))), file('newton06/newton06__t35_newton06', t35_newton06)).
fof(d9_int_1, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>k4_int_1(X1,X2)=k1_int_1(k7_xcmplx_0(X1,X2)))), file('newton06/newton06__t35_newton06', d9_int_1)).
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('newton06/newton06__t35_newton06', fc3_int_1)).
fof(c_0_6, plain, ![X15]:(~v1_xreal_0(X15)|v1_xcmplx_0(X15)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_xreal_0])])).
fof(c_0_7, plain, ![X14]:(~v1_int_1(X14)|v1_xreal_0(X14)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_int_1])])).
fof(c_0_8, plain, ![X19, X20]:(~v1_xcmplx_0(X19)|(~v1_xcmplx_0(X20)|k7_xcmplx_0(k4_xcmplx_0(X19),k4_xcmplx_0(X20))=k7_xcmplx_0(X19,X20))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t191_xcmplx_1])])])).
cnf(c_0_9, plain, (v1_xcmplx_0(X1)|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_10, plain, (v1_xreal_0(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_11, plain, (k7_xcmplx_0(k4_xcmplx_0(X1),k4_xcmplx_0(X2))=k7_xcmplx_0(X1,X2)|~v1_xcmplx_0(X1)|~v1_xcmplx_0(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_12, plain, (v1_xcmplx_0(X1)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_9, c_0_10])).
fof(c_0_13, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>k4_int_1(X1,X2)=k4_int_1(k4_xcmplx_0(X1),k4_xcmplx_0(X2))))), inference(assume_negation,[status(cth)],[t35_newton06])).
cnf(c_0_14, plain, (k7_xcmplx_0(k4_xcmplx_0(X1),k4_xcmplx_0(X2))=k7_xcmplx_0(X1,X2)|~v1_xcmplx_0(X1)|~v1_int_1(X2)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
fof(c_0_15, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&k4_int_1(esk1_0,esk2_0)!=k4_int_1(k4_xcmplx_0(esk1_0),k4_xcmplx_0(esk2_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
fof(c_0_16, plain, ![X16, X17]:(~v1_int_1(X16)|(~v1_int_1(X17)|k4_int_1(X16,X17)=k1_int_1(k7_xcmplx_0(X16,X17)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_int_1])])])).
fof(c_0_17, plain, ![X18]:((v1_xcmplx_0(k4_xcmplx_0(X18))|~v1_int_1(X18))&(v1_int_1(k4_xcmplx_0(X18))|~v1_int_1(X18))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_int_1])])])).
cnf(c_0_18, plain, (k7_xcmplx_0(k4_xcmplx_0(X1),k4_xcmplx_0(X2))=k7_xcmplx_0(X1,X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_14, c_0_12])).
cnf(c_0_19, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, plain, (k4_int_1(X1,X2)=k1_int_1(k7_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_21, plain, (v1_int_1(k4_xcmplx_0(X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_22, negated_conjecture, (k7_xcmplx_0(k4_xcmplx_0(X1),k4_xcmplx_0(esk2_0))=k7_xcmplx_0(X1,esk2_0)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_18, c_0_19])).
cnf(c_0_23, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_24, negated_conjecture, (k1_int_1(k7_xcmplx_0(X1,esk2_0))=k4_int_1(X1,esk2_0)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_20, c_0_19])).
cnf(c_0_25, plain, (k1_int_1(k7_xcmplx_0(X1,k4_xcmplx_0(X2)))=k4_int_1(X1,k4_xcmplx_0(X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
cnf(c_0_26, negated_conjecture, (k7_xcmplx_0(k4_xcmplx_0(esk1_0),k4_xcmplx_0(esk2_0))=k7_xcmplx_0(esk1_0,esk2_0)), inference(spm,[status(thm)],[c_0_22, c_0_23])).
cnf(c_0_27, negated_conjecture, (k1_int_1(k7_xcmplx_0(esk1_0,esk2_0))=k4_int_1(esk1_0,esk2_0)), inference(spm,[status(thm)],[c_0_24, c_0_23])).
cnf(c_0_28, negated_conjecture, (k4_int_1(esk1_0,esk2_0)!=k4_int_1(k4_xcmplx_0(esk1_0),k4_xcmplx_0(esk2_0))), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_29, negated_conjecture, (~v1_int_1(k4_xcmplx_0(esk1_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27]), c_0_19])]), c_0_28])).
cnf(c_0_30, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_21]), c_0_23])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 31
# Proof object clause steps            : 18
# Proof object formula steps           : 13
# 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   : 6
# Proof object generating inferences   : 10
# Proof object simplifying inferences  : 6
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 9
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 9
# Processed clauses                    : 38
# ...of these trivial                  : 1
# ...subsumed                          : 0
# ...remaining for further processing  : 37
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 32
# ...of the previous two non-trivial   : 31
# Contextual simplify-reflections      : 0
# Paramodulations                      : 32
# 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  : 27
#    Positive orientable unit clauses  : 11
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 14
# Current number of unprocessed clauses: 11
# ...number of literals in the above   : 26
# Current number of archived formulas  : 0
# Current number of archived clauses   : 10
# Clause-clause subsumption calls (NU) : 33
# Rec. Clause-clause subsumption calls : 33
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 21
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 4
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1403

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.008 s
# Total time               : 0.024 s
# Maximum resident set size: 2904 pages
