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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t42_relset_3, axiom, ![X1]:(v1_xcmplx_0(X1)=>![X2]:(v1_xcmplx_0(X2)=>![X3]:(v1_xcmplx_0(X3)=>![X4]:(v1_membered(X4)=>(r2_hidden(k4_tarski(X2,X3),k3_relset_3(X4,X1))<=>((r2_hidden(X2,X4)&r2_hidden(X3,X4))&X3=k3_xcmplx_0(X1,X2))))))), file('relset_3/relset_3__t57_relset_3', t42_relset_3)).
fof(fc3_xcmplx_0, axiom, ![X1, X2]:((v1_xcmplx_0(X1)&v1_xcmplx_0(X2))=>v1_xcmplx_0(k3_xcmplx_0(X1,X2))), file('relset_3/relset_3__t57_relset_3', fc3_xcmplx_0)).
fof(t57_relset_3, conjecture, ![X1]:(v1_xreal_0(X1)=>![X2]:(v1_xreal_0(X2)=>r2_hidden(k4_tarski(X2,k3_xcmplx_0(X2,X1)),k3_relset_3(k1_numbers,X1)))), file('relset_3/relset_3__t57_relset_3', t57_relset_3)).
fof(commutativity_k3_xcmplx_0, axiom, ![X1, X2]:((v1_xcmplx_0(X1)&v1_xcmplx_0(X2))=>k3_xcmplx_0(X1,X2)=k3_xcmplx_0(X2,X1)), file('relset_3/relset_3__t57_relset_3', commutativity_k3_xcmplx_0)).
fof(cc5_membered, axiom, ![X1]:(v3_membered(X1)=>v1_membered(X1)), file('relset_3/relset_3__t57_relset_3', cc5_membered)).
fof(cc3_xreal_0, axiom, ![X1]:(v1_xreal_0(X1)=>v1_xcmplx_0(X1)), file('relset_3/relset_3__t57_relset_3', cc3_xreal_0)).
fof(d1_xreal_0, axiom, ![X1]:(v1_xreal_0(X1)<=>r2_hidden(X1,k1_numbers)), file('relset_3/relset_3__t57_relset_3', d1_xreal_0)).
fof(fc3_membered, axiom, v3_membered(k1_numbers), file('relset_3/relset_3__t57_relset_3', fc3_membered)).
fof(fc6_xreal_0, axiom, ![X1, X2]:((v1_xreal_0(X1)&v1_xreal_0(X2))=>v1_xreal_0(k3_xcmplx_0(X1,X2))), file('relset_3/relset_3__t57_relset_3', fc6_xreal_0)).
fof(c_0_9, plain, ![X31, X32, X33, X34]:((((r2_hidden(X32,X34)|~r2_hidden(k4_tarski(X32,X33),k3_relset_3(X34,X31))|~v1_membered(X34)|~v1_xcmplx_0(X33)|~v1_xcmplx_0(X32)|~v1_xcmplx_0(X31))&(r2_hidden(X33,X34)|~r2_hidden(k4_tarski(X32,X33),k3_relset_3(X34,X31))|~v1_membered(X34)|~v1_xcmplx_0(X33)|~v1_xcmplx_0(X32)|~v1_xcmplx_0(X31)))&(X33=k3_xcmplx_0(X31,X32)|~r2_hidden(k4_tarski(X32,X33),k3_relset_3(X34,X31))|~v1_membered(X34)|~v1_xcmplx_0(X33)|~v1_xcmplx_0(X32)|~v1_xcmplx_0(X31)))&(~r2_hidden(X32,X34)|~r2_hidden(X33,X34)|X33!=k3_xcmplx_0(X31,X32)|r2_hidden(k4_tarski(X32,X33),k3_relset_3(X34,X31))|~v1_membered(X34)|~v1_xcmplx_0(X33)|~v1_xcmplx_0(X32)|~v1_xcmplx_0(X31))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t42_relset_3])])])])).
fof(c_0_10, plain, ![X27, X28]:(~v1_xcmplx_0(X27)|~v1_xcmplx_0(X28)|v1_xcmplx_0(k3_xcmplx_0(X27,X28))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc3_xcmplx_0])])).
fof(c_0_11, negated_conjecture, ~(![X1]:(v1_xreal_0(X1)=>![X2]:(v1_xreal_0(X2)=>r2_hidden(k4_tarski(X2,k3_xcmplx_0(X2,X1)),k3_relset_3(k1_numbers,X1))))), inference(assume_negation,[status(cth)],[t57_relset_3])).
cnf(c_0_12, plain, (r2_hidden(k4_tarski(X1,X3),k3_relset_3(X2,X4))|~r2_hidden(X1,X2)|~r2_hidden(X3,X2)|X3!=k3_xcmplx_0(X4,X1)|~v1_membered(X2)|~v1_xcmplx_0(X3)|~v1_xcmplx_0(X1)|~v1_xcmplx_0(X4)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_13, plain, (v1_xcmplx_0(k3_xcmplx_0(X1,X2))|~v1_xcmplx_0(X1)|~v1_xcmplx_0(X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
fof(c_0_14, plain, ![X24, X25]:(~v1_xcmplx_0(X24)|~v1_xcmplx_0(X25)|k3_xcmplx_0(X24,X25)=k3_xcmplx_0(X25,X24)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[commutativity_k3_xcmplx_0])])).
fof(c_0_15, plain, ![X23]:(~v3_membered(X23)|v1_membered(X23)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc5_membered])])).
fof(c_0_16, plain, ![X22]:(~v1_xreal_0(X22)|v1_xcmplx_0(X22)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_xreal_0])])).
fof(c_0_17, negated_conjecture, (v1_xreal_0(esk1_0)&(v1_xreal_0(esk2_0)&~r2_hidden(k4_tarski(esk2_0,k3_xcmplx_0(esk2_0,esk1_0)),k3_relset_3(k1_numbers,esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])).
fof(c_0_18, plain, ![X26]:((~v1_xreal_0(X26)|r2_hidden(X26,k1_numbers))&(~r2_hidden(X26,k1_numbers)|v1_xreal_0(X26))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_xreal_0])])).
cnf(c_0_19, plain, (r2_hidden(k4_tarski(X1,k3_xcmplx_0(X2,X1)),k3_relset_3(X3,X2))|~v1_membered(X3)|~v1_xcmplx_0(X2)|~v1_xcmplx_0(X1)|~r2_hidden(k3_xcmplx_0(X2,X1),X3)|~r2_hidden(X1,X3)), inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_12]), c_0_13])).
cnf(c_0_20, plain, (k3_xcmplx_0(X1,X2)=k3_xcmplx_0(X2,X1)|~v1_xcmplx_0(X1)|~v1_xcmplx_0(X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_21, plain, (v1_membered(X1)|~v3_membered(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_22, plain, (v3_membered(k1_numbers)), inference(split_conjunct,[status(thm)],[fc3_membered])).
cnf(c_0_23, plain, (v1_xcmplx_0(X1)|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_24, negated_conjecture, (v1_xreal_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_25, negated_conjecture, (v1_xreal_0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_26, plain, (r2_hidden(X1,k1_numbers)|~v1_xreal_0(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
fof(c_0_27, plain, ![X29, X30]:(~v1_xreal_0(X29)|~v1_xreal_0(X30)|v1_xreal_0(k3_xcmplx_0(X29,X30))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc6_xreal_0])])).
cnf(c_0_28, negated_conjecture, (~r2_hidden(k4_tarski(esk2_0,k3_xcmplx_0(esk2_0,esk1_0)),k3_relset_3(k1_numbers,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_29, plain, (r2_hidden(k4_tarski(X1,k3_xcmplx_0(X1,X2)),k3_relset_3(X3,X2))|~v1_membered(X3)|~v1_xcmplx_0(X2)|~v1_xcmplx_0(X1)|~r2_hidden(k3_xcmplx_0(X1,X2),X3)|~r2_hidden(X1,X3)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_30, plain, (v1_membered(k1_numbers)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_31, negated_conjecture, (v1_xcmplx_0(esk1_0)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_32, negated_conjecture, (v1_xcmplx_0(esk2_0)), inference(spm,[status(thm)],[c_0_23, c_0_25])).
cnf(c_0_33, negated_conjecture, (r2_hidden(esk2_0,k1_numbers)), inference(spm,[status(thm)],[c_0_26, c_0_25])).
cnf(c_0_34, plain, (v1_xreal_0(k3_xcmplx_0(X1,X2))|~v1_xreal_0(X1)|~v1_xreal_0(X2)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_35, negated_conjecture, (~r2_hidden(k3_xcmplx_0(esk2_0,esk1_0),k1_numbers)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), c_0_31]), c_0_32]), c_0_33])])).
cnf(c_0_36, plain, (r2_hidden(k3_xcmplx_0(X1,X2),k1_numbers)|~v1_xreal_0(X2)|~v1_xreal_0(X1)), inference(spm,[status(thm)],[c_0_26, c_0_34])).
cnf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_24]), c_0_25])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 38
# Proof object clause steps            : 20
# Proof object formula steps           : 18
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 8
# Proof object simplifying inferences  : 10
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 15
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 15
# Processed clauses                    : 52
# ...of these trivial                  : 0
# ...subsumed                          : 11
# ...remaining for further processing  : 41
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 32
# ...of the previous two non-trivial   : 24
# Contextual simplify-reflections      : 1
# Paramodulations                      : 31
# 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  : 25
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 15
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 12
# Current number of archived formulas  : 0
# Current number of archived clauses   : 15
# Clause-clause subsumption calls (NU) : 143
# Rec. Clause-clause subsumption calls : 57
# Non-unit clause-clause subsumptions  : 12
# Unit Clause-clause subsumption calls : 6
# 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          : 1816

# -------------------------------------------------
# User time                : 0.018 s
# System time              : 0.002 s
# Total time               : 0.020 s
# Maximum resident set size: 2916 pages
