# 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(cc6_membered, axiom, ![X1]:(v1_membered(X1)=>![X2]:(m1_subset_1(X2,X1)=>v1_xcmplx_0(X2))), file('relset_3/relset_3__t62_relset_3', cc6_membered)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('relset_3/relset_3__t62_relset_3', t1_subset)).
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__t62_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__t62_relset_3', redefinition_r2_tarski)).
fof(t62_relset_3, conjecture, ![X1]:(v1_rat_1(X1)=>![X2]:(v1_rat_1(X2)=>r2_hidden(k4_tarski(X2,k3_xcmplx_0(X2,X1)),k3_relset_3(k3_numbers,X1)))), file('relset_3/relset_3__t62_relset_3', t62_relset_3)).
fof(cc5_membered, axiom, ![X1]:(v3_membered(X1)=>v1_membered(X1)), file('relset_3/relset_3__t62_relset_3', cc5_membered)).
fof(cc3_membered, axiom, ![X1]:(v4_membered(X1)=>v3_membered(X1)), file('relset_3/relset_3__t62_relset_3', cc3_membered)).
fof(d2_rat_1, axiom, ![X1]:(v1_rat_1(X1)<=>r2_hidden(X1,k3_numbers)), file('relset_3/relset_3__t62_relset_3', d2_rat_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__t62_relset_3', commutativity_k3_xcmplx_0)).
fof(fc4_membered, axiom, v4_membered(k3_numbers), file('relset_3/relset_3__t62_relset_3', fc4_membered)).
fof(fc1_rat_1, axiom, ![X1, X2]:((v1_rat_1(X1)&v1_rat_1(X2))=>v1_rat_1(k3_xcmplx_0(X1,X2))), file('relset_3/relset_3__t62_relset_3', fc1_rat_1)).
fof(c_0_11, plain, ![X28, X29]:(~v1_membered(X28)|(~m1_subset_1(X29,X28)|v1_xcmplx_0(X29))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc6_membered])])])).
fof(c_0_12, plain, ![X37, X38]:(~r2_tarski(X37,X38)|m1_subset_1(X37,X38)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
fof(c_0_13, plain, ![X39, X40, X41, X42]:((((r2_hidden(X40,X42)|~r2_hidden(k4_tarski(X40,X41),k3_relset_3(X42,X39))|~v1_membered(X42)|~v1_xcmplx_0(X41)|~v1_xcmplx_0(X40)|~v1_xcmplx_0(X39))&(r2_hidden(X41,X42)|~r2_hidden(k4_tarski(X40,X41),k3_relset_3(X42,X39))|~v1_membered(X42)|~v1_xcmplx_0(X41)|~v1_xcmplx_0(X40)|~v1_xcmplx_0(X39)))&(X41=k3_xcmplx_0(X39,X40)|~r2_hidden(k4_tarski(X40,X41),k3_relset_3(X42,X39))|~v1_membered(X42)|~v1_xcmplx_0(X41)|~v1_xcmplx_0(X40)|~v1_xcmplx_0(X39)))&(~r2_hidden(X40,X42)|~r2_hidden(X41,X42)|X41!=k3_xcmplx_0(X39,X40)|r2_hidden(k4_tarski(X40,X41),k3_relset_3(X42,X39))|~v1_membered(X42)|~v1_xcmplx_0(X41)|~v1_xcmplx_0(X40)|~v1_xcmplx_0(X39))), 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_14, plain, (v1_xcmplx_0(X2)|~v1_membered(X1)|~m1_subset_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_15, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_16, plain, ![X35, X36]:((~r2_tarski(X35,X36)|r2_hidden(X35,X36))&(~r2_hidden(X35,X36)|r2_tarski(X35,X36))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
fof(c_0_17, negated_conjecture, ~(![X1]:(v1_rat_1(X1)=>![X2]:(v1_rat_1(X2)=>r2_hidden(k4_tarski(X2,k3_xcmplx_0(X2,X1)),k3_relset_3(k3_numbers,X1))))), inference(assume_negation,[status(cth)],[t62_relset_3])).
fof(c_0_18, plain, ![X27]:(~v3_membered(X27)|v1_membered(X27)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc5_membered])])).
fof(c_0_19, plain, ![X26]:(~v4_membered(X26)|v3_membered(X26)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc3_membered])])).
cnf(c_0_20, 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_13])).
cnf(c_0_21, plain, (v1_xcmplx_0(X1)|~r2_tarski(X1,X2)|~v1_membered(X2)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_22, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
fof(c_0_23, plain, ![X32]:((~v1_rat_1(X32)|r2_hidden(X32,k3_numbers))&(~r2_hidden(X32,k3_numbers)|v1_rat_1(X32))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_rat_1])])).
fof(c_0_24, negated_conjecture, (v1_rat_1(esk1_0)&(v1_rat_1(esk2_0)&~r2_hidden(k4_tarski(esk2_0,k3_xcmplx_0(esk2_0,esk1_0)),k3_relset_3(k3_numbers,esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])).
cnf(c_0_25, plain, (v1_membered(X1)|~v3_membered(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_26, plain, (v3_membered(X1)|~v4_membered(X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_27, 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_20])).
cnf(c_0_28, plain, (v1_xcmplx_0(X1)|~v1_membered(X2)|~r2_hidden(X1,X2)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
fof(c_0_29, plain, ![X30, X31]:(~v1_xcmplx_0(X30)|~v1_xcmplx_0(X31)|k3_xcmplx_0(X30,X31)=k3_xcmplx_0(X31,X30)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[commutativity_k3_xcmplx_0])])).
cnf(c_0_30, plain, (r2_hidden(X1,k3_numbers)|~v1_rat_1(X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_31, negated_conjecture, (v1_rat_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_32, plain, (v1_membered(X1)|~v4_membered(X1)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_33, plain, (v4_membered(k3_numbers)), inference(split_conjunct,[status(thm)],[fc4_membered])).
cnf(c_0_34, plain, (r2_hidden(k4_tarski(X1,k3_xcmplx_0(X2,X1)),k3_relset_3(X3,X2))|~v1_xcmplx_0(X2)|~v1_membered(X3)|~r2_hidden(k3_xcmplx_0(X2,X1),X3)|~r2_hidden(X1,X3)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_27, c_0_28]), c_0_28])).
cnf(c_0_35, 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_36, negated_conjecture, (r2_hidden(esk1_0,k3_numbers)), inference(spm,[status(thm)],[c_0_30, c_0_31])).
cnf(c_0_37, plain, (v1_membered(k3_numbers)), inference(spm,[status(thm)],[c_0_32, c_0_33])).
cnf(c_0_38, negated_conjecture, (v1_rat_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_24])).
fof(c_0_39, plain, ![X33, X34]:(~v1_rat_1(X33)|~v1_rat_1(X34)|v1_rat_1(k3_xcmplx_0(X33,X34))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc1_rat_1])])).
cnf(c_0_40, negated_conjecture, (~r2_hidden(k4_tarski(esk2_0,k3_xcmplx_0(esk2_0,esk1_0)),k3_relset_3(k3_numbers,esk1_0))), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_41, 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(spm,[status(thm)],[c_0_34, c_0_35]), c_0_28])).
cnf(c_0_42, negated_conjecture, (v1_xcmplx_0(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_36]), c_0_37])])).
cnf(c_0_43, negated_conjecture, (r2_hidden(esk2_0,k3_numbers)), inference(spm,[status(thm)],[c_0_30, c_0_38])).
cnf(c_0_44, plain, (v1_rat_1(k3_xcmplx_0(X1,X2))|~v1_rat_1(X1)|~v1_rat_1(X2)), inference(split_conjunct,[status(thm)],[c_0_39])).
cnf(c_0_45, negated_conjecture, (~r2_hidden(k3_xcmplx_0(esk2_0,esk1_0),k3_numbers)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42]), c_0_37]), c_0_43])])).
cnf(c_0_46, plain, (r2_hidden(k3_xcmplx_0(X1,X2),k3_numbers)|~v1_rat_1(X2)|~v1_rat_1(X1)), inference(spm,[status(thm)],[c_0_30, c_0_44])).
cnf(c_0_47, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_31]), c_0_38])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 48
# Proof object clause steps            : 26
# Proof object formula steps           : 22
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 11
# Proof object generating inferences   : 11
# Proof object simplifying inferences  : 13
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 11
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 18
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 18
# Processed clauses                    : 63
# ...of these trivial                  : 0
# ...subsumed                          : 9
# ...remaining for further processing  : 54
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 44
# ...of the previous two non-trivial   : 37
# Contextual simplify-reflections      : 6
# Paramodulations                      : 43
# 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  : 34
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 24
# Current number of unprocessed clauses: 10
# ...number of literals in the above   : 64
# Current number of archived formulas  : 0
# Current number of archived clauses   : 19
# Clause-clause subsumption calls (NU) : 921
# Rec. Clause-clause subsumption calls : 222
# Non-unit clause-clause subsumptions  : 16
# Unit Clause-clause subsumption calls : 19
# 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          : 2354

# -------------------------------------------------
# User time                : 0.025 s
# System time              : 0.000 s
# Total time               : 0.025 s
# Maximum resident set size: 3644 pages
