# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_____0013_C18_F1_SE_CS_SP_S0Y
# and selection function SelectMaxLComplexAvoidPosPred.
#
# Preprocessing time       : 0.023 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__t18_classes5', t57_classes2)).
fof(d1_tarski, axiom, ![X1, X2]:(X2=k1_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>X3=X1)), file('classes5/classes5__t18_classes5', d1_tarski)).
fof(t7_boole, axiom, ![X1, X2]:~((r2_tarski(X1,X2)&v1_xboole_0(X2))), file('classes5/classes5__t18_classes5', t7_boole)).
fof(t18_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(r2_hidden(X2,X1)<=>r2_tarski(k1_tarski(X2),X1))), file('classes5/classes5__t18_classes5', t18_classes5)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('classes5/classes5__t18_classes5', redefinition_r2_tarski)).
fof(d1_classes4, axiom, ![X1]:(v1_classes4(X1)<=>![X2, X3]:((r2_tarski(X2,X1)&r2_tarski(X3,X2))=>r2_tarski(X3,X1))), file('classes5/classes5__t18_classes5', d1_classes4)).
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__t18_classes5', cc2_classes4)).
fof(cc6_classes3, axiom, ![X1]:(v1_classes2(X1)=>((v1_ordinal1(X1)&v1_classes3(X1))&v3_classes3(X1))), file('classes5/classes5__t18_classes5', cc6_classes3)).
fof(c_0_8, 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_9, plain, ![X30, X31, X32, X33, X34, X35]:(((~r2_hidden(X32,X31)|X32=X30|X31!=k1_tarski(X30))&(X33!=X30|r2_hidden(X33,X31)|X31!=k1_tarski(X30)))&((~r2_hidden(esk5_2(X34,X35),X35)|esk5_2(X34,X35)!=X34|X35=k1_tarski(X34))&(r2_hidden(esk5_2(X34,X35),X35)|esk5_2(X34,X35)=X34|X35=k1_tarski(X34)))), 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_10, plain, ![X39, X40]:(v1_xboole_0(X40)|~v1_classes2(X40)|(~r2_tarski(X39,X40)|r2_tarski(k1_tarski(X39),X40))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])).
fof(c_0_11, plain, ![X41, X42]:(~r2_tarski(X41,X42)|~v1_xboole_0(X42)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])).
fof(c_0_12, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(r2_hidden(X2,X1)<=>r2_tarski(k1_tarski(X2),X1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t18_classes5])])).
fof(c_0_13, plain, ![X37, X38]:((~r2_tarski(X37,X38)|r2_hidden(X37,X38))&(~r2_hidden(X37,X38)|r2_tarski(X37,X38))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_14, plain, (r2_hidden(X1,X3)|X1!=X2|X3!=k1_tarski(X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_15, 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_10])).
cnf(c_0_16, plain, (~r2_tarski(X1,X2)|~v1_xboole_0(X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_17, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&((~r2_hidden(esk2_0,esk1_0)|~r2_tarski(k1_tarski(esk2_0),esk1_0))&(r2_hidden(esk2_0,esk1_0)|r2_tarski(k1_tarski(esk2_0),esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])).
fof(c_0_18, plain, ![X24, X25, X26, X27]:((~v1_classes4(X24)|(~r2_tarski(X25,X24)|~r2_tarski(X26,X25)|r2_tarski(X26,X24)))&(((r2_tarski(esk3_1(X27),X27)|v1_classes4(X27))&(r2_tarski(esk4_1(X27),esk3_1(X27))|v1_classes4(X27)))&(~r2_tarski(esk4_1(X27),X27)|v1_classes4(X27)))), 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_classes4])])])])])])).
cnf(c_0_19, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_20, plain, (r2_hidden(X1,k1_tarski(X1))), inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_14])])).
cnf(c_0_21, plain, (r2_tarski(k1_tarski(X1),X2)|~r2_tarski(X1,X2)|~v1_classes2(X2)), inference(csr,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_22, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_23, plain, (r2_tarski(X3,X1)|~v1_classes4(X1)|~r2_tarski(X2,X1)|~r2_tarski(X3,X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_24, plain, (r2_tarski(X1,k1_tarski(X1))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_25, negated_conjecture, (~r2_hidden(esk2_0,esk1_0)|~r2_tarski(k1_tarski(esk2_0),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_26, negated_conjecture, (r2_tarski(k1_tarski(X1),esk1_0)|~r2_tarski(X1,esk1_0)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_27, plain, (r2_hidden(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_13])).
fof(c_0_28, plain, ![X22]:((((((v1_ordinal1(X22)|(~v1_ordinal1(X22)|~v1_classes3(X22)|~v3_classes3(X22)))&(v1_classes3(X22)|(~v1_ordinal1(X22)|~v1_classes3(X22)|~v3_classes3(X22))))&(v3_classes3(X22)|(~v1_ordinal1(X22)|~v1_classes3(X22)|~v3_classes3(X22))))&(v1_classes4(X22)|(~v1_ordinal1(X22)|~v1_classes3(X22)|~v3_classes3(X22))))&(v2_classes4(X22)|(~v1_ordinal1(X22)|~v1_classes3(X22)|~v3_classes3(X22))))&(v3_classes4(X22)|(~v1_ordinal1(X22)|~v1_classes3(X22)|~v3_classes3(X22)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_classes4])])])).
fof(c_0_29, plain, ![X23]:(((v1_ordinal1(X23)|~v1_classes2(X23))&(v1_classes3(X23)|~v1_classes2(X23)))&(v3_classes3(X23)|~v1_classes2(X23))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc6_classes3])])])).
cnf(c_0_30, plain, (r2_tarski(X1,X2)|~v1_classes4(X2)|~r2_tarski(k1_tarski(X1),X2)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_31, negated_conjecture, (r2_hidden(esk2_0,esk1_0)|r2_tarski(k1_tarski(esk2_0),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_32, negated_conjecture, (~r2_tarski(esk2_0,esk1_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])).
cnf(c_0_33, plain, (v1_classes4(X1)|~v1_ordinal1(X1)|~v1_classes3(X1)|~v3_classes3(X1)), inference(split_conjunct,[status(thm)],[c_0_28])).
cnf(c_0_34, plain, (v3_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
cnf(c_0_35, plain, (v1_ordinal1(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
cnf(c_0_36, plain, (v1_classes3(X1)|~v1_classes2(X1)), inference(split_conjunct,[status(thm)],[c_0_29])).
cnf(c_0_37, negated_conjecture, (r2_hidden(esk2_0,esk1_0)|~v1_classes4(esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_32])).
cnf(c_0_38, plain, (v1_classes4(X1)|~v1_classes2(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35]), c_0_36])).
cnf(c_0_39, negated_conjecture, (r2_hidden(esk2_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_22])])).
cnf(c_0_40, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_39]), c_0_32]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 41
# Proof object clause steps            : 23
# Proof object formula steps           : 18
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 8
# Proof object generating inferences   : 8
# Proof object simplifying inferences  : 10
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 25
# Removed in clause preprocessing      : 3
# Initial clauses in saturation        : 22
# Processed clauses                    : 45
# ...of these trivial                  : 0
# ...subsumed                          : 4
# ...remaining for further processing  : 41
# Other redundant clauses eliminated   : 3
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 3
# Generated clauses                    : 42
# ...of the previous two non-trivial   : 35
# Contextual simplify-reflections      : 4
# Paramodulations                      : 40
# 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  : 36
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 29
# Current number of unprocessed clauses: 11
# ...number of literals in the above   : 38
# Current number of archived formulas  : 0
# Current number of archived clauses   : 3
# Clause-clause subsumption calls (NU) : 124
# Rec. Clause-clause subsumption calls : 94
# Non-unit clause-clause subsumptions  : 6
# Unit Clause-clause subsumption calls : 18
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 1
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2025

# -------------------------------------------------
# User time                : 0.028 s
# System time              : 0.000 s
# Total time               : 0.028 s
# Maximum resident set size: 3024 pages
