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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
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__t3_relset_3', redefinition_r1_relset_1)).
fof(dt_k1_relset_3, axiom, ![X1]:m1_subset_1(k1_relset_3(X1),k1_zfmisc_1(k2_zfmisc_1(X1,X1))), file('relset_3/relset_3__t3_relset_3', dt_k1_relset_3)).
fof(t1_relset_3, axiom, ![X1, X2]:(r1_tarski(X1,X2)=>r1_relset_1(X1,X1,k1_relset_3(X1),k1_relset_3(X2))), file('relset_3/relset_3__t3_relset_3', t1_relset_3)).
fof(t7_xboole_1, axiom, ![X1, X2]:r1_tarski(X1,k2_xboole_0(X1,X2)), file('relset_3/relset_3__t3_relset_3', t7_xboole_1)).
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__t3_relset_3', t8_xboole_1)).
fof(commutativity_k2_xboole_0, axiom, ![X1, X2]:k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1), file('relset_3/relset_3__t3_relset_3', commutativity_k2_xboole_0)).
fof(t3_relset_3, conjecture, ![X1, X2]:r1_tarski(k2_xboole_0(k1_relset_3(X1),k1_relset_3(X2)),k1_relset_3(k2_xboole_0(X1,X2))), file('relset_3/relset_3__t3_relset_3', t3_relset_3)).
fof(c_0_7, plain, ![X26, X27, X28, X29]:((~r1_relset_1(X26,X27,X28,X29)|r1_tarski(X28,X29)|~m1_subset_1(X28,k1_zfmisc_1(k2_zfmisc_1(X26,X27))))&(~r1_tarski(X28,X29)|r1_relset_1(X26,X27,X28,X29)|~m1_subset_1(X28,k1_zfmisc_1(k2_zfmisc_1(X26,X27))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_relset_1])])])).
fof(c_0_8, plain, ![X25]:m1_subset_1(k1_relset_3(X25),k1_zfmisc_1(k2_zfmisc_1(X25,X25))), inference(variable_rename,[status(thm)],[dt_k1_relset_3])).
fof(c_0_9, plain, ![X30, X31]:(~r1_tarski(X30,X31)|r1_relset_1(X30,X30,k1_relset_3(X30),k1_relset_3(X31))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_relset_3])])).
fof(c_0_10, plain, ![X32, X33]:r1_tarski(X32,k2_xboole_0(X32,X33)), inference(variable_rename,[status(thm)],[t7_xboole_1])).
cnf(c_0_11, 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_7])).
cnf(c_0_12, plain, (m1_subset_1(k1_relset_3(X1),k1_zfmisc_1(k2_zfmisc_1(X1,X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, plain, (r1_relset_1(X1,X1,k1_relset_3(X1),k1_relset_3(X2))|~r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, plain, (r1_tarski(X1,k2_xboole_0(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_10])).
fof(c_0_15, plain, ![X34, X35, X36]:(~r1_tarski(X34,X36)|~r1_tarski(X35,X36)|r1_tarski(k2_xboole_0(X34,X35),X36)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])])).
cnf(c_0_16, plain, (r1_tarski(k1_relset_3(X1),X2)|~r1_relset_1(X1,X1,k1_relset_3(X1),X2)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_17, plain, (r1_relset_1(X1,X1,k1_relset_3(X1),k1_relset_3(k2_xboole_0(X1,X2)))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
fof(c_0_18, plain, ![X23, X24]:k2_xboole_0(X23,X24)=k2_xboole_0(X24,X23), inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0])).
cnf(c_0_19, plain, (r1_tarski(k2_xboole_0(X1,X3),X2)|~r1_tarski(X1,X2)|~r1_tarski(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, plain, (r1_tarski(k1_relset_3(X1),k1_relset_3(k2_xboole_0(X1,X2)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_21, plain, (k2_xboole_0(X1,X2)=k2_xboole_0(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
fof(c_0_22, negated_conjecture, ~(![X1, X2]:r1_tarski(k2_xboole_0(k1_relset_3(X1),k1_relset_3(X2)),k1_relset_3(k2_xboole_0(X1,X2)))), inference(assume_negation,[status(cth)],[t3_relset_3])).
cnf(c_0_23, plain, (r1_tarski(k2_xboole_0(X1,k1_relset_3(X2)),k1_relset_3(k2_xboole_0(X2,X3)))|~r1_tarski(X1,k1_relset_3(k2_xboole_0(X2,X3)))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_24, plain, (r1_tarski(k1_relset_3(X1),k1_relset_3(k2_xboole_0(X2,X1)))), inference(spm,[status(thm)],[c_0_20, c_0_21])).
fof(c_0_25, negated_conjecture, ~r1_tarski(k2_xboole_0(k1_relset_3(esk1_0),k1_relset_3(esk2_0)),k1_relset_3(k2_xboole_0(esk1_0,esk2_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])).
cnf(c_0_26, plain, (r1_tarski(k2_xboole_0(k1_relset_3(X1),k1_relset_3(X2)),k1_relset_3(k2_xboole_0(X2,X1)))), inference(spm,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_27, negated_conjecture, (~r1_tarski(k2_xboole_0(k1_relset_3(esk1_0),k1_relset_3(esk2_0)),k1_relset_3(k2_xboole_0(esk1_0,esk2_0)))), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_28, plain, (r1_tarski(k2_xboole_0(k1_relset_3(X1),k1_relset_3(X2)),k1_relset_3(k2_xboole_0(X1,X2)))), inference(spm,[status(thm)],[c_0_26, c_0_21])).
cnf(c_0_29, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_28])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 30
# Proof object clause steps            : 15
# Proof object formula steps           : 15
# Proof object conjectures             : 5
# Proof object clause conjectures      : 2
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 7
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 2
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 8
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 8
# Processed clauses                    : 59
# ...of these trivial                  : 8
# ...subsumed                          : 8
# ...remaining for further processing  : 43
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 181
# ...of the previous two non-trivial   : 132
# Contextual simplify-reflections      : 0
# Paramodulations                      : 181
# 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  : 34
#    Positive orientable unit clauses  : 20
#    Positive unorientable unit clauses: 1
#    Negative unit clauses             : 0
#    Non-unit-clauses                  : 13
# Current number of unprocessed clauses: 89
# ...number of literals in the above   : 103
# Current number of archived formulas  : 0
# Current number of archived clauses   : 9
# Clause-clause subsumption calls (NU) : 45
# Rec. Clause-clause subsumption calls : 45
# Non-unit clause-clause subsumptions  : 8
# Unit Clause-clause subsumption calls : 10
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 49
# BW rewrite match successes           : 13
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2391

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.004 s
# Total time               : 0.020 s
# Maximum resident set size: 2936 pages
