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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(l142_number14, conjecture, k2_xcmplx_0(k2_xcmplx_0(k7_xcmplx_0(np__1,np__1),k7_xcmplx_0(np__1,np__1)),k7_xcmplx_0(np__1,np__1))=np__3, file('number14/number14__l142_number14', l142_number14)).
fof(rqRealDiv__k7_xcmplx_0__r1_r1_r1, axiom, k7_xcmplx_0(np__1,np__1)=np__1, file('number14/number14__l142_number14', rqRealDiv__k7_xcmplx_0__r1_r1_r1)).
fof(rqRealAdd__k2_xcmplx_0__r1_r1_r2, axiom, k2_xcmplx_0(np__1,np__1)=np__2, file('number14/number14__l142_number14', rqRealAdd__k2_xcmplx_0__r1_r1_r2)).
fof(rqRealAdd__k2_xcmplx_0__r2_r1_r3, axiom, k2_xcmplx_0(np__2,np__1)=np__3, file('number14/number14__l142_number14', rqRealAdd__k2_xcmplx_0__r2_r1_r3)).
fof(c_0_4, negated_conjecture, k2_xcmplx_0(k2_xcmplx_0(k7_xcmplx_0(np__1,np__1),k7_xcmplx_0(np__1,np__1)),k7_xcmplx_0(np__1,np__1))!=np__3, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l142_number14])])).
cnf(c_0_5, negated_conjecture, (k2_xcmplx_0(k2_xcmplx_0(k7_xcmplx_0(np__1,np__1),k7_xcmplx_0(np__1,np__1)),k7_xcmplx_0(np__1,np__1))!=np__3), inference(split_conjunct,[status(thm)],[c_0_4])).
cnf(c_0_6, plain, (k7_xcmplx_0(np__1,np__1)=np__1), inference(split_conjunct,[status(thm)],[rqRealDiv__k7_xcmplx_0__r1_r1_r1])).
cnf(c_0_7, negated_conjecture, (k2_xcmplx_0(k2_xcmplx_0(np__1,np__1),np__1)!=np__3), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_5, c_0_6]), c_0_6]), c_0_6])).
cnf(c_0_8, 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_9, plain, (k2_xcmplx_0(np__2,np__1)=np__3), inference(split_conjunct,[status(thm)],[rqRealAdd__k2_xcmplx_0__r2_r1_r3])).
cnf(c_0_10, negated_conjecture, (k2_xcmplx_0(np__2,np__1)!=np__3), inference(rw,[status(thm)],[c_0_7, c_0_8])).
cnf(c_0_11, plain, ($false), inference(sr,[status(thm)],[c_0_9, c_0_10]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 12
# Proof object clause steps            : 7
# Proof object formula steps           : 5
# Proof object conjectures             : 5
# Proof object clause conjectures      : 3
# Proof object formula conjectures     : 2
# Proof object initial clauses used    : 4
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 0
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 4
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 4
# Processed clauses                    : 5
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 4
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 0
# ...of the previous two non-trivial   : 1
# Contextual simplify-reflections      : 0
# Paramodulations                      : 0
# 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  : 3
#    Positive orientable unit clauses  : 2
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 0
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 1
# Clause-clause subsumption calls (NU) : 0
# Rec. Clause-clause subsumption calls : 0
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 169

# -------------------------------------------------
# User time                : 0.014 s
# System time              : 0.004 s
# Total time               : 0.018 s
# Maximum resident set size: 2864 pages
