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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t3_arithm, axiom, ![X1]:(v1_xcmplx_0(X1)=>k3_xcmplx_0(np__1,X1)=X1), file('newton06/newton06__t16_newton06', t3_arithm)).
fof(cc3_xreal_0, axiom, ![X1]:(v1_xreal_0(X1)=>v1_xcmplx_0(X1)), file('newton06/newton06__t16_newton06', cc3_xreal_0)).
fof(t16_newton06, conjecture, ![X1]:(v1_xreal_0(X1)=>k3_int_1(k3_xcmplx_0(X1,X1))=k3_int_1(k6_xcmplx_0(k3_xcmplx_0(k3_xcmplx_0(np__2,X1),k3_int_1(X1)),k3_xcmplx_0(k3_int_1(X1),k3_int_1(X1))))), file('newton06/newton06__t16_newton06', t16_newton06)).
fof(cc5_int_1, axiom, ![X1]:(v2_int_1(X1)=>v1_int_1(X1)), file('newton06/newton06__t16_newton06', cc5_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__t16_newton06', fc3_int_1)).
fof(fc6_int_1, axiom, v2_int_1(k4_xcmplx_0(np__1)), file('newton06/newton06__t16_newton06', fc6_int_1)).
fof(spc5_arithm, axiom, ![X1, X2, X3]:(((v1_xcmplx_0(X1)&v1_xcmplx_0(X2))&v1_xcmplx_0(X3))=>k3_xcmplx_0(k2_xcmplx_0(X1,X2),X3)=k2_xcmplx_0(k3_xcmplx_0(X1,X3),k3_xcmplx_0(X2,X3))), file('newton06/newton06__t16_newton06', spc5_arithm)).
fof(rqRealNeg__k4_xcmplx_0__rm1_r1, axiom, k4_xcmplx_0(k4_xcmplx_0(np__1))=np__1, file('newton06/newton06__t16_newton06', rqRealNeg__k4_xcmplx_0__rm1_r1)).
fof(t13_newton06, axiom, ![X1]:(v1_xreal_0(X1)=>![X2]:(v1_xreal_0(X2)=>k3_int_1(k3_xcmplx_0(X1,X2))=k3_int_1(k6_xcmplx_0(k2_xcmplx_0(k3_xcmplx_0(X1,k3_int_1(X2)),k3_xcmplx_0(X2,k3_int_1(X1))),k3_xcmplx_0(k3_int_1(X1),k3_int_1(X2)))))), file('newton06/newton06__t16_newton06', t13_newton06)).
fof(rqRealAdd__k2_xcmplx_0__r1_r1_r2, axiom, k2_xcmplx_0(np__1,np__1)=np__2, file('newton06/newton06__t16_newton06', rqRealAdd__k2_xcmplx_0__r1_r1_r2)).
fof(fc5_int_1, axiom, ![X1]:(v1_xreal_0(X1)=>v1_xreal_0(k3_int_1(X1))), file('newton06/newton06__t16_newton06', fc5_int_1)).
fof(c_0_11, plain, ![X25]:(~v1_xcmplx_0(X25)|k3_xcmplx_0(np__1,X25)=X25), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_arithm])])).
fof(c_0_12, plain, ![X16]:(~v1_xreal_0(X16)|v1_xcmplx_0(X16)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_xreal_0])])).
fof(c_0_13, negated_conjecture, ~(![X1]:(v1_xreal_0(X1)=>k3_int_1(k3_xcmplx_0(X1,X1))=k3_int_1(k6_xcmplx_0(k3_xcmplx_0(k3_xcmplx_0(np__2,X1),k3_int_1(X1)),k3_xcmplx_0(k3_int_1(X1),k3_int_1(X1)))))), inference(assume_negation,[status(cth)],[t16_newton06])).
fof(c_0_14, plain, ![X17]:(~v2_int_1(X17)|v1_int_1(X17)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc5_int_1])])).
cnf(c_0_15, plain, (k3_xcmplx_0(np__1,X1)=X1|~v1_xcmplx_0(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_16, plain, (v1_xcmplx_0(X1)|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_17, negated_conjecture, (v1_xreal_0(esk1_0)&k3_int_1(k3_xcmplx_0(esk1_0,esk1_0))!=k3_int_1(k6_xcmplx_0(k3_xcmplx_0(k3_xcmplx_0(np__2,esk1_0),k3_int_1(esk1_0)),k3_xcmplx_0(k3_int_1(esk1_0),k3_int_1(esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
fof(c_0_18, 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_19, plain, (v1_int_1(X1)|~v2_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_20, plain, (v2_int_1(k4_xcmplx_0(np__1))), inference(split_conjunct,[status(thm)],[fc6_int_1])).
fof(c_0_21, plain, ![X20, X21, X22]:(~v1_xcmplx_0(X20)|~v1_xcmplx_0(X21)|~v1_xcmplx_0(X22)|k3_xcmplx_0(k2_xcmplx_0(X20,X21),X22)=k2_xcmplx_0(k3_xcmplx_0(X20,X22),k3_xcmplx_0(X21,X22))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[spc5_arithm])])).
cnf(c_0_22, plain, (k3_xcmplx_0(np__1,X1)=X1|~v1_xreal_0(X1)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_23, negated_conjecture, (v1_xreal_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_24, plain, (v1_xcmplx_0(k4_xcmplx_0(X1))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_25, plain, (k4_xcmplx_0(k4_xcmplx_0(np__1))=np__1), inference(split_conjunct,[status(thm)],[rqRealNeg__k4_xcmplx_0__rm1_r1])).
cnf(c_0_26, plain, (v1_int_1(k4_xcmplx_0(np__1))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
fof(c_0_27, plain, ![X23, X24]:(~v1_xreal_0(X23)|(~v1_xreal_0(X24)|k3_int_1(k3_xcmplx_0(X23,X24))=k3_int_1(k6_xcmplx_0(k2_xcmplx_0(k3_xcmplx_0(X23,k3_int_1(X24)),k3_xcmplx_0(X24,k3_int_1(X23))),k3_xcmplx_0(k3_int_1(X23),k3_int_1(X24)))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t13_newton06])])])).
cnf(c_0_28, plain, (k3_xcmplx_0(k2_xcmplx_0(X1,X2),X3)=k2_xcmplx_0(k3_xcmplx_0(X1,X3),k3_xcmplx_0(X2,X3))|~v1_xcmplx_0(X1)|~v1_xcmplx_0(X2)|~v1_xcmplx_0(X3)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_29, negated_conjecture, (k3_xcmplx_0(np__1,esk1_0)=esk1_0), inference(spm,[status(thm)],[c_0_22, c_0_23])).
cnf(c_0_30, plain, (v1_xcmplx_0(np__1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_25]), c_0_26])])).
cnf(c_0_31, plain, (k3_int_1(k3_xcmplx_0(X1,X2))=k3_int_1(k6_xcmplx_0(k2_xcmplx_0(k3_xcmplx_0(X1,k3_int_1(X2)),k3_xcmplx_0(X2,k3_int_1(X1))),k3_xcmplx_0(k3_int_1(X1),k3_int_1(X2))))|~v1_xreal_0(X1)|~v1_xreal_0(X2)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_32, negated_conjecture, (k2_xcmplx_0(k3_xcmplx_0(X1,esk1_0),esk1_0)=k3_xcmplx_0(k2_xcmplx_0(X1,np__1),esk1_0)|~v1_xcmplx_0(esk1_0)|~v1_xcmplx_0(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30])])).
cnf(c_0_33, plain, (k2_xcmplx_0(np__1,np__1)=np__2), inference(split_conjunct,[status(thm)],[rqRealAdd__k2_xcmplx_0__r1_r1_r2])).
cnf(c_0_34, plain, (k3_int_1(k6_xcmplx_0(k3_xcmplx_0(k2_xcmplx_0(X1,X1),k3_int_1(X1)),k3_xcmplx_0(k3_int_1(X1),k3_int_1(X1))))=k3_int_1(k3_xcmplx_0(X1,X1))|~v1_xcmplx_0(k3_int_1(X1))|~v1_xreal_0(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_28]), c_0_16])).
cnf(c_0_35, negated_conjecture, (k2_xcmplx_0(esk1_0,esk1_0)=k3_xcmplx_0(np__2,esk1_0)|~v1_xcmplx_0(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_29]), c_0_33]), c_0_30])])).
cnf(c_0_36, negated_conjecture, (k3_int_1(k3_xcmplx_0(esk1_0,esk1_0))!=k3_int_1(k6_xcmplx_0(k3_xcmplx_0(k3_xcmplx_0(np__2,esk1_0),k3_int_1(esk1_0)),k3_xcmplx_0(k3_int_1(esk1_0),k3_int_1(esk1_0))))), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_37, negated_conjecture, (~v1_xcmplx_0(k3_int_1(esk1_0))|~v1_xcmplx_0(esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_23])]), c_0_36])).
fof(c_0_38, plain, ![X19]:(~v1_xreal_0(X19)|v1_xreal_0(k3_int_1(X19))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc5_int_1])])).
cnf(c_0_39, negated_conjecture, (~v1_xcmplx_0(esk1_0)|~v1_xreal_0(k3_int_1(esk1_0))), inference(spm,[status(thm)],[c_0_37, c_0_16])).
cnf(c_0_40, plain, (v1_xreal_0(k3_int_1(X1))|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_38])).
cnf(c_0_41, negated_conjecture, (~v1_xcmplx_0(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39, c_0_40]), c_0_23])])).
cnf(c_0_42, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_16]), c_0_23])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 43
# Proof object clause steps            : 23
# Proof object formula steps           : 20
# Proof object conjectures             : 12
# Proof object clause conjectures      : 9
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 12
# Proof object initial formulas used   : 11
# Proof object generating inferences   : 11
# Proof object simplifying inferences  : 15
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 11
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 13
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 13
# Processed clauses                    : 98
# ...of these trivial                  : 0
# ...subsumed                          : 17
# ...remaining for further processing  : 81
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 369
# ...of the previous two non-trivial   : 364
# Contextual simplify-reflections      : 7
# Paramodulations                      : 369
# 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  : 67
#    Positive orientable unit clauses  : 11
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 54
# Current number of unprocessed clauses: 292
# ...number of literals in the above   : 1677
# Current number of archived formulas  : 0
# Current number of archived clauses   : 14
# Clause-clause subsumption calls (NU) : 501
# Rec. Clause-clause subsumption calls : 420
# Non-unit clause-clause subsumptions  : 25
# Unit Clause-clause subsumption calls : 20
# 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          : 24763

# -------------------------------------------------
# User time                : 0.035 s
# System time              : 0.002 s
# Total time               : 0.037 s
# Maximum resident set size: 2876 pages
