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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t58_classes2, axiom, ![X1, X2, X3]:((~(v1_xboole_0(X3))&v1_classes2(X3))=>((r2_tarski(X1,X3)&r2_tarski(X2,X3))=>(r2_tarski(k2_tarski(X1,X2),X3)&r2_hidden(k4_tarski(X1,X2),X3)))), file('classes5/classes5__t13_classes5', t58_classes2)).
fof(d5_tarski, axiom, ![X1, X2]:k4_tarski(X1,X2)=k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)), file('classes5/classes5__t13_classes5', d5_tarski)).
fof(t7_boole, axiom, ![X1, X2]:~((r2_tarski(X1,X2)&v1_xboole_0(X2))), file('classes5/classes5__t13_classes5', t7_boole)).
fof(t13_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3]:(m1_subset_1(X3,X1)=>![X4]:(m1_subset_1(X4,X1)=>![X5]:(m1_subset_1(X5,X1)=>![X6]:(m1_subset_1(X6,X1)=>m1_subset_1(k1_classes5(X2,X3,X4,X5,X6),X1))))))), file('classes5/classes5__t13_classes5', t13_classes5)).
fof(d1_classes5, axiom, ![X1, X2, X3, X4, X5]:k1_classes5(X1,X2,X3,X4,X5)=k4_tarski(k6_xtuple_0(X1,X2,X3,X4),X5), file('classes5/classes5__t13_classes5', d1_classes5)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('classes5/classes5__t13_classes5', redefinition_r2_tarski)).
fof(t1_grcat_1, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3]:(m1_subset_1(X3,X1)=>![X4]:(m1_subset_1(X4,X1)=>![X5]:(m1_subset_1(X5,X1)=>(r2_hidden(k3_xtuple_0(X2,X3,X4),X1)&r2_hidden(k6_xtuple_0(X2,X3,X4,X5),X1))))))), file('classes5/classes5__t13_classes5', t1_grcat_1)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('classes5/classes5__t13_classes5', t1_subset)).
fof(t2_subset, axiom, ![X1, X2]:(m1_subset_1(X1,X2)=>(v1_xboole_0(X2)|r2_tarski(X1,X2))), file('classes5/classes5__t13_classes5', t2_subset)).
fof(c_0_9, plain, ![X1, X2, X3]:((~v1_xboole_0(X3)&v1_classes2(X3))=>((r2_tarski(X1,X3)&r2_tarski(X2,X3))=>(r2_tarski(k2_tarski(X1,X2),X3)&r2_hidden(k4_tarski(X1,X2),X3)))), inference(fof_simplification,[status(thm)],[t58_classes2])).
fof(c_0_10, plain, ![X60, X61, X62]:((r2_tarski(k2_tarski(X60,X61),X62)|(~r2_tarski(X60,X62)|~r2_tarski(X61,X62))|(v1_xboole_0(X62)|~v1_classes2(X62)))&(r2_hidden(k4_tarski(X60,X61),X62)|(~r2_tarski(X60,X62)|~r2_tarski(X61,X62))|(v1_xboole_0(X62)|~v1_classes2(X62)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
fof(c_0_11, plain, ![X47, X48]:k4_tarski(X47,X48)=k2_tarski(k2_tarski(X47,X48),k1_tarski(X47)), inference(variable_rename,[status(thm)],[d5_tarski])).
cnf(c_0_12, plain, (r2_hidden(k4_tarski(X1,X2),X3)|v1_xboole_0(X3)|~r2_tarski(X1,X3)|~r2_tarski(X2,X3)|~v1_classes2(X3)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_13, plain, (k4_tarski(X1,X2)=k2_tarski(k2_tarski(X1,X2),k1_tarski(X1))), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_14, plain, ![X63, X64]:(~r2_tarski(X63,X64)|~v1_xboole_0(X64)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])).
fof(c_0_15, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3]:(m1_subset_1(X3,X1)=>![X4]:(m1_subset_1(X4,X1)=>![X5]:(m1_subset_1(X5,X1)=>![X6]:(m1_subset_1(X6,X1)=>m1_subset_1(k1_classes5(X2,X3,X4,X5,X6),X1)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t13_classes5])])).
fof(c_0_16, plain, ![X42, X43, X44, X45, X46]:k1_classes5(X42,X43,X44,X45,X46)=k4_tarski(k6_xtuple_0(X42,X43,X44,X45),X46), inference(variable_rename,[status(thm)],[d1_classes5])).
fof(c_0_17, plain, ![X49, X50]:((~r2_tarski(X49,X50)|r2_hidden(X49,X50))&(~r2_hidden(X49,X50)|r2_tarski(X49,X50))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_18, plain, (v1_xboole_0(X3)|r2_hidden(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),X3)|~v1_classes2(X3)|~r2_tarski(X2,X3)|~r2_tarski(X1,X3)), inference(rw,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_19, plain, (~r2_tarski(X1,X2)|~v1_xboole_0(X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
fof(c_0_20, plain, ![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3]:(m1_subset_1(X3,X1)=>![X4]:(m1_subset_1(X4,X1)=>![X5]:(m1_subset_1(X5,X1)=>(r2_hidden(k3_xtuple_0(X2,X3,X4),X1)&r2_hidden(k6_xtuple_0(X2,X3,X4,X5),X1))))))), inference(fof_simplification,[status(thm)],[t1_grcat_1])).
fof(c_0_21, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&(m1_subset_1(esk2_0,esk1_0)&(m1_subset_1(esk3_0,esk1_0)&(m1_subset_1(esk4_0,esk1_0)&(m1_subset_1(esk5_0,esk1_0)&(m1_subset_1(esk6_0,esk1_0)&~m1_subset_1(k1_classes5(esk2_0,esk3_0,esk4_0,esk5_0,esk6_0),esk1_0))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])).
cnf(c_0_22, plain, (k1_classes5(X1,X2,X3,X4,X5)=k4_tarski(k6_xtuple_0(X1,X2,X3,X4),X5)), inference(split_conjunct,[status(thm)],[c_0_16])).
fof(c_0_23, plain, ![X56, X57]:(~r2_tarski(X56,X57)|m1_subset_1(X56,X57)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
cnf(c_0_24, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_25, plain, (r2_hidden(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),X3)|~r2_tarski(X2,X3)|~r2_tarski(X1,X3)|~v1_classes2(X3)), inference(csr,[status(thm)],[c_0_18, c_0_19])).
fof(c_0_26, plain, ![X58, X59]:(~m1_subset_1(X58,X59)|(v1_xboole_0(X59)|r2_tarski(X58,X59))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])).
fof(c_0_27, plain, ![X51, X52, X53, X54, X55]:((r2_hidden(k3_xtuple_0(X52,X53,X54),X51)|~m1_subset_1(X55,X51)|~m1_subset_1(X54,X51)|~m1_subset_1(X53,X51)|~m1_subset_1(X52,X51)|(v1_xboole_0(X51)|~v1_classes2(X51)))&(r2_hidden(k6_xtuple_0(X52,X53,X54,X55),X51)|~m1_subset_1(X55,X51)|~m1_subset_1(X54,X51)|~m1_subset_1(X53,X51)|~m1_subset_1(X52,X51)|(v1_xboole_0(X51)|~v1_classes2(X51)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])).
cnf(c_0_28, negated_conjecture, (~m1_subset_1(k1_classes5(esk2_0,esk3_0,esk4_0,esk5_0,esk6_0),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_29, plain, (k1_classes5(X1,X2,X3,X4,X5)=k2_tarski(k2_tarski(k6_xtuple_0(X1,X2,X3,X4),X5),k1_tarski(k6_xtuple_0(X1,X2,X3,X4)))), inference(rw,[status(thm)],[c_0_22, c_0_13])).
cnf(c_0_30, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_31, plain, (r2_tarski(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),X3)|~r2_tarski(X2,X3)|~r2_tarski(X1,X3)|~v1_classes2(X3)), inference(spm,[status(thm)],[c_0_24, c_0_25])).
cnf(c_0_32, plain, (v1_xboole_0(X2)|r2_tarski(X1,X2)|~m1_subset_1(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_33, negated_conjecture, (m1_subset_1(esk6_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_34, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_35, plain, (r2_hidden(k6_xtuple_0(X1,X2,X3,X4),X5)|v1_xboole_0(X5)|~m1_subset_1(X4,X5)|~m1_subset_1(X3,X5)|~m1_subset_1(X2,X5)|~m1_subset_1(X1,X5)|~v1_classes2(X5)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_36, negated_conjecture, (m1_subset_1(esk5_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_37, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_38, negated_conjecture, (~m1_subset_1(k2_tarski(k2_tarski(k6_xtuple_0(esk2_0,esk3_0,esk4_0,esk5_0),esk6_0),k1_tarski(k6_xtuple_0(esk2_0,esk3_0,esk4_0,esk5_0))),esk1_0)), inference(rw,[status(thm)],[c_0_28, c_0_29])).
cnf(c_0_39, plain, (m1_subset_1(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),X3)|~r2_tarski(X2,X3)|~r2_tarski(X1,X3)|~v1_classes2(X3)), inference(spm,[status(thm)],[c_0_30, c_0_31])).
cnf(c_0_40, negated_conjecture, (r2_tarski(esk6_0,esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34])).
cnf(c_0_41, negated_conjecture, (r2_hidden(k6_xtuple_0(X1,X2,X3,esk5_0),esk1_0)|~m1_subset_1(X3,esk1_0)|~m1_subset_1(X2,esk1_0)|~m1_subset_1(X1,esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_36]), c_0_37])]), c_0_34])).
cnf(c_0_42, negated_conjecture, (~r2_tarski(k6_xtuple_0(esk2_0,esk3_0,esk4_0,esk5_0),esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_40]), c_0_37])])).
cnf(c_0_43, negated_conjecture, (r2_tarski(k6_xtuple_0(X1,X2,X3,esk5_0),esk1_0)|~m1_subset_1(X3,esk1_0)|~m1_subset_1(X2,esk1_0)|~m1_subset_1(X1,esk1_0)), inference(spm,[status(thm)],[c_0_24, c_0_41])).
cnf(c_0_44, negated_conjecture, (m1_subset_1(esk4_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_45, negated_conjecture, (m1_subset_1(esk3_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_46, negated_conjecture, (m1_subset_1(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_47, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_43]), c_0_44]), c_0_45]), c_0_46])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 48
# Proof object clause steps            : 27
# Proof object formula steps           : 21
# Proof object conjectures             : 17
# Proof object clause conjectures      : 14
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 16
# Proof object initial formulas used   : 9
# Proof object generating inferences   : 7
# Proof object simplifying inferences  : 15
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 9
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 19
# Removed in clause preprocessing      : 2
# Initial clauses in saturation        : 17
# Processed clauses                    : 62
# ...of these trivial                  : 0
# ...subsumed                          : 10
# ...remaining for further processing  : 52
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 52
# ...of the previous two non-trivial   : 45
# Contextual simplify-reflections      : 2
# Paramodulations                      : 52
# 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  : 35
#    Positive orientable unit clauses  : 11
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 21
# Current number of unprocessed clauses: 15
# ...number of literals in the above   : 82
# Current number of archived formulas  : 0
# Current number of archived clauses   : 19
# Clause-clause subsumption calls (NU) : 245
# Rec. Clause-clause subsumption calls : 100
# Non-unit clause-clause subsumptions  : 6
# Unit Clause-clause subsumption calls : 1
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 0
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2402

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.002 s
# Total time               : 0.023 s
# Maximum resident set size: 3660 pages
