# 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(t17_classes5, conjecture, (((r1_tarski(k3_tarski(k1_tarski(k4_ordinal1)),k13_classes2)&~(r2_tarski(k3_tarski(k1_tarski(k4_ordinal1)),k13_classes2)))&~(r1_tarski(k1_tarski(k4_ordinal1),k13_classes2)))&~(r2_tarski(k1_tarski(k4_ordinal1),k13_classes2))), file('classes5/classes5__t17_classes5', t17_classes5)).
fof(t17_classes4, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>r1_tarski(k4_ordinal1,X1)), file('classes5/classes5__t17_classes5', t17_classes4)).
fof(rd1_zfmisc_1, axiom, ![X1]:k3_tarski(k1_tarski(X1))=X1, file('classes5/classes5__t17_classes5', rd1_zfmisc_1)).
fof(dt_k13_classes2, axiom, (~(v1_xboole_0(k13_classes2))&v1_classes2(k13_classes2)), file('classes5/classes5__t17_classes5', dt_k13_classes2)).
fof(cc2_neckla_2, axiom, ![X1]:(m1_subset_1(X1,k13_classes2)=>v1_finset_1(X1)), file('classes5/classes5__t17_classes5', cc2_neckla_2)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('classes5/classes5__t17_classes5', t1_subset)).
fof(fc9_card_1, axiom, ~(v1_finset_1(k4_ordinal1)), file('classes5/classes5__t17_classes5', fc9_card_1)).
fof(d1_tarski, axiom, ![X1, X2]:(X2=k1_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>X3=X1)), file('classes5/classes5__t17_classes5', d1_tarski)).
fof(d3_tarski, axiom, ![X1, X2]:(r1_tarski(X1,X2)<=>![X3]:(r2_hidden(X3,X1)=>r2_hidden(X3,X2))), file('classes5/classes5__t17_classes5', d3_tarski)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('classes5/classes5__t17_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__t17_classes5', t81_classes4)).
fof(cc6_classes3, axiom, ![X1]:(v1_classes2(X1)=>((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))), file('classes5/classes5__t17_classes5', cc6_classes3)).
fof(d4_tarski, axiom, ![X1, X2]:(X2=k3_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>?[X4]:(r2_hidden(X3,X4)&r2_hidden(X4,X1)))), file('classes5/classes5__t17_classes5', d4_tarski)).
fof(c_0_13, negated_conjecture, ~((((r1_tarski(k3_tarski(k1_tarski(k4_ordinal1)),k13_classes2)&~r2_tarski(k3_tarski(k1_tarski(k4_ordinal1)),k13_classes2))&~r1_tarski(k1_tarski(k4_ordinal1),k13_classes2))&~r2_tarski(k1_tarski(k4_ordinal1),k13_classes2))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t17_classes5])])).
fof(c_0_14, plain, ![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>r1_tarski(k4_ordinal1,X1)), inference(fof_simplification,[status(thm)],[t17_classes4])).
fof(c_0_15, negated_conjecture, (~r1_tarski(k3_tarski(k1_tarski(k4_ordinal1)),k13_classes2)|r2_tarski(k3_tarski(k1_tarski(k4_ordinal1)),k13_classes2)|r1_tarski(k1_tarski(k4_ordinal1),k13_classes2)|r2_tarski(k1_tarski(k4_ordinal1),k13_classes2)), inference(fof_nnf,[status(thm)],[c_0_13])).
fof(c_0_16, plain, ![X50]:k3_tarski(k1_tarski(X50))=X50, inference(variable_rename,[status(thm)],[rd1_zfmisc_1])).
fof(c_0_17, plain, ![X53]:(v1_xboole_0(X53)|~v1_classes2(X53)|r1_tarski(k4_ordinal1,X53)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])).
fof(c_0_18, plain, (~v1_xboole_0(k13_classes2)&v1_classes2(k13_classes2)), inference(fof_simplification,[status(thm)],[dt_k13_classes2])).
fof(c_0_19, plain, ![X24]:(~m1_subset_1(X24,k13_classes2)|v1_finset_1(X24)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_neckla_2])])).
fof(c_0_20, plain, ![X54, X55]:(~r2_tarski(X54,X55)|m1_subset_1(X54,X55)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
cnf(c_0_21, negated_conjecture, (r2_tarski(k3_tarski(k1_tarski(k4_ordinal1)),k13_classes2)|r1_tarski(k1_tarski(k4_ordinal1),k13_classes2)|r2_tarski(k1_tarski(k4_ordinal1),k13_classes2)|~r1_tarski(k3_tarski(k1_tarski(k4_ordinal1)),k13_classes2)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_22, plain, (k3_tarski(k1_tarski(X1))=X1), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_23, plain, (v1_xboole_0(X1)|r1_tarski(k4_ordinal1,X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_24, plain, (v1_classes2(k13_classes2)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_25, plain, (~v1_xboole_0(k13_classes2)), inference(split_conjunct,[status(thm)],[c_0_18])).
fof(c_0_26, plain, ~v1_finset_1(k4_ordinal1), inference(fof_simplification,[status(thm)],[fc9_card_1])).
cnf(c_0_27, plain, (v1_finset_1(X1)|~m1_subset_1(X1,k13_classes2)), inference(split_conjunct,[status(thm)],[c_0_19])).
cnf(c_0_28, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
fof(c_0_29, plain, ![X26, X27, X28, X29, X30, X31]:(((~r2_hidden(X28,X27)|X28=X26|X27!=k1_tarski(X26))&(X29!=X26|r2_hidden(X29,X27)|X27!=k1_tarski(X26)))&((~r2_hidden(esk1_2(X30,X31),X31)|esk1_2(X30,X31)!=X30|X31=k1_tarski(X30))&(r2_hidden(esk1_2(X30,X31),X31)|esk1_2(X30,X31)=X30|X31=k1_tarski(X30)))), 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])])])])])])).
cnf(c_0_30, negated_conjecture, (r2_tarski(k1_tarski(k4_ordinal1),k13_classes2)|r2_tarski(k4_ordinal1,k13_classes2)|r1_tarski(k1_tarski(k4_ordinal1),k13_classes2)|~r1_tarski(k4_ordinal1,k13_classes2)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_22]), c_0_22])).
cnf(c_0_31, plain, (r1_tarski(k4_ordinal1,k13_classes2)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])).
cnf(c_0_32, plain, (~v1_finset_1(k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_33, plain, (v1_finset_1(X1)|~r2_tarski(X1,k13_classes2)), inference(spm,[status(thm)],[c_0_27, c_0_28])).
fof(c_0_34, plain, ![X33, X34, X35, X36, X37]:((~r1_tarski(X33,X34)|(~r2_hidden(X35,X33)|r2_hidden(X35,X34)))&((r2_hidden(esk2_2(X36,X37),X36)|r1_tarski(X36,X37))&(~r2_hidden(esk2_2(X36,X37),X37)|r1_tarski(X36,X37)))), 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_35, plain, (r2_hidden(X1,X3)|X1!=X2|X3!=k1_tarski(X2)), inference(split_conjunct,[status(thm)],[c_0_29])).
fof(c_0_36, plain, ![X51, X52]:((~r2_tarski(X51,X52)|r2_hidden(X51,X52))&(~r2_hidden(X51,X52)|r2_tarski(X51,X52))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_37, negated_conjecture, (r2_tarski(k1_tarski(k4_ordinal1),k13_classes2)|r2_tarski(k4_ordinal1,k13_classes2)|r1_tarski(k1_tarski(k4_ordinal1),k13_classes2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_31])])).
cnf(c_0_38, plain, (~r2_tarski(k4_ordinal1,k13_classes2)), inference(spm,[status(thm)],[c_0_32, c_0_33])).
fof(c_0_39, plain, ![X56]:(~v1_ordinal1(X56)|~v1_classes3(X56)|~v3_classes3(X56)|k3_tarski(X56)=X56), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t81_classes4])])).
fof(c_0_40, plain, ![X25]:(((v1_ordinal1(X25)|~v1_classes2(X25))&(v1_classes3(X25)|~v1_classes2(X25)))&(v3_classes3(X25)|~v1_classes2(X25))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc6_classes3])])])).
fof(c_0_41, plain, ![X39, X40, X41, X43, X44, X45, X46, X48]:((((r2_hidden(X41,esk3_3(X39,X40,X41))|~r2_hidden(X41,X40)|X40!=k3_tarski(X39))&(r2_hidden(esk3_3(X39,X40,X41),X39)|~r2_hidden(X41,X40)|X40!=k3_tarski(X39)))&(~r2_hidden(X43,X44)|~r2_hidden(X44,X39)|r2_hidden(X43,X40)|X40!=k3_tarski(X39)))&((~r2_hidden(esk4_2(X45,X46),X46)|(~r2_hidden(esk4_2(X45,X46),X48)|~r2_hidden(X48,X45))|X46=k3_tarski(X45))&((r2_hidden(esk4_2(X45,X46),esk5_2(X45,X46))|r2_hidden(esk4_2(X45,X46),X46)|X46=k3_tarski(X45))&(r2_hidden(esk5_2(X45,X46),X45)|r2_hidden(esk4_2(X45,X46),X46)|X46=k3_tarski(X45))))), 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)],[d4_tarski])])])])])])).
cnf(c_0_42, plain, (r2_hidden(X3,X2)|~r1_tarski(X1,X2)|~r2_hidden(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_34])).
cnf(c_0_43, plain, (r2_hidden(X1,k1_tarski(X1))), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_35])])).
cnf(c_0_44, plain, (r2_hidden(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_45, negated_conjecture, (r2_tarski(k1_tarski(k4_ordinal1),k13_classes2)|r1_tarski(k1_tarski(k4_ordinal1),k13_classes2)), inference(sr,[status(thm)],[c_0_37, c_0_38])).
cnf(c_0_46, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_47, plain, (k3_tarski(X1)=X1|~v1_ordinal1(X1)|~v1_classes3(X1)|~v3_classes3(X1)), inference(split_conjunct,[status(thm)],[c_0_39])).
cnf(c_0_48, plain, (v3_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_40])).
cnf(c_0_49, plain, (v1_ordinal1(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_40])).
cnf(c_0_50, plain, (v1_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_40])).
cnf(c_0_51, plain, (r2_hidden(X1,X4)|~r2_hidden(X1,X2)|~r2_hidden(X2,X3)|X4!=k3_tarski(X3)), inference(split_conjunct,[status(thm)],[c_0_41])).
cnf(c_0_52, plain, (r2_hidden(X1,X2)|~r1_tarski(k1_tarski(X1),X2)), inference(spm,[status(thm)],[c_0_42, c_0_43])).
cnf(c_0_53, negated_conjecture, (r2_hidden(k1_tarski(k4_ordinal1),k13_classes2)|r1_tarski(k1_tarski(k4_ordinal1),k13_classes2)), inference(spm,[status(thm)],[c_0_44, c_0_45])).
cnf(c_0_54, plain, (~r2_hidden(k4_ordinal1,k13_classes2)), inference(spm,[status(thm)],[c_0_38, c_0_46])).
cnf(c_0_55, plain, (k3_tarski(X1)=X1|~v1_classes2(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_49]), c_0_50])).
cnf(c_0_56, plain, (r2_hidden(X1,k3_tarski(X2))|~r2_hidden(X3,X2)|~r2_hidden(X1,X3)), inference(er,[status(thm)],[c_0_51])).
cnf(c_0_57, negated_conjecture, (r2_hidden(k1_tarski(k4_ordinal1),k13_classes2)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_53]), c_0_54])).
cnf(c_0_58, plain, (k3_tarski(k13_classes2)=k13_classes2), inference(spm,[status(thm)],[c_0_55, c_0_24])).
cnf(c_0_59, negated_conjecture, (r2_hidden(X1,k13_classes2)|~r2_hidden(X1,k1_tarski(k4_ordinal1))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_57]), c_0_58])).
cnf(c_0_60, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59, c_0_43]), c_0_54]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 61
# Proof object clause steps            : 33
# Proof object formula steps           : 28
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 17
# Proof object initial formulas used   : 13
# Proof object generating inferences   : 11
# Proof object simplifying inferences  : 14
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 13
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 27
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 27
# Processed clauses                    : 67
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 67
# Other redundant clauses eliminated   : 6
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 3
# Generated clauses                    : 26
# ...of the previous two non-trivial   : 25
# Contextual simplify-reflections      : 2
# Paramodulations                      : 20
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 6
# 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  : 31
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 4
#    Non-unit-clauses                  : 21
# Current number of unprocessed clauses: 10
# ...number of literals in the above   : 26
# Current number of archived formulas  : 0
# Current number of archived clauses   : 31
# Clause-clause subsumption calls (NU) : 311
# Rec. Clause-clause subsumption calls : 283
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 1
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 3
# BW rewrite match successes           : 3
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2192

# -------------------------------------------------
# User time                : 0.025 s
# System time              : 0.003 s
# Total time               : 0.028 s
# Maximum resident set size: 3500 pages
