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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(cc5_membered, axiom, ![X1]:(v3_membered(X1)=>v1_membered(X1)), file('relset_3/relset_3__t67_relset_3', cc5_membered)).
fof(cc3_membered, axiom, ![X1]:(v4_membered(X1)=>v3_membered(X1)), file('relset_3/relset_3__t67_relset_3', cc3_membered)).
fof(cc6_membered, axiom, ![X1]:(v1_membered(X1)=>![X2]:(m1_subset_1(X2,X1)=>v1_xcmplx_0(X2))), file('relset_3/relset_3__t67_relset_3', cc6_membered)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('relset_3/relset_3__t67_relset_3', t1_subset)).
fof(t67_relset_3, conjecture, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>r2_hidden(k4_tarski(X2,k3_xcmplx_0(X2,X1)),k3_relset_3(k4_numbers,X1)))), file('relset_3/relset_3__t67_relset_3', t67_relset_3)).
fof(cc2_membered, axiom, ![X1]:(v5_membered(X1)=>v4_membered(X1)), file('relset_3/relset_3__t67_relset_3', cc2_membered)).
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__t67_relset_3', t42_relset_3)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('relset_3/relset_3__t67_relset_3', redefinition_r2_tarski)).
fof(d2_int_1, axiom, ![X1]:(v1_int_1(X1)<=>r2_hidden(X1,k4_numbers)), file('relset_3/relset_3__t67_relset_3', d2_int_1)).
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__t67_relset_3', commutativity_k3_xcmplx_0)).
fof(fc5_membered, axiom, v5_membered(k4_numbers), file('relset_3/relset_3__t67_relset_3', fc5_membered)).
fof(fc2_int_1, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>v1_int_1(k3_xcmplx_0(X1,X2))), file('relset_3/relset_3__t67_relset_3', fc2_int_1)).
fof(c_0_12, plain, ![X29]:(~v3_membered(X29)|v1_membered(X29)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc5_membered])])).
fof(c_0_13, plain, ![X28]:(~v4_membered(X28)|v3_membered(X28)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_membered])])).
fof(c_0_14, plain, ![X30, X31]:(~v1_membered(X30)|(~m1_subset_1(X31,X30)|v1_xcmplx_0(X31))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc6_membered])])])).
fof(c_0_15, plain, ![X39, X40]:(~r2_tarski(X39,X40)|m1_subset_1(X39,X40)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
fof(c_0_16, negated_conjecture, ~(![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>r2_hidden(k4_tarski(X2,k3_xcmplx_0(X2,X1)),k3_relset_3(k4_numbers,X1))))), inference(assume_negation,[status(cth)],[t67_relset_3])).
cnf(c_0_17, plain, (v1_membered(X1)|~v3_membered(X1)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, plain, (v3_membered(X1)|~v4_membered(X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
fof(c_0_19, plain, ![X27]:(~v5_membered(X27)|v4_membered(X27)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_membered])])).
fof(c_0_20, plain, ![X41, X42, X43, X44]:((((r2_hidden(X42,X44)|~r2_hidden(k4_tarski(X42,X43),k3_relset_3(X44,X41))|~v1_membered(X44)|~v1_xcmplx_0(X43)|~v1_xcmplx_0(X42)|~v1_xcmplx_0(X41))&(r2_hidden(X43,X44)|~r2_hidden(k4_tarski(X42,X43),k3_relset_3(X44,X41))|~v1_membered(X44)|~v1_xcmplx_0(X43)|~v1_xcmplx_0(X42)|~v1_xcmplx_0(X41)))&(X43=k3_xcmplx_0(X41,X42)|~r2_hidden(k4_tarski(X42,X43),k3_relset_3(X44,X41))|~v1_membered(X44)|~v1_xcmplx_0(X43)|~v1_xcmplx_0(X42)|~v1_xcmplx_0(X41)))&(~r2_hidden(X42,X44)|~r2_hidden(X43,X44)|X43!=k3_xcmplx_0(X41,X42)|r2_hidden(k4_tarski(X42,X43),k3_relset_3(X44,X41))|~v1_membered(X44)|~v1_xcmplx_0(X43)|~v1_xcmplx_0(X42)|~v1_xcmplx_0(X41))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t42_relset_3])])])])).
cnf(c_0_21, plain, (v1_xcmplx_0(X2)|~v1_membered(X1)|~m1_subset_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_22, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
fof(c_0_23, plain, ![X37, X38]:((~r2_tarski(X37,X38)|r2_hidden(X37,X38))&(~r2_hidden(X37,X38)|r2_tarski(X37,X38))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
fof(c_0_24, plain, ![X34]:((~v1_int_1(X34)|r2_hidden(X34,k4_numbers))&(~r2_hidden(X34,k4_numbers)|v1_int_1(X34))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_int_1])])).
fof(c_0_25, negated_conjecture, (v1_int_1(esk1_0)&(v1_int_1(esk2_0)&~r2_hidden(k4_tarski(esk2_0,k3_xcmplx_0(esk2_0,esk1_0)),k3_relset_3(k4_numbers,esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])).
cnf(c_0_26, plain, (v1_membered(X1)|~v4_membered(X1)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
cnf(c_0_27, plain, (v4_membered(X1)|~v5_membered(X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_28, 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_20])).
fof(c_0_29, plain, ![X32, X33]:(~v1_xcmplx_0(X32)|~v1_xcmplx_0(X33)|k3_xcmplx_0(X32,X33)=k3_xcmplx_0(X33,X32)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[commutativity_k3_xcmplx_0])])).
cnf(c_0_30, plain, (v1_xcmplx_0(X1)|~r2_tarski(X1,X2)|~v1_membered(X2)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_31, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_32, plain, (r2_hidden(X1,k4_numbers)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_33, negated_conjecture, (v1_int_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_34, plain, (v1_membered(X1)|~v5_membered(X1)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_35, plain, (v5_membered(k4_numbers)), inference(split_conjunct,[status(thm)],[fc5_membered])).
cnf(c_0_36, plain, (r2_hidden(k4_tarski(X1,k3_xcmplx_0(X2,X1)),k3_relset_3(X3,X2))|~v1_xcmplx_0(k3_xcmplx_0(X2,X1))|~v1_xcmplx_0(X2)|~v1_xcmplx_0(X1)|~v1_membered(X3)|~r2_hidden(k3_xcmplx_0(X2,X1),X3)|~r2_hidden(X1,X3)), inference(er,[status(thm)],[c_0_28])).
cnf(c_0_37, 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_29])).
cnf(c_0_38, plain, (v1_xcmplx_0(X1)|~v1_membered(X2)|~r2_hidden(X1,X2)), inference(spm,[status(thm)],[c_0_30, c_0_31])).
cnf(c_0_39, negated_conjecture, (r2_hidden(esk1_0,k4_numbers)), inference(spm,[status(thm)],[c_0_32, c_0_33])).
cnf(c_0_40, plain, (v1_membered(k4_numbers)), inference(spm,[status(thm)],[c_0_34, c_0_35])).
cnf(c_0_41, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_25])).
fof(c_0_42, plain, ![X35, X36]:(~v1_int_1(X35)|~v1_int_1(X36)|v1_int_1(k3_xcmplx_0(X35,X36))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc2_int_1])])).
cnf(c_0_43, negated_conjecture, (~r2_hidden(k4_tarski(esk2_0,k3_xcmplx_0(esk2_0,esk1_0)),k3_relset_3(k4_numbers,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_44, plain, (r2_hidden(k4_tarski(X1,k3_xcmplx_0(X1,X2)),k3_relset_3(X3,X2))|~v1_xcmplx_0(X2)|~v1_membered(X3)|~r2_hidden(k3_xcmplx_0(X1,X2),X3)|~r2_hidden(X1,X3)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_38]), c_0_38])).
cnf(c_0_45, negated_conjecture, (v1_xcmplx_0(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_40])])).
cnf(c_0_46, negated_conjecture, (r2_hidden(esk2_0,k4_numbers)), inference(spm,[status(thm)],[c_0_32, c_0_41])).
cnf(c_0_47, plain, (v1_int_1(k3_xcmplx_0(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_42])).
cnf(c_0_48, negated_conjecture, (~r2_hidden(k3_xcmplx_0(esk2_0,esk1_0),k4_numbers)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_45]), c_0_40]), c_0_46])])).
cnf(c_0_49, plain, (r2_hidden(k3_xcmplx_0(X1,X2),k4_numbers)|~v1_int_1(X2)|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_32, c_0_47])).
cnf(c_0_50, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_49]), c_0_33]), c_0_41])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 51
# Proof object clause steps            : 27
# Proof object formula steps           : 24
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 14
# Proof object initial formulas used   : 12
# Proof object generating inferences   : 12
# Proof object simplifying inferences  : 12
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 12
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 19
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 19
# Processed clauses                    : 63
# ...of these trivial                  : 0
# ...subsumed                          : 8
# ...remaining for further processing  : 55
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 40
# ...of the previous two non-trivial   : 33
# Contextual simplify-reflections      : 5
# Paramodulations                      : 39
# 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  : 35
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 25
# Current number of unprocessed clauses: 8
# ...number of literals in the above   : 52
# Current number of archived formulas  : 0
# Current number of archived clauses   : 19
# Clause-clause subsumption calls (NU) : 804
# Rec. Clause-clause subsumption calls : 241
# Non-unit clause-clause subsumptions  : 13
# Unit Clause-clause subsumption calls : 21
# 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          : 2318

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.005 s
# Total time               : 0.025 s
# Maximum resident set size: 3652 pages
