# 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.023 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t13_classes4, axiom, ![X1]:((v1_classes4(X1)&v3_classes4(X1))=>((![X2, X3]:(m1_subset_1(X3,k1_zfmisc_1(X2))=>(r2_tarski(X2,X1)=>r2_tarski(X3,X1)))&![X2, X3]:((r1_tarski(X2,X3)&r2_tarski(X3,X1))=>r2_tarski(X2,X1)))&(~(v1_xboole_0(X1))=>r2_tarski(k11_arytm_3,X1)))), file('classes5/classes5__t21_classes5', t13_classes4)).
fof(t82_zfmisc_1, axiom, ![X1]:r1_tarski(X1,k1_zfmisc_1(k3_tarski(X1))), file('classes5/classes5__t21_classes5', t82_zfmisc_1)).
fof(redefinition_k9_setfam_1, axiom, ![X1]:k9_setfam_1(X1)=k1_zfmisc_1(X1), file('classes5/classes5__t21_classes5', redefinition_k9_setfam_1)).
fof(t59_classes2, axiom, ![X1, X2]:((~(v1_xboole_0(X2))&v1_classes2(X2))=>(r2_tarski(X1,X2)=>((r2_tarski(k9_setfam_1(X1),X2)&r2_tarski(k3_tarski(X1),X2))&r2_tarski(k1_setfam_1(X1),X2)))), file('classes5/classes5__t21_classes5', t59_classes2)).
fof(t21_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(r2_tarski(k3_tarski(X2),X1)=>r2_tarski(X2,X1))), file('classes5/classes5__t21_classes5', t21_classes5)).
fof(cc2_classes4, axiom, ![X1]:(((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))=>(((((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))&v1_classes4(X1))&v2_classes4(X1))&v3_classes4(X1))), file('classes5/classes5__t21_classes5', cc2_classes4)).
fof(cc6_classes3, axiom, ![X1]:(v1_classes2(X1)=>((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))), file('classes5/classes5__t21_classes5', cc6_classes3)).
fof(c_0_7, plain, ![X1]:((v1_classes4(X1)&v3_classes4(X1))=>((![X2, X3]:(m1_subset_1(X3,k1_zfmisc_1(X2))=>(r2_tarski(X2,X1)=>r2_tarski(X3,X1)))&![X2, X3]:((r1_tarski(X2,X3)&r2_tarski(X3,X1))=>r2_tarski(X2,X1)))&(~v1_xboole_0(X1)=>r2_tarski(k11_arytm_3,X1)))), inference(fof_simplification,[status(thm)],[t13_classes4])).
fof(c_0_8, plain, ![X29]:r1_tarski(X29,k1_zfmisc_1(k3_tarski(X29))), inference(variable_rename,[status(thm)],[t82_zfmisc_1])).
fof(c_0_9, plain, ![X21]:k9_setfam_1(X21)=k1_zfmisc_1(X21), inference(variable_rename,[status(thm)],[redefinition_k9_setfam_1])).
fof(c_0_10, plain, ![X1, X2]:((~v1_xboole_0(X2)&v1_classes2(X2))=>(r2_tarski(X1,X2)=>((r2_tarski(k9_setfam_1(X1),X2)&r2_tarski(k3_tarski(X1),X2))&r2_tarski(k1_setfam_1(X1),X2)))), inference(fof_simplification,[status(thm)],[t59_classes2])).
fof(c_0_11, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(r2_tarski(k3_tarski(X2),X1)=>r2_tarski(X2,X1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t21_classes5])])).
fof(c_0_12, plain, ![X22, X23, X24, X25, X26]:(((~m1_subset_1(X24,k1_zfmisc_1(X23))|(~r2_tarski(X23,X22)|r2_tarski(X24,X22))|(~v1_classes4(X22)|~v3_classes4(X22)))&(~r1_tarski(X25,X26)|~r2_tarski(X26,X22)|r2_tarski(X25,X22)|(~v1_classes4(X22)|~v3_classes4(X22))))&(v1_xboole_0(X22)|r2_tarski(k11_arytm_3,X22)|(~v1_classes4(X22)|~v3_classes4(X22)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])).
cnf(c_0_13, plain, (r1_tarski(X1,k1_zfmisc_1(k3_tarski(X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, plain, (k9_setfam_1(X1)=k1_zfmisc_1(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_15, plain, ![X27, X28]:(((r2_tarski(k9_setfam_1(X27),X28)|~r2_tarski(X27,X28)|(v1_xboole_0(X28)|~v1_classes2(X28)))&(r2_tarski(k3_tarski(X27),X28)|~r2_tarski(X27,X28)|(v1_xboole_0(X28)|~v1_classes2(X28))))&(r2_tarski(k1_setfam_1(X27),X28)|~r2_tarski(X27,X28)|(v1_xboole_0(X28)|~v1_classes2(X28)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
fof(c_0_16, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&(r2_tarski(k3_tarski(esk2_0),esk1_0)&~r2_tarski(esk2_0,esk1_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])).
cnf(c_0_17, plain, (r2_tarski(X1,X3)|~r1_tarski(X1,X2)|~r2_tarski(X2,X3)|~v1_classes4(X3)|~v3_classes4(X3)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, plain, (r1_tarski(X1,k9_setfam_1(k3_tarski(X1)))), inference(rw,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_19, plain, (r2_tarski(k9_setfam_1(X1),X2)|v1_xboole_0(X2)|~r2_tarski(X1,X2)|~v1_classes2(X2)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, negated_conjecture, (r2_tarski(k3_tarski(esk2_0),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_21, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_22, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_23, plain, (r2_tarski(X1,X2)|~v3_classes4(X2)|~v1_classes4(X2)|~r2_tarski(k9_setfam_1(k3_tarski(X1)),X2)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
cnf(c_0_24, negated_conjecture, (r2_tarski(k9_setfam_1(k3_tarski(esk2_0)),esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])]), c_0_22])).
cnf(c_0_25, negated_conjecture, (~r2_tarski(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
fof(c_0_26, plain, ![X19]:((((((v1_ordinal1(X19)|(~v1_ordinal1(X19)|~v1_classes3(X19)|~v3_classes3(X19)))&(v1_classes3(X19)|(~v1_ordinal1(X19)|~v1_classes3(X19)|~v3_classes3(X19))))&(v3_classes3(X19)|(~v1_ordinal1(X19)|~v1_classes3(X19)|~v3_classes3(X19))))&(v1_classes4(X19)|(~v1_ordinal1(X19)|~v1_classes3(X19)|~v3_classes3(X19))))&(v2_classes4(X19)|(~v1_ordinal1(X19)|~v1_classes3(X19)|~v3_classes3(X19))))&(v3_classes4(X19)|(~v1_ordinal1(X19)|~v1_classes3(X19)|~v3_classes3(X19)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_classes4])])])).
cnf(c_0_27, negated_conjecture, (~v3_classes4(esk1_0)|~v1_classes4(esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])).
cnf(c_0_28, plain, (v3_classes4(X1)|~v1_ordinal1(X1)|~v1_classes3(X1)|~v3_classes3(X1)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_29, plain, (v1_classes4(X1)|~v1_ordinal1(X1)|~v1_classes3(X1)|~v3_classes3(X1)), inference(split_conjunct,[status(thm)],[c_0_26])).
fof(c_0_30, plain, ![X20]:(((v1_ordinal1(X20)|~v1_classes2(X20))&(v1_classes3(X20)|~v1_classes2(X20)))&(v3_classes3(X20)|~v1_classes2(X20))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc6_classes3])])])).
cnf(c_0_31, negated_conjecture, (~v3_classes3(esk1_0)|~v1_classes3(esk1_0)|~v1_ordinal1(esk1_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])).
cnf(c_0_32, plain, (v3_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_33, negated_conjecture, (~v1_classes3(esk1_0)|~v1_ordinal1(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_21])])).
cnf(c_0_34, plain, (v1_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_35, negated_conjecture, (~v1_ordinal1(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_21])])).
cnf(c_0_36, plain, (v1_ordinal1(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_37, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_21])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 38
# Proof object clause steps            : 21
# Proof object formula steps           : 17
# Proof object conjectures             : 13
# Proof object clause conjectures      : 10
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 12
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 21
# Removed in clause preprocessing      : 4
# Initial clauses in saturation        : 17
# Processed clauses                    : 220
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 220
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 571
# ...of the previous two non-trivial   : 550
# Contextual simplify-reflections      : 2
# Paramodulations                      : 571
# 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  : 202
#    Positive orientable unit clauses  : 183
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 16
# Current number of unprocessed clauses: 364
# ...number of literals in the above   : 368
# Current number of archived formulas  : 0
# Current number of archived clauses   : 19
# Clause-clause subsumption calls (NU) : 120
# Rec. Clause-clause subsumption calls : 37
# Non-unit clause-clause subsumptions  : 3
# Unit Clause-clause subsumption calls : 1
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 2704
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 12320

# -------------------------------------------------
# User time                : 0.026 s
# System time              : 0.007 s
# Total time               : 0.033 s
# Maximum resident set size: 2968 pages
