# 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(d2_zfmisc_1, axiom, ![X1, X2, X3]:(X3=k2_zfmisc_1(X1,X2)<=>![X4]:(r2_hidden(X4,X3)<=>?[X5, X6]:((r2_hidden(X5,X1)&r2_hidden(X6,X2))&X4=k4_tarski(X5,X6)))), file('classes5/classes5__t2_classes5', d2_zfmisc_1)).
fof(d5_tarski, axiom, ![X1, X2]:k4_tarski(X1,X2)=k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)), file('classes5/classes5__t2_classes5', d5_tarski)).
fof(fc3_xboole_0, axiom, ![X1, X2]:~(v1_xboole_0(k2_tarski(X1,X2))), file('classes5/classes5__t2_classes5', fc3_xboole_0)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('classes5/classes5__t2_classes5', t3_subset)).
fof(t2_funct_2, axiom, ![X1, X2]:((v1_relat_1(X2)&v1_funct_1(X2))=>(r1_tarski(k10_xtuple_0(X2),X1)=>((v1_funct_1(X2)&v1_funct_2(X2,k9_xtuple_0(X2),X1))&m1_subset_1(X2,k1_zfmisc_1(k2_zfmisc_1(k9_xtuple_0(X2),X1)))))), file('classes5/classes5__t2_classes5', t2_funct_2)).
fof(d3_tarski, axiom, ![X1, X2]:(r1_tarski(X1,X2)<=>![X3]:(r2_hidden(X3,X1)=>r2_hidden(X3,X2))), file('classes5/classes5__t2_classes5', d3_tarski)).
fof(t2_classes5, conjecture, ![X1]:(~(v1_xboole_0(X1))=>~((m1_subset_1(k1_tarski(k1_xboole_0),X1)&r2_tarski(k1_tarski(k1_xboole_0),k1_ens_1(X1))))), file('classes5/classes5__t2_classes5', t2_classes5)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('classes5/classes5__t2_classes5', t1_subset)).
fof(reflexivity_r1_tarski, axiom, ![X1, X2]:r1_tarski(X1,X1), file('classes5/classes5__t2_classes5', reflexivity_r1_tarski)).
fof(d1_tarski, axiom, ![X1, X2]:(X2=k1_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>X3=X1)), file('classes5/classes5__t2_classes5', d1_tarski)).
fof(cc8_funct_1, axiom, ![X1]:(v4_funct_1(X1)=>![X2]:(m1_subset_1(X2,X1)=>(v1_relat_1(X2)&v1_funct_1(X2)))), file('classes5/classes5__t2_classes5', cc8_funct_1)).
fof(fc1_ens_1, axiom, ![X1]:(~(v1_xboole_0(X1))=>(v4_funct_1(k1_ens_1(X1))&~(v1_xboole_0(k1_ens_1(X1))))), file('classes5/classes5__t2_classes5', fc1_ens_1)).
fof(fc1_xboole_0, axiom, v1_xboole_0(k1_xboole_0), file('classes5/classes5__t2_classes5', fc1_xboole_0)).
fof(c_0_13, plain, ![X47, X48, X49, X50, X53, X54, X55, X56, X57, X58, X60, X61]:(((((r2_hidden(esk3_4(X47,X48,X49,X50),X47)|~r2_hidden(X50,X49)|X49!=k2_zfmisc_1(X47,X48))&(r2_hidden(esk4_4(X47,X48,X49,X50),X48)|~r2_hidden(X50,X49)|X49!=k2_zfmisc_1(X47,X48)))&(X50=k4_tarski(esk3_4(X47,X48,X49,X50),esk4_4(X47,X48,X49,X50))|~r2_hidden(X50,X49)|X49!=k2_zfmisc_1(X47,X48)))&(~r2_hidden(X54,X47)|~r2_hidden(X55,X48)|X53!=k4_tarski(X54,X55)|r2_hidden(X53,X49)|X49!=k2_zfmisc_1(X47,X48)))&((~r2_hidden(esk5_3(X56,X57,X58),X58)|(~r2_hidden(X60,X56)|~r2_hidden(X61,X57)|esk5_3(X56,X57,X58)!=k4_tarski(X60,X61))|X58=k2_zfmisc_1(X56,X57))&(((r2_hidden(esk6_3(X56,X57,X58),X56)|r2_hidden(esk5_3(X56,X57,X58),X58)|X58=k2_zfmisc_1(X56,X57))&(r2_hidden(esk7_3(X56,X57,X58),X57)|r2_hidden(esk5_3(X56,X57,X58),X58)|X58=k2_zfmisc_1(X56,X57)))&(esk5_3(X56,X57,X58)=k4_tarski(esk6_3(X56,X57,X58),esk7_3(X56,X57,X58))|r2_hidden(esk5_3(X56,X57,X58),X58)|X58=k2_zfmisc_1(X56,X57))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_zfmisc_1])])])])])])).
fof(c_0_14, plain, ![X70, X71]:k4_tarski(X70,X71)=k2_tarski(k2_tarski(X70,X71),k1_tarski(X70)), inference(variable_rename,[status(thm)],[d5_tarski])).
fof(c_0_15, plain, ![X1, X2]:~v1_xboole_0(k2_tarski(X1,X2)), inference(fof_simplification,[status(thm)],[fc3_xboole_0])).
cnf(c_0_16, plain, (X1=k4_tarski(esk3_4(X2,X3,X4,X1),esk4_4(X2,X3,X4,X1))|~r2_hidden(X1,X4)|X4!=k2_zfmisc_1(X2,X3)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_17, plain, (k4_tarski(X1,X2)=k2_tarski(k2_tarski(X1,X2),k1_tarski(X1))), inference(split_conjunct,[status(thm)],[c_0_14])).
fof(c_0_18, plain, ![X82, X83]:((~m1_subset_1(X82,k1_zfmisc_1(X83))|r1_tarski(X82,X83))&(~r1_tarski(X82,X83)|m1_subset_1(X82,k1_zfmisc_1(X83)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
fof(c_0_19, plain, ![X80, X81]:(((v1_funct_1(X81)|~r1_tarski(k10_xtuple_0(X81),X80)|(~v1_relat_1(X81)|~v1_funct_1(X81)))&(v1_funct_2(X81,k9_xtuple_0(X81),X80)|~r1_tarski(k10_xtuple_0(X81),X80)|(~v1_relat_1(X81)|~v1_funct_1(X81))))&(m1_subset_1(X81,k1_zfmisc_1(k2_zfmisc_1(k9_xtuple_0(X81),X80)))|~r1_tarski(k10_xtuple_0(X81),X80)|(~v1_relat_1(X81)|~v1_funct_1(X81)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_funct_2])])])).
fof(c_0_20, plain, ![X73, X74]:~v1_xboole_0(k2_tarski(X73,X74)), inference(variable_rename,[status(thm)],[c_0_15])).
cnf(c_0_21, plain, (X1=k2_tarski(k2_tarski(esk3_4(X2,X3,X4,X1),esk4_4(X2,X3,X4,X1)),k1_tarski(esk3_4(X2,X3,X4,X1)))|X4!=k2_zfmisc_1(X2,X3)|~r2_hidden(X1,X4)), inference(rw,[status(thm)],[c_0_16, c_0_17])).
fof(c_0_22, plain, ![X64, X65, X66, X67, X68]:((~r1_tarski(X64,X65)|(~r2_hidden(X66,X64)|r2_hidden(X66,X65)))&((r2_hidden(esk8_2(X67,X68),X67)|r1_tarski(X67,X68))&(~r2_hidden(esk8_2(X67,X68),X68)|r1_tarski(X67,X68)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])).
cnf(c_0_23, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2))), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_24, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(k9_xtuple_0(X1),X2)))|~r1_tarski(k10_xtuple_0(X1),X2)|~v1_relat_1(X1)|~v1_funct_1(X1)), inference(split_conjunct,[status(thm)],[c_0_19])).
fof(c_0_25, negated_conjecture, ~(![X1]:(~v1_xboole_0(X1)=>~((m1_subset_1(k1_tarski(k1_xboole_0),X1)&r2_tarski(k1_tarski(k1_xboole_0),k1_ens_1(X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t2_classes5])])).
cnf(c_0_26, plain, (~v1_xboole_0(k2_tarski(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_27, plain, (k2_tarski(k2_tarski(esk3_4(X1,X2,k2_zfmisc_1(X1,X2),X3),esk4_4(X1,X2,k2_zfmisc_1(X1,X2),X3)),k1_tarski(esk3_4(X1,X2,k2_zfmisc_1(X1,X2),X3)))=X3|~r2_hidden(X3,k2_zfmisc_1(X1,X2))), inference(er,[status(thm)],[c_0_21])).
cnf(c_0_28, plain, (r2_hidden(X3,X2)|~r1_tarski(X1,X2)|~r2_hidden(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_29, plain, (r1_tarski(X1,k2_zfmisc_1(k9_xtuple_0(X1),X2))|~r1_tarski(k10_xtuple_0(X1),X2)|~v1_funct_1(X1)|~v1_relat_1(X1)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
fof(c_0_30, plain, ![X78, X79]:(~r2_tarski(X78,X79)|m1_subset_1(X78,X79)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
fof(c_0_31, negated_conjecture, (~v1_xboole_0(esk1_0)&(m1_subset_1(k1_tarski(k1_xboole_0),esk1_0)&r2_tarski(k1_tarski(k1_xboole_0),k1_ens_1(esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])).
cnf(c_0_32, plain, (~r2_hidden(X1,k2_zfmisc_1(X2,X3))|~v1_xboole_0(X1)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
cnf(c_0_33, plain, (r2_hidden(X1,k2_zfmisc_1(k9_xtuple_0(X2),X3))|~r1_tarski(k10_xtuple_0(X2),X3)|~r2_hidden(X1,X2)|~v1_funct_1(X2)|~v1_relat_1(X2)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
fof(c_0_34, plain, ![X77]:r1_tarski(X77,X77), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])])).
fof(c_0_35, plain, ![X40, X41, X42, X43, X44, X45]:(((~r2_hidden(X42,X41)|X42=X40|X41!=k1_tarski(X40))&(X43!=X40|r2_hidden(X43,X41)|X41!=k1_tarski(X40)))&((~r2_hidden(esk2_2(X44,X45),X45)|esk2_2(X44,X45)!=X44|X45=k1_tarski(X44))&(r2_hidden(esk2_2(X44,X45),X45)|esk2_2(X44,X45)=X44|X45=k1_tarski(X44)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])])).
fof(c_0_36, plain, ![X38, X39]:((v1_relat_1(X39)|~m1_subset_1(X39,X38)|~v4_funct_1(X38))&(v1_funct_1(X39)|~m1_subset_1(X39,X38)|~v4_funct_1(X38))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_funct_1])])])])).
cnf(c_0_37, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_38, negated_conjecture, (r2_tarski(k1_tarski(k1_xboole_0),k1_ens_1(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_31])).
fof(c_0_39, plain, ![X1]:(~v1_xboole_0(X1)=>(v4_funct_1(k1_ens_1(X1))&~v1_xboole_0(k1_ens_1(X1)))), inference(fof_simplification,[status(thm)],[fc1_ens_1])).
cnf(c_0_40, plain, (~r1_tarski(k10_xtuple_0(X1),X2)|~r2_hidden(X3,X1)|~v1_funct_1(X1)|~v1_relat_1(X1)|~v1_xboole_0(X3)), inference(spm,[status(thm)],[c_0_32, c_0_33])).
cnf(c_0_41, plain, (r1_tarski(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_34])).
cnf(c_0_42, plain, (r2_hidden(X1,X3)|X1!=X2|X3!=k1_tarski(X2)), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_43, plain, (v1_funct_1(X1)|~m1_subset_1(X1,X2)|~v4_funct_1(X2)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_44, negated_conjecture, (m1_subset_1(k1_tarski(k1_xboole_0),k1_ens_1(esk1_0))), inference(spm,[status(thm)],[c_0_37, c_0_38])).
fof(c_0_45, plain, ![X72]:((v4_funct_1(k1_ens_1(X72))|v1_xboole_0(X72))&(~v1_xboole_0(k1_ens_1(X72))|v1_xboole_0(X72))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])])).
cnf(c_0_46, plain, (v1_relat_1(X1)|~m1_subset_1(X1,X2)|~v4_funct_1(X2)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_47, plain, (~r2_hidden(X1,X2)|~v1_funct_1(X2)|~v1_relat_1(X2)|~v1_xboole_0(X1)), inference(spm,[status(thm)],[c_0_40, c_0_41])).
cnf(c_0_48, plain, (r2_hidden(X1,k1_tarski(X1))), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_42])])).
cnf(c_0_49, negated_conjecture, (v1_funct_1(k1_tarski(k1_xboole_0))|~v4_funct_1(k1_ens_1(esk1_0))), inference(spm,[status(thm)],[c_0_43, c_0_44])).
cnf(c_0_50, plain, (v4_funct_1(k1_ens_1(X1))|v1_xboole_0(X1)), inference(split_conjunct,[status(thm)],[c_0_45])).
cnf(c_0_51, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_31])).
cnf(c_0_52, negated_conjecture, (v1_relat_1(k1_tarski(k1_xboole_0))|~v4_funct_1(k1_ens_1(esk1_0))), inference(spm,[status(thm)],[c_0_46, c_0_44])).
cnf(c_0_53, plain, (~v1_funct_1(k1_tarski(X1))|~v1_relat_1(k1_tarski(X1))|~v1_xboole_0(X1)), inference(spm,[status(thm)],[c_0_47, c_0_48])).
cnf(c_0_54, negated_conjecture, (v1_funct_1(k1_tarski(k1_xboole_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_51])).
cnf(c_0_55, negated_conjecture, (v1_relat_1(k1_tarski(k1_xboole_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_50]), c_0_51])).
cnf(c_0_56, plain, (v1_xboole_0(k1_xboole_0)), inference(split_conjunct,[status(thm)],[fc1_xboole_0])).
cnf(c_0_57, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53, c_0_54]), c_0_55]), c_0_56])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 58
# Proof object clause steps            : 30
# Proof object formula steps           : 28
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 15
# Proof object initial formulas used   : 13
# Proof object generating inferences   : 12
# Proof object simplifying inferences  : 9
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 14
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 33
# Removed in clause preprocessing      : 3
# Initial clauses in saturation        : 30
# Processed clauses                    : 101
# ...of these trivial                  : 2
# ...subsumed                          : 3
# ...remaining for further processing  : 96
# Other redundant clauses eliminated   : 11
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 2
# Generated clauses                    : 118
# ...of the previous two non-trivial   : 101
# Contextual simplify-reflections      : 0
# Paramodulations                      : 107
# Factorizations                       : 2
# NegExts                              : 0
# Equation resolutions                 : 11
# 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  : 57
#    Positive orientable unit clauses  : 8
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 47
# Current number of unprocessed clauses: 60
# ...number of literals in the above   : 258
# Current number of archived formulas  : 0
# Current number of archived clauses   : 35
# Clause-clause subsumption calls (NU) : 394
# Rec. Clause-clause subsumption calls : 215
# Non-unit clause-clause subsumptions  : 3
# Unit Clause-clause subsumption calls : 0
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 3
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 4283

# -------------------------------------------------
# User time                : 0.014 s
# System time              : 0.008 s
# Total time               : 0.022 s
# Maximum resident set size: 3476 pages
