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

# Failure: User resource limit exceeded!
# Parsed axioms                        : 19
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 32
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 32
# Processed clauses                    : 72650
# ...of these trivial                  : 581
# ...subsumed                          : 47355
# ...remaining for further processing  : 24714
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 85889
# Backward-subsumed                    : 1144
# Backward-rewritten                   : 146
# Generated clauses                    : 6245935
# ...of the previous two non-trivial   : 6226599
# Contextual simplify-reflections      : 2468
# Paramodulations                      : 6245925
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 2
# Propositional unsat checks           : 4
#    Propositional check models        : 4
#    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       : 6.975
#    Propositional solver time         : 0.298
#    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  : 23382
#    Positive orientable unit clauses  : 320
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 5
#    Non-unit-clauses                  : 23057
# Current number of unprocessed clauses: 964136
# ...number of literals in the above   : 3422833
# Current number of archived formulas  : 0
# Current number of archived clauses   : 1330
# Clause-clause subsumption calls (NU) : 48848955
# Rec. Clause-clause subsumption calls : 28904423
# Non-unit clause-clause subsumptions  : 39058
# Unit Clause-clause subsumption calls : 373612
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 14619
# BW rewrite match successes           : 282
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 177103271
# No success with AutoSched0
# Trying AutoSched1 for 71 seconds
# AutoSched1-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S033I
# and selection function PSelectUnlessUniqMax.
#
# Preprocessing time       : 0.020 s
# Presaturation interreduction done

# Failure: User resource limit exceeded!
# Parsed axioms                        : 19
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 32
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 32
# Processed clauses                    : 87949
# ...of these trivial                  : 117
# ...subsumed                          : 74382
# ...remaining for further processing  : 13450
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 141408
# Backward-subsumed                    : 1117
# Backward-rewritten                   : 82
# Generated clauses                    : 2612063
# ...of the previous two non-trivial   : 2550240
# Contextual simplify-reflections      : 247
# Paramodulations                      : 2611661
# Factorizations                       : 400
# NegExts                              : 0
# Equation resolutions                 : 2
# 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  : 12217
#    Positive orientable unit clauses  : 98
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 7
#    Non-unit-clauses                  : 12112
# Current number of unprocessed clauses: 821797
# ...number of literals in the above   : 4081623
# Current number of archived formulas  : 0
# Current number of archived clauses   : 1231
# Clause-clause subsumption calls (NU) : 47542056
# Rec. Clause-clause subsumption calls : 5758129
# Non-unit clause-clause subsumptions  : 43569
# Unit Clause-clause subsumption calls : 61332
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 800
# BW rewrite match successes           : 5
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 68591496
# No success with AutoSched1
# Trying AutoSched2 for 23 seconds
# AutoSched2-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
# and selection function PSelectComplexExceptUniqMaxHorn.
#
# Preprocessing time       : 0.020 s
# Presaturation interreduction done

# Failure: User resource limit exceeded!
# Parsed axioms                        : 19
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 32
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 32
# Processed clauses                    : 50298
# ...of these trivial                  : 638
# ...subsumed                          : 34416
# ...remaining for further processing  : 15244
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1079
# Backward-rewritten                   : 93
# Generated clauses                    : 973084
# ...of the previous two non-trivial   : 930347
# Contextual simplify-reflections      : 1489
# Paramodulations                      : 973068
# Factorizations                       : 4
# NegExts                              : 0
# Equation resolutions                 : 2
# Propositional unsat checks           : 3
#    Propositional check models        : 3
#    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       : 2.528
#    Propositional solver time         : 0.104
#    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  : 14028
#    Positive orientable unit clauses  : 587
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 18
#    Non-unit-clauses                  : 13423
# Current number of unprocessed clauses: 875626
# ...number of literals in the above   : 3729283
# Current number of archived formulas  : 0
# Current number of archived clauses   : 1214
# Clause-clause subsumption calls (NU) : 21280887
# Rec. Clause-clause subsumption calls : 11407148
# Non-unit clause-clause subsumptions  : 29013
# Unit Clause-clause subsumption calls : 137358
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 3775
# BW rewrite match successes           : 175
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 35260084
# No success with AutoSched2
# Trying AutoSched3 for 19 seconds
# AutoSched3-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S08CI
# and selection function SelectCQIPrecWNTNp.
#
# Preprocessing time       : 0.020 s
# Presaturation interreduction done

