# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4c
# and selection function SelectCQPrecWNTNp.
#
# Preprocessing time       : 0.020 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t13_relset_3, axiom, ![X1]:(v1_xcmplx_0(X1)=>![X2]:(v1_membered(X2)=>![X3]:(v1_membered(X3)=>(r1_tarski(X2,X3)=>r1_relset_1(X2,X2,k2_relset_3(X2,X1),k2_relset_3(X3,X1)))))), file('relset_3/relset_3__t15_relset_3', t13_relset_3)).
fof(t7_xboole_1, axiom, ![X1, X2]:r1_tarski(X1,k2_xboole_0(X1,X2)), file('relset_3/relset_3__t15_relset_3', t7_xboole_1)).
fof(redefinition_r1_relset_1, axiom, ![X1, X2, X3, X4]:(m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))=>(r1_relset_1(X1,X2,X3,X4)<=>r1_tarski(X3,X4))), file('relset_3/relset_3__t15_relset_3', redefinition_r1_relset_1)).
fof(dt_k2_relset_3, axiom, ![X1, X2]:((v1_membered(X1)&v1_xcmplx_0(X2))=>m1_subset_1(k2_relset_3(X1,X2),k1_zfmisc_1(k2_zfmisc_1(X1,X1)))), file('relset_3/relset_3__t15_relset_3', dt_k2_relset_3)).
fof(fc25_membered, axiom, ![X1, X2]:((v1_membered(X1)&v1_membered(X2))=>v1_membered(k2_xboole_0(X1,X2))), file('relset_3/relset_3__t15_relset_3', fc25_membered)).
fof(commutativity_k2_xboole_0, axiom, ![X1, X2]:k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1), file('relset_3/relset_3__t15_relset_3', commutativity_k2_xboole_0)).
fof(t8_xboole_1, axiom, ![X1, X2, X3]:((r1_tarski(X1,X3)&r1_tarski(X2,X3))=>r1_tarski(k2_xboole_0(X1,X2),X3)), file('relset_3/relset_3__t15_relset_3', t8_xboole_1)).
fof(t15_relset_3, conjecture, ![X1]:(v1_xcmplx_0(X1)=>![X2]:(v1_membered(X2)=>![X3]:(v1_membered(X3)=>r1_tarski(k2_xboole_0(k2_relset_3(X2,X1),k2_relset_3(X3,X1)),k2_relset_3(k2_xboole_0(X2,X3),X1))))), file('relset_3/relset_3__t15_relset_3', t15_relset_3)).
fof(c_0_8, plain, ![X39, X40, X41]:(~v1_xcmplx_0(X39)|(~v1_membered(X40)|(~v1_membered(X41)|(~r1_tarski(X40,X41)|r1_relset_1(X40,X40,k2_relset_3(X40,X39),k2_relset_3(X41,X39)))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t13_relset_3])])])).
fof(c_0_9, plain, ![X42, X43]:r1_tarski(X42,k2_xboole_0(X42,X43)), inference(variable_rename,[status(thm)],[t7_xboole_1])).
fof(c_0_10, plain, ![X35, X36, X37, X38]:((~r1_relset_1(X35,X36,X37,X38)|r1_tarski(X37,X38)|~m1_subset_1(X37,k1_zfmisc_1(k2_zfmisc_1(X35,X36))))&(~r1_tarski(X37,X38)|r1_relset_1(X35,X36,X37,X38)|~m1_subset_1(X37,k1_zfmisc_1(k2_zfmisc_1(X35,X36))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_relset_1])])])).
fof(c_0_11, plain, ![X31, X32]:(~v1_membered(X31)|~v1_xcmplx_0(X32)|m1_subset_1(k2_relset_3(X31,X32),k1_zfmisc_1(k2_zfmisc_1(X31,X31)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_relset_3])])).
cnf(c_0_12, plain, (r1_relset_1(X2,X2,k2_relset_3(X2,X1),k2_relset_3(X3,X1))|~v1_xcmplx_0(X1)|~v1_membered(X2)|~v1_membered(X3)|~r1_tarski(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, plain, (r1_tarski(X1,k2_xboole_0(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_14, plain, ![X33, X34]:(~v1_membered(X33)|~v1_membered(X34)|v1_membered(k2_xboole_0(X33,X34))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fc25_membered])])).
cnf(c_0_15, plain, (r1_tarski(X3,X4)|~r1_relset_1(X1,X2,X3,X4)|~m1_subset_1(X3,k1_zfmisc_1(k2_zfmisc_1(X1,X2)))), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_16, plain, (m1_subset_1(k2_relset_3(X1,X2),k1_zfmisc_1(k2_zfmisc_1(X1,X1)))|~v1_membered(X1)|~v1_xcmplx_0(X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_17, plain, (r1_relset_1(X1,X1,k2_relset_3(X1,X2),k2_relset_3(k2_xboole_0(X1,X3),X2))|~v1_membered(k2_xboole_0(X1,X3))|~v1_membered(X1)|~v1_xcmplx_0(X2)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_18, plain, (v1_membered(k2_xboole_0(X1,X2))|~v1_membered(X1)|~v1_membered(X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_19, plain, (r1_tarski(k2_relset_3(X1,X2),X3)|~r1_relset_1(X1,X1,k2_relset_3(X1,X2),X3)|~v1_membered(X1)|~v1_xcmplx_0(X2)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_20, plain, (r1_relset_1(X1,X1,k2_relset_3(X1,X2),k2_relset_3(k2_xboole_0(X1,X3),X2))|~v1_membered(X1)|~v1_membered(X3)|~v1_xcmplx_0(X2)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
fof(c_0_21, plain, ![X29, X30]:k2_xboole_0(X29,X30)=k2_xboole_0(X30,X29), inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0])).
fof(c_0_22, plain, ![X44, X45, X46]:(~r1_tarski(X44,X46)|~r1_tarski(X45,X46)|r1_tarski(k2_xboole_0(X44,X45),X46)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])).
cnf(c_0_23, plain, (r1_tarski(k2_relset_3(X1,X2),k2_relset_3(k2_xboole_0(X1,X3),X2))|~v1_membered(X1)|~v1_membered(X3)|~v1_xcmplx_0(X2)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_24, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
fof(c_0_25, negated_conjecture, ~(![X1]:(v1_xcmplx_0(X1)=>![X2]:(v1_membered(X2)=>![X3]:(v1_membered(X3)=>r1_tarski(k2_xboole_0(k2_relset_3(X2,X1),k2_relset_3(X3,X1)),k2_relset_3(k2_xboole_0(X2,X3),X1)))))), inference(assume_negation,[status(cth)],[t15_relset_3])).
cnf(c_0_26, plain, (r1_tarski(k2_xboole_0(X1,X3),X2)|~r1_tarski(X1,X2)|~r1_tarski(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_27, plain, (r1_tarski(k2_relset_3(X1,X2),k2_relset_3(k2_xboole_0(X3,X1),X2))|~v1_membered(X1)|~v1_membered(X3)|~v1_xcmplx_0(X2)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
fof(c_0_28, negated_conjecture, (v1_xcmplx_0(esk1_0)&(v1_membered(esk2_0)&(v1_membered(esk3_0)&~r1_tarski(k2_xboole_0(k2_relset_3(esk2_0,esk1_0),k2_relset_3(esk3_0,esk1_0)),k2_relset_3(k2_xboole_0(esk2_0,esk3_0),esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])).
cnf(c_0_29, plain, (r1_tarski(k2_xboole_0(X1,k2_relset_3(X2,X3)),k2_relset_3(k2_xboole_0(X4,X2),X3))|~r1_tarski(X1,k2_relset_3(k2_xboole_0(X4,X2),X3))|~v1_membered(X2)|~v1_membered(X4)|~v1_xcmplx_0(X3)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_30, negated_conjecture, (~r1_tarski(k2_xboole_0(k2_relset_3(esk2_0,esk1_0),k2_relset_3(esk3_0,esk1_0)),k2_relset_3(k2_xboole_0(esk2_0,esk3_0),esk1_0))), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_31, plain, (r1_tarski(k2_xboole_0(k2_relset_3(X1,X2),k2_relset_3(X3,X2)),k2_relset_3(k2_xboole_0(X1,X3),X2))|~v1_membered(X3)|~v1_membered(X1)|~v1_xcmplx_0(X2)), inference(spm,[status(thm)],[c_0_29, c_0_23])).
cnf(c_0_32, negated_conjecture, (v1_membered(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_33, negated_conjecture, (v1_membered(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_34, negated_conjecture, (v1_xcmplx_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_35, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32]), c_0_33]), c_0_34])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 36
# Proof object clause steps            : 19
# Proof object formula steps           : 17
# Proof object conjectures             : 8
# Proof object clause conjectures      : 5
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 8
# Proof object generating inferences   : 8
# Proof object simplifying inferences  : 4
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 12
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 12
# Processed clauses                    : 5037
# ...of these trivial                  : 1397
# ...subsumed                          : 1730
# ...remaining for further processing  : 1910
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 772604
# ...of the previous two non-trivial   : 767793
# Contextual simplify-reflections      : 2
# Paramodulations                      : 772604
# 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  : 1898
#    Positive orientable unit clauses  : 1026
#    Positive unorientable unit clauses: 1
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 870
# Current number of unprocessed clauses: 762773
# ...number of literals in the above   : 767565
# Current number of archived formulas  : 0
# Current number of archived clauses   : 12
# Clause-clause subsumption calls (NU) : 840383
# Rec. Clause-clause subsumption calls : 835472
# Non-unit clause-clause subsumptions  : 1732
# Unit Clause-clause subsumption calls : 322044
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 588600
# BW rewrite match successes           : 12
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 12078043

# -------------------------------------------------
# User time                : 7.240 s
# System time              : 0.272 s
# Total time               : 7.512 s
# Maximum resident set size: 3632 pages
