# 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.014 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('number14/number14__t3_number14', cc3_xreal_0)).
fof(cc3_int_1, axiom, ![X1]:(v1_int_1(X1)=>v1_xreal_0(X1)), file('number14/number14__t3_number14', cc3_int_1)).
fof(t87_xcmplx_1, axiom, ![X1]:(v1_xcmplx_0(X1)=>![X2]:(v1_xcmplx_0(X2)=>(X2!=k5_numbers=>k3_xcmplx_0(k7_xcmplx_0(X1,X2),X2)=X1))), file('number14/number14__t3_number14', t87_xcmplx_1)).
fof(t3_number14, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>(X3=k7_xcmplx_0(X1,X2)=>(X2=k5_numbers|r1_int_1(X3,X1)))))), file('number14/number14__t3_number14', t3_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__t3_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__t3_number14', fc2_int_1)).
fof(c_0_6, plain, ![X20]:(~v1_xreal_0(X20)|v1_xcmplx_0(X20)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_xreal_0])])).
fof(c_0_7, plain, ![X19]:(~v1_int_1(X19)|v1_xreal_0(X19)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_int_1])])).
fof(c_0_8, plain, ![X27, X28]:(~v1_xcmplx_0(X27)|(~v1_xcmplx_0(X28)|(X28=k5_numbers|k3_xcmplx_0(k7_xcmplx_0(X27,X28),X28)=X27))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t87_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, (X2=k5_numbers|k3_xcmplx_0(k7_xcmplx_0(X1,X2),X2)=X1|~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)=>![X3]:(v1_int_1(X3)=>(X3=k7_xcmplx_0(X1,X2)=>(X2=k5_numbers|r1_int_1(X3,X1))))))), inference(assume_negation,[status(cth)],[t3_number14])).
cnf(c_0_14, plain, (k3_xcmplx_0(k7_xcmplx_0(X1,X2),X2)=X1|X2=k5_numbers|~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)&(v1_int_1(esk3_0)&(esk3_0=k7_xcmplx_0(esk1_0,esk2_0)&(esk2_0!=k5_numbers&~r1_int_1(esk3_0,esk1_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
fof(c_0_16, plain, ![X21, X22, X24]:(((v1_int_1(esk4_2(X21,X22))|~r1_int_1(X21,X22)|~v1_int_1(X22)|~v1_int_1(X21))&(X22=k3_xcmplx_0(X21,esk4_2(X21,X22))|~r1_int_1(X21,X22)|~v1_int_1(X22)|~v1_int_1(X21)))&(~v1_int_1(X24)|X22!=k3_xcmplx_0(X21,X24)|r1_int_1(X21,X22)|~v1_int_1(X22)|~v1_int_1(X21))), 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_17, plain, ![X25, X26]:(~v1_int_1(X25)|~v1_int_1(X26)|v1_int_1(k3_xcmplx_0(X25,X26))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc2_int_1])])).
cnf(c_0_18, plain, (k3_xcmplx_0(k7_xcmplx_0(X1,X2),X2)=X1|X2=k5_numbers|~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, negated_conjecture, (esk2_0!=k5_numbers), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_21, 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_16])).
cnf(c_0_22, plain, (v1_int_1(k3_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_23, negated_conjecture, (k3_xcmplx_0(k7_xcmplx_0(X1,esk2_0),esk2_0)=X1|~v1_int_1(X1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])).
cnf(c_0_24, negated_conjecture, (esk3_0=k7_xcmplx_0(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_25, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_26, 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_21]), c_0_22])).
cnf(c_0_27, negated_conjecture, (k3_xcmplx_0(esk3_0,esk2_0)=esk1_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])])).
cnf(c_0_28, negated_conjecture, (v1_int_1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_29, negated_conjecture, (~r1_int_1(esk3_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_30, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28]), c_0_19])]), c_0_29]), ['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    : 11
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 6
# Proof object simplifying inferences  : 9
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 13
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 13
# Processed clauses                    : 32
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 32
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 16
# ...of the previous two non-trivial   : 11
# Contextual simplify-reflections      : 1
# Paramodulations                      : 15
# 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  : 18
#    Positive orientable unit clauses  : 5
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 5
# ...number of literals in the above   : 20
# Current number of archived formulas  : 0
# Current number of archived clauses   : 13
# Clause-clause subsumption calls (NU) : 63
# Rec. Clause-clause subsumption calls : 44
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 0
# 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          : 1131

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.002 s
# Total time               : 0.017 s
# Maximum resident set size: 3016 pages