# Failure: User resource limit exceeded!
# Parsed axioms                        : 19
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 32
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 32
# Processed clauses                    : 18243
# ...of these trivial                  : 162
# ...subsumed                          : 6675
# ...remaining for further processing  : 11406
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 101629
# Backward-subsumed                    : 304
# Backward-rewritten                   : 440
# Generated clauses                    : 1704213
# ...of the previous two non-trivial   : 1672957
# Contextual simplify-reflections      : 60
# Paramodulations                      : 1704207
# Factorizations                       : 4
# NegExts                              : 0
# Equation resolutions                 : 2
# 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  : 10628
#    Positive orientable unit clauses  : 3567
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 4
#    Non-unit-clauses                  : 7057
# Current number of unprocessed clauses: 826998
# ...number of literals in the above   : 1458377
# Current number of archived formulas  : 0
# Current number of archived clauses   : 776
# Clause-clause subsumption calls (NU) : 3913246
# Rec. Clause-clause subsumption calls : 2429542
# Non-unit clause-clause subsumptions  : 4202
# Unit Clause-clause subsumption calls : 1518376
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 114479
# BW rewrite match successes           : 116
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 41680814
# No success with AutoSched3
# Trying AutoSched4 for 13 seconds
# AutoSched4-Mode selected heuristic G_E___302_C18_F1_URBAN_S5PRR_RG_S0Y
# and selection function SelectMaxLComplexAvoidPosPred.
#
# Preprocessing time       : 0.021 s

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t57_classes2, axiom, ![X1, X2]:((~(v1_xboole_0(X2))&v1_classes2(X2))=>(r2_tarski(X1,X2)=>r2_tarski(k1_tarski(X1),X2))), file('classes5/classes5__t101_classes5', t57_classes2)).
fof(t7_boole, axiom, ![X1, X2]:~((r2_tarski(X1,X2)&v1_xboole_0(X2))), file('classes5/classes5__t101_classes5', t7_boole)).
fof(d3_tarski, axiom, ![X1, X2]:(r1_tarski(X1,X2)<=>![X3]:(r2_hidden(X3,X1)=>r2_hidden(X3,X2))), file('classes5/classes5__t101_classes5', d3_tarski)).
fof(t77_zfmisc_1, axiom, ![X1, X2]:(r1_tarski(X1,X2)=>r1_tarski(k3_tarski(X1),k3_tarski(X2))), file('classes5/classes5__t101_classes5', t77_zfmisc_1)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('classes5/classes5__t101_classes5', redefinition_r2_tarski)).
fof(t81_classes4, axiom, ![X1]:(((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))=>k3_tarski(X1)=X1), file('classes5/classes5__t101_classes5', t81_classes4)).
fof(cc6_classes3, axiom, ![X1]:(v1_classes2(X1)=>((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))), file('classes5/classes5__t101_classes5', cc6_classes3)).
fof(t56_classes2, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>r2_tarski(k1_xboole_0,X1)), file('classes5/classes5__t101_classes5', t56_classes2)).
fof(t101_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>r2_xboole_0(k1_ens_1(X1),X1)), file('classes5/classes5__t101_classes5', t101_classes5)).
fof(dt_k12_classes2, axiom, ![X1, X2, X3]:((((~(v1_xboole_0(X1))&v1_classes2(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))=>m1_subset_1(k12_classes2(X1,X2,X3),X1)), file('classes5/classes5__t101_classes5', dt_k12_classes2)).
fof(redefinition_k12_classes2, axiom, ![X1, X2, X3]:((((~(v1_xboole_0(X1))&v1_classes2(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))=>k12_classes2(X1,X2,X3)=k1_funct_2(X2,X3)), file('classes5/classes5__t101_classes5', redefinition_k12_classes2)).
fof(t4_subset, axiom, ![X1, X2, X3]:((r2_tarski(X1,X2)&m1_subset_1(X2,k1_zfmisc_1(X3)))=>m1_subset_1(X1,X3)), file('classes5/classes5__t101_classes5', t4_subset)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('classes5/classes5__t101_classes5', t3_subset)).
fof(fraenkel_a_1_0_ens_1, axiom, ![X1, X2]:(~(v1_xboole_0(X2))=>(r2_hidden(X1,a_1_0_ens_1(X2))<=>?[X3, X4]:((m1_subset_1(X3,X2)&m1_subset_1(X4,X2))&X1=k1_funct_2(X3,X4)))), file('classes5/classes5__t101_classes5', fraenkel_a_1_0_ens_1)).
fof(reflexivity_r1_tarski, axiom, ![X1, X2]:r1_tarski(X1,X1), file('classes5/classes5__t101_classes5', reflexivity_r1_tarski)).
fof(d1_ens_1, axiom, ![X1]:(~(v1_xboole_0(X1))=>k1_ens_1(X1)=k3_tarski(a_1_0_ens_1(X1))), file('classes5/classes5__t101_classes5', d1_ens_1)).
fof(t2_subset, axiom, ![X1, X2]:(m1_subset_1(X1,X2)=>(v1_xboole_0(X2)|r2_tarski(X1,X2))), file('classes5/classes5__t101_classes5', t2_subset)).
fof(d8_xboole_0, axiom, ![X1, X2]:(r2_xboole_0(X1,X2)<=>(r1_tarski(X1,X2)&X1!=X2)), file('classes5/classes5__t101_classes5', d8_xboole_0)).
fof(t2_classes5, axiom, ![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__t101_classes5', t2_classes5)).
fof(c_0_19, plain, ![X1, X2]:((~v1_xboole_0(X2)&v1_classes2(X2))=>(r2_tarski(X1,X2)=>r2_tarski(k1_tarski(X1),X2))), inference(fof_simplification,[status(thm)],[t57_classes2])).
fof(c_0_20, plain, ![X78, X79]:(v1_xboole_0(X79)|~v1_classes2(X79)|(~r2_tarski(X78,X79)|r2_tarski(k1_tarski(X78),X79))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])).
fof(c_0_21, plain, ![X82, X83]:(~r2_tarski(X82,X83)|~v1_xboole_0(X83)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])).
fof(c_0_22, plain, ![X46, X47, X48, X49, X50]:((~r1_tarski(X46,X47)|(~r2_hidden(X48,X46)|r2_hidden(X48,X47)))&((r2_hidden(esk2_2(X49,X50),X49)|r1_tarski(X49,X50))&(~r2_hidden(esk2_2(X49,X50),X50)|r1_tarski(X49,X50)))), 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])])])])])])).
fof(c_0_23, plain, ![X80, X81]:(~r1_tarski(X80,X81)|r1_tarski(k3_tarski(X80),k3_tarski(X81))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t77_zfmisc_1])])).
fof(c_0_24, plain, ![X66, X67]:((~r2_tarski(X66,X67)|r2_hidden(X66,X67))&(~r2_hidden(X66,X67)|r2_tarski(X66,X67))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_25, plain, (v1_xboole_0(X1)|r2_tarski(k1_tarski(X2),X1)|~v1_classes2(X1)|~r2_tarski(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_20])).
cnf(c_0_26, plain, (~r2_tarski(X1,X2)|~v1_xboole_0(X2)), inference(split_conjunct,[status(thm)],[c_0_21])).
fof(c_0_27, plain, ![X84]:(~v1_ordinal1(X84)|~v1_classes3(X84)|~v3_classes3(X84)|k3_tarski(X84)=X84), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t81_classes4])])).
fof(c_0_28, plain, ![X44]:(((v1_ordinal1(X44)|~v1_classes2(X44))&(v1_classes3(X44)|~v1_classes2(X44)))&(v3_classes3(X44)|~v1_classes2(X44))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc6_classes3])])])).
cnf(c_0_29, plain, (r2_hidden(X3,X2)|~r1_tarski(X1,X2)|~r2_hidden(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_30, plain, (r1_tarski(k3_tarski(X1),k3_tarski(X2))|~r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_31, plain, (r2_hidden(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_32, plain, (r2_tarski(k1_tarski(X1),X2)|~r2_tarski(X1,X2)|~v1_classes2(X2)), inference(csr,[status(thm)],[c_0_25, c_0_26])).
fof(c_0_33, plain, ![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>r2_tarski(k1_xboole_0,X1)), inference(fof_simplification,[status(thm)],[t56_classes2])).
fof(c_0_34, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>r2_xboole_0(k1_ens_1(X1),X1))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t101_classes5])])).
cnf(c_0_35, plain, (k3_tarski(X1)=X1|~v1_ordinal1(X1)|~v1_classes3(X1)|~v3_classes3(X1)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_36, plain, (v3_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_37, plain, (v1_ordinal1(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_38, plain, (v1_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_28])).
fof(c_0_39, plain, ![X1, X2, X3]:((((~v1_xboole_0(X1)&v1_classes2(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))=>m1_subset_1(k12_classes2(X1,X2,X3),X1)), inference(fof_simplification,[status(thm)],[dt_k12_classes2])).
fof(c_0_40, plain, ![X1, X2, X3]:((((~v1_xboole_0(X1)&v1_classes2(X1))&m1_subset_1(X2,X1))&m1_subset_1(X3,X1))=>k12_classes2(X1,X2,X3)=k1_funct_2(X2,X3)), inference(fof_simplification,[status(thm)],[redefinition_k12_classes2])).
fof(c_0_41, plain, ![X74, X75, X76]:(~r2_tarski(X74,X75)|~m1_subset_1(X75,k1_zfmisc_1(X76))|m1_subset_1(X74,X76)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])).
fof(c_0_42, plain, ![X72, X73]:((~m1_subset_1(X72,k1_zfmisc_1(X73))|r1_tarski(X72,X73))&(~r1_tarski(X72,X73)|m1_subset_1(X72,k1_zfmisc_1(X73)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
cnf(c_0_43, plain, (r2_hidden(X1,k3_tarski(X2))|~r2_hidden(X1,k3_tarski(X3))|~r1_tarski(X3,X2)), inference(spm,[status(thm)],[c_0_29, c_0_30])).
cnf(c_0_44, plain, (r2_hidden(k1_tarski(X1),X2)|~r2_tarski(X1,X2)|~v1_classes2(X2)), inference(spm,[status(thm)],[c_0_31, c_0_32])).
fof(c_0_45, plain, ![X77]:(v1_xboole_0(X77)|~v1_classes2(X77)|r2_tarski(k1_xboole_0,X77)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])).
fof(c_0_46, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&~r2_xboole_0(k1_ens_1(esk1_0),esk1_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])).
cnf(c_0_47, plain, (k3_tarski(X1)=X1|~v1_classes2(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37]), c_0_38])).
fof(c_0_48, plain, ![X54, X55, X56]:(v1_xboole_0(X54)|~v1_classes2(X54)|~m1_subset_1(X55,X54)|~m1_subset_1(X56,X54)|m1_subset_1(k12_classes2(X54,X55,X56),X54)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])).
fof(c_0_49, plain, ![X63, X64, X65]:(v1_xboole_0(X63)|~v1_classes2(X63)|~m1_subset_1(X64,X63)|~m1_subset_1(X65,X63)|k12_classes2(X63,X64,X65)=k1_funct_2(X64,X65)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])).
fof(c_0_50, plain, ![X1, X2]:(~v1_xboole_0(X2)=>(r2_hidden(X1,a_1_0_ens_1(X2))<=>?[X3, X4]:((m1_subset_1(X3,X2)&m1_subset_1(X4,X2))&X1=k1_funct_2(X3,X4)))), inference(fof_simplification,[status(thm)],[fraenkel_a_1_0_ens_1])).
cnf(c_0_51, plain, (m1_subset_1(X1,X3)|~r2_tarski(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3))), inference(split_conjunct,[status(thm)],[c_0_41])).
cnf(c_0_52, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_42])).
cnf(c_0_53, plain, (r2_hidden(k1_tarski(X1),k3_tarski(X2))|~r2_tarski(X1,k3_tarski(X3))|~r1_tarski(X3,X2)|~v1_classes2(k3_tarski(X3))), inference(spm,[status(thm)],[c_0_43, c_0_44])).
cnf(c_0_54, plain, (v1_xboole_0(X1)|r2_tarski(k1_xboole_0,X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_45])).
cnf(c_0_55, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_46])).
cnf(c_0_56, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_46])).
cnf(c_0_57, plain, (r1_tarski(X1,k3_tarski(X2))|~r1_tarski(X1,X2)|~v1_classes2(X1)), inference(spm,[status(thm)],[c_0_30, c_0_47])).
fof(c_0_58, plain, ![X68]:r1_tarski(X68,X68), inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])])).
cnf(c_0_59, plain, (v1_xboole_0(X1)|m1_subset_1(k12_classes2(X1,X2,X3),X1)|~v1_classes2(X1)|~m1_subset_1(X2,X1)|~m1_subset_1(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_48])).
cnf(c_0_60, plain, (v1_xboole_0(X1)|k12_classes2(X1,X2,X3)=k1_funct_2(X2,X3)|~v1_classes2(X1)|~m1_subset_1(X2,X1)|~m1_subset_1(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_49])).
fof(c_0_61, plain, ![X57, X58, X61, X62]:((((m1_subset_1(esk3_2(X57,X58),X58)|~r2_hidden(X57,a_1_0_ens_1(X58))|v1_xboole_0(X58))&(m1_subset_1(esk4_2(X57,X58),X58)|~r2_hidden(X57,a_1_0_ens_1(X58))|v1_xboole_0(X58)))&(X57=k1_funct_2(esk3_2(X57,X58),esk4_2(X57,X58))|~r2_hidden(X57,a_1_0_ens_1(X58))|v1_xboole_0(X58)))&(~m1_subset_1(X61,X58)|~m1_subset_1(X62,X58)|X57!=k1_funct_2(X61,X62)|r2_hidden(X57,a_1_0_ens_1(X58))|v1_xboole_0(X58))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_50])])])])])).
cnf(c_0_62, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X3)|~r1_tarski(X3,X2)), inference(spm,[status(thm)],[c_0_51, c_0_52])).
cnf(c_0_63, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_64, plain, (r2_hidden(k1_tarski(X1),k3_tarski(X2))|~r2_tarski(X1,X3)|~r1_tarski(X3,X2)|~v1_classes2(X3)), inference(spm,[status(thm)],[c_0_53, c_0_47])).
cnf(c_0_65, negated_conjecture, (r2_tarski(k1_xboole_0,esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54, c_0_55]), c_0_56])).
cnf(c_0_66, plain, (r2_hidden(X1,k3_tarski(X2))|~r2_hidden(X1,X3)|~r1_tarski(X3,X2)|~v1_classes2(X3)), inference(spm,[status(thm)],[c_0_29, c_0_57])).
cnf(c_0_67, plain, (r1_tarski(X1,X1)), inference(split_conjunct,[status(thm)],[c_0_58])).
fof(c_0_68, plain, ![X1]:(~v1_xboole_0(X1)=>k1_ens_1(X1)=k3_tarski(a_1_0_ens_1(X1))), inference(fof_simplification,[status(thm)],[d1_ens_1])).
fof(c_0_69, plain, ![X70, X71]:(~m1_subset_1(X70,X71)|(v1_xboole_0(X71)|r2_tarski(X70,X71))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])).
cnf(c_0_70, plain, (m1_subset_1(k1_funct_2(X1,X2),X3)|v1_xboole_0(X3)|~m1_subset_1(X2,X3)|~m1_subset_1(X1,X3)|~v1_classes2(X3)), inference(spm,[status(thm)],[c_0_59, c_0_60])).
cnf(c_0_71, plain, (X1=k1_funct_2(esk3_2(X1,X2),esk4_2(X1,X2))|v1_xboole_0(X2)|~r2_hidden(X1,a_1_0_ens_1(X2))), inference(split_conjunct,[status(thm)],[c_0_61])).
cnf(c_0_72, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X3)|~r1_tarski(X3,X2)), inference(spm,[status(thm)],[c_0_62, c_0_63])).
cnf(c_0_73, negated_conjecture, (r2_hidden(k1_tarski(k1_xboole_0),k3_tarski(X1))|~r1_tarski(esk1_0,X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64, c_0_65]), c_0_55])])).
cnf(c_0_74, plain, (r1_tarski(X1,X2)|~r2_hidden(esk2_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_75, plain, (r2_hidden(X1,k3_tarski(X2))|~r2_hidden(X1,X2)|~v1_classes2(X2)), inference(spm,[status(thm)],[c_0_66, c_0_67])).
fof(c_0_76, plain, ![X52, X53]:(((r1_tarski(X52,X53)|~r2_xboole_0(X52,X53))&(X52!=X53|~r2_xboole_0(X52,X53)))&(~r1_tarski(X52,X53)|X52=X53|r2_xboole_0(X52,X53))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d8_xboole_0])])])).
fof(c_0_77, plain, ![X45]:(v1_xboole_0(X45)|k1_ens_1(X45)=k3_tarski(a_1_0_ens_1(X45))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_68])])).
cnf(c_0_78, plain, (v1_xboole_0(X2)|r2_tarski(X1,X2)|~m1_subset_1(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_69])).
cnf(c_0_79, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X3)|v1_xboole_0(X2)|~m1_subset_1(esk4_2(X1,X3),X2)|~m1_subset_1(esk3_2(X1,X3),X2)|~r2_hidden(X1,a_1_0_ens_1(X3))|~v1_classes2(X2)), inference(spm,[status(thm)],[c_0_70, c_0_71])).
cnf(c_0_80, plain, (m1_subset_1(esk4_2(X1,X2),X2)|v1_xboole_0(X2)|~r2_hidden(X1,a_1_0_ens_1(X2))), inference(split_conjunct,[status(thm)],[c_0_61])).
cnf(c_0_81, plain, (m1_subset_1(esk3_2(X1,X2),X2)|v1_xboole_0(X2)|~r2_hidden(X1,a_1_0_ens_1(X2))), inference(split_conjunct,[status(thm)],[c_0_61])).
cnf(c_0_82, negated_conjecture, (m1_subset_1(k1_tarski(k1_xboole_0),X1)|~r1_tarski(k3_tarski(X2),X1)|~r1_tarski(esk1_0,X2)), inference(spm,[status(thm)],[c_0_72, c_0_73])).
cnf(c_0_83, plain, (r1_tarski(k3_tarski(X1),X2)|~r1_tarski(X1,X2)|~v1_classes2(X2)), inference(spm,[status(thm)],[c_0_30, c_0_47])).
cnf(c_0_84, plain, (r1_tarski(X1,k3_tarski(X2))|~r2_hidden(esk2_2(X1,k3_tarski(X2)),X2)|~v1_classes2(X2)), inference(spm,[status(thm)],[c_0_74, c_0_75])).
cnf(c_0_85, plain, (r2_hidden(esk2_2(X1,X2),X1)|r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_22])).
fof(c_0_86, plain, ![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)],[t2_classes5])).
cnf(c_0_87, negated_conjecture, (~r2_xboole_0(k1_ens_1(esk1_0),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_46])).
cnf(c_0_88, plain, (X1=X2|r2_xboole_0(X1,X2)|~r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_76])).
cnf(c_0_89, plain, (v1_xboole_0(X1)|k1_ens_1(X1)=k3_tarski(a_1_0_ens_1(X1))), inference(split_conjunct,[status(thm)],[c_0_77])).
cnf(c_0_90, plain, (r2_hidden(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(X1,X2)), inference(spm,[status(thm)],[c_0_31, c_0_78])).
cnf(c_0_91, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|~r2_hidden(X1,a_1_0_ens_1(X2))|~v1_classes2(X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_79, c_0_80]), c_0_81])).
cnf(c_0_92, negated_conjecture, (m1_subset_1(k1_tarski(k1_xboole_0),X1)|~r1_tarski(esk1_0,X2)|~r1_tarski(X2,X1)|~v1_classes2(X1)), inference(spm,[status(thm)],[c_0_82, c_0_83])).
cnf(c_0_93, plain, (r1_tarski(X1,k3_tarski(X1))|~v1_classes2(X1)), inference(spm,[status(thm)],[c_0_84, c_0_85])).
fof(c_0_94, plain, ![X69]:(v1_xboole_0(X69)|(~m1_subset_1(k1_tarski(k1_xboole_0),X69)|~r2_tarski(k1_tarski(k1_xboole_0),k1_ens_1(X69)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_86])])).
cnf(c_0_95, negated_conjecture, (k1_ens_1(esk1_0)=esk1_0|~r1_tarski(k1_ens_1(esk1_0),esk1_0)), inference(spm,[status(thm)],[c_0_87, c_0_88])).
cnf(c_0_96, plain, (r1_tarski(k1_ens_1(X1),X2)|v1_xboole_0(X1)|~r1_tarski(a_1_0_ens_1(X1),X2)|~v1_classes2(X2)), inference(spm,[status(thm)],[c_0_83, c_0_89])).
cnf(c_0_97, plain, (r1_tarski(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(esk2_2(X1,X2),X2)), inference(spm,[status(thm)],[c_0_74, c_0_90])).
cnf(c_0_98, plain, (m1_subset_1(esk2_2(a_1_0_ens_1(X1),X2),X1)|r1_tarski(a_1_0_ens_1(X1),X2)|v1_xboole_0(X1)|~v1_classes2(X1)), inference(spm,[status(thm)],[c_0_91, c_0_85])).
cnf(c_0_99, negated_conjecture, (m1_subset_1(k1_tarski(k1_xboole_0),X1)|~r1_tarski(k3_tarski(esk1_0),X1)|~v1_classes2(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_92, c_0_93]), c_0_55])])).
cnf(c_0_100, plain, (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(split_conjunct,[status(thm)],[c_0_94])).
cnf(c_0_101, negated_conjecture, (k1_ens_1(esk1_0)=esk1_0|~r1_tarski(a_1_0_ens_1(esk1_0),esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95, c_0_96]), c_0_55])]), c_0_56])).
cnf(c_0_102, plain, (r1_tarski(a_1_0_ens_1(X1),X1)|v1_xboole_0(X1)|~v1_classes2(X1)), inference(spm,[status(thm)],[c_0_97, c_0_98])).
cnf(c_0_103, negated_conjecture, (m1_subset_1(k1_tarski(k1_xboole_0),k3_tarski(esk1_0))|~v1_classes2(k3_tarski(esk1_0))), inference(spm,[status(thm)],[c_0_99, c_0_67])).
cnf(c_0_104, plain, (v1_xboole_0(k1_ens_1(X1))|v1_xboole_0(X1)|~m1_subset_1(k1_tarski(k1_xboole_0),k1_ens_1(X1))|~m1_subset_1(k1_tarski(k1_xboole_0),X1)), inference(spm,[status(thm)],[c_0_100, c_0_78])).
cnf(c_0_105, negated_conjecture, (k1_ens_1(esk1_0)=esk1_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101, c_0_102]), c_0_55])]), c_0_56])).
cnf(c_0_106, negated_conjecture, (m1_subset_1(k1_tarski(k1_xboole_0),esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_103, c_0_47]), c_0_55])])).
cnf(c_0_107, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104, c_0_105]), c_0_106])]), c_0_56]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 108
# Proof object clause steps            : 62
# Proof object formula steps           : 46
# Proof object conjectures             : 17
# Proof object clause conjectures      : 14
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 28
# Proof object initial formulas used   : 19
# Proof object generating inferences   : 33
# Proof object simplifying inferences  : 20
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 19
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 32
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 32
# Processed clauses                    : 4083
# ...of these trivial                  : 17
# ...subsumed                          : 2731
# ...remaining for further processing  : 1335
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 110
# Backward-rewritten                   : 8
# Generated clauses                    : 33628
# ...of the previous two non-trivial   : 33174
# Contextual simplify-reflections      : 35
# Paramodulations                      : 33625
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 3
# 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  : 1216
#    Positive orientable unit clauses  : 15
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 7
#    Non-unit-clauses                  : 1194
# Current number of unprocessed clauses: 28965
# ...number of literals in the above   : 192468
# Current number of archived formulas  : 0
# Current number of archived clauses   : 118
# Clause-clause subsumption calls (NU) : 390350
# Rec. Clause-clause subsumption calls : 65795
# Non-unit clause-clause subsumptions  : 2441
# Unit Clause-clause subsumption calls : 1419
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 29
# BW rewrite match successes           : 9
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 798958

# -------------------------------------------------
# User time                : 273.216 s
# System time              : 5.940 s
# Total time               : 279.156 s
# Maximum resident set size: 3524 pages
