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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t22_classes4, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3, X4]:(X2=k4_tarski(X3,X4)=>(m1_subset_1(X3,X1)&m1_subset_1(X4,X1))))), file('classes5/classes5__t14_classes5', t22_classes4)).
fof(d5_tarski, axiom, ![X1, X2]:k4_tarski(X1,X2)=k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)), file('classes5/classes5__t14_classes5', d5_tarski)).
fof(t14_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3, X4, X5, X6, X7]:(X2=k1_classes5(X3,X4,X5,X6,X7)=>((((m1_subset_1(X3,X1)&m1_subset_1(X4,X1))&m1_subset_1(X5,X1))&m1_subset_1(X6,X1))&m1_subset_1(X7,X1))))), file('classes5/classes5__t14_classes5', t14_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__t14_classes5', d1_classes5)).
fof(t12_classes5, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3, X4, X5, X6]:(X2=k6_xtuple_0(X3,X4,X5,X6)=>(((m1_subset_1(X3,X1)&m1_subset_1(X4,X1))&m1_subset_1(X5,X1))&m1_subset_1(X6,X1))))), file('classes5/classes5__t14_classes5', t12_classes5)).
fof(c_0_5, plain, ![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3, X4]:(X2=k4_tarski(X3,X4)=>(m1_subset_1(X3,X1)&m1_subset_1(X4,X1))))), inference(fof_simplification,[status(thm)],[t22_classes4])).
fof(c_0_6, plain, ![X52, X53, X54, X55]:((m1_subset_1(X54,X52)|X53!=k4_tarski(X54,X55)|~m1_subset_1(X53,X52)|(v1_xboole_0(X52)|~v1_classes2(X52)))&(m1_subset_1(X55,X52)|X53!=k4_tarski(X54,X55)|~m1_subset_1(X53,X52)|(v1_xboole_0(X52)|~v1_classes2(X52)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
fof(c_0_7, plain, ![X44, X45]:k4_tarski(X44,X45)=k2_tarski(k2_tarski(X44,X45),k1_tarski(X44)), inference(variable_rename,[status(thm)],[d5_tarski])).
cnf(c_0_8, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|X3!=k4_tarski(X4,X1)|~m1_subset_1(X3,X2)|~v1_classes2(X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_9, plain, (k4_tarski(X1,X2)=k2_tarski(k2_tarski(X1,X2),k1_tarski(X1))), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_10, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3, X4, X5, X6, X7]:(X2=k1_classes5(X3,X4,X5,X6,X7)=>((((m1_subset_1(X3,X1)&m1_subset_1(X4,X1))&m1_subset_1(X5,X1))&m1_subset_1(X6,X1))&m1_subset_1(X7,X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t14_classes5])])).
fof(c_0_11, plain, ![X39, X40, X41, X42, X43]:k1_classes5(X39,X40,X41,X42,X43)=k4_tarski(k6_xtuple_0(X39,X40,X41,X42),X43), inference(variable_rename,[status(thm)],[d1_classes5])).
fof(c_0_12, plain, ![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3, X4, X5, X6]:(X2=k6_xtuple_0(X3,X4,X5,X6)=>(((m1_subset_1(X3,X1)&m1_subset_1(X4,X1))&m1_subset_1(X5,X1))&m1_subset_1(X6,X1))))), inference(fof_simplification,[status(thm)],[t12_classes5])).
cnf(c_0_13, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|X3!=k4_tarski(X1,X4)|~m1_subset_1(X3,X2)|~v1_classes2(X2)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_14, plain, (v1_xboole_0(X2)|m1_subset_1(X1,X2)|X3!=k2_tarski(k2_tarski(X4,X1),k1_tarski(X4))|~v1_classes2(X2)|~m1_subset_1(X3,X2)), inference(rw,[status(thm)],[c_0_8, c_0_9])).
fof(c_0_15, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&(m1_subset_1(esk2_0,esk1_0)&(esk2_0=k1_classes5(esk3_0,esk4_0,esk5_0,esk6_0,esk7_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(esk7_0,esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])).
cnf(c_0_16, 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_11])).
fof(c_0_17, plain, ![X46, X47, X48, X49, X50, X51]:((((m1_subset_1(X48,X46)|X47!=k6_xtuple_0(X48,X49,X50,X51)|~m1_subset_1(X47,X46)|(v1_xboole_0(X46)|~v1_classes2(X46)))&(m1_subset_1(X49,X46)|X47!=k6_xtuple_0(X48,X49,X50,X51)|~m1_subset_1(X47,X46)|(v1_xboole_0(X46)|~v1_classes2(X46))))&(m1_subset_1(X50,X46)|X47!=k6_xtuple_0(X48,X49,X50,X51)|~m1_subset_1(X47,X46)|(v1_xboole_0(X46)|~v1_classes2(X46))))&(m1_subset_1(X51,X46)|X47!=k6_xtuple_0(X48,X49,X50,X51)|~m1_subset_1(X47,X46)|(v1_xboole_0(X46)|~v1_classes2(X46)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])).
cnf(c_0_18, plain, (v1_xboole_0(X2)|m1_subset_1(X1,X2)|X3!=k2_tarski(k2_tarski(X1,X4),k1_tarski(X1))|~v1_classes2(X2)|~m1_subset_1(X3,X2)), inference(rw,[status(thm)],[c_0_13, c_0_9])).
cnf(c_0_19, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(k2_tarski(k2_tarski(X3,X1),k1_tarski(X3)),X2)|~v1_classes2(X2)), inference(er,[status(thm)],[c_0_14])).
cnf(c_0_20, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_21, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_22, negated_conjecture, (esk2_0=k1_classes5(esk3_0,esk4_0,esk5_0,esk6_0,esk7_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_23, 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_16, c_0_9])).
cnf(c_0_24, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|X3!=k6_xtuple_0(X4,X5,X6,X1)|~m1_subset_1(X3,X2)|~v1_classes2(X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_25, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(k2_tarski(k2_tarski(X1,X3),k1_tarski(X1)),X2)|~v1_classes2(X2)), inference(er,[status(thm)],[c_0_18])).
cnf(c_0_26, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|X3!=k6_xtuple_0(X1,X4,X5,X6)|~m1_subset_1(X3,X2)|~v1_classes2(X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_27, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|X3!=k6_xtuple_0(X4,X1,X5,X6)|~m1_subset_1(X3,X2)|~v1_classes2(X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_28, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|X3!=k6_xtuple_0(X4,X5,X1,X6)|~m1_subset_1(X3,X2)|~v1_classes2(X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_29, negated_conjecture, (m1_subset_1(X1,esk1_0)|~m1_subset_1(k2_tarski(k2_tarski(X2,X1),k1_tarski(X2)),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])).
cnf(c_0_30, negated_conjecture, (esk2_0=k2_tarski(k2_tarski(k6_xtuple_0(esk3_0,esk4_0,esk5_0,esk6_0),esk7_0),k1_tarski(k6_xtuple_0(esk3_0,esk4_0,esk5_0,esk6_0)))), inference(rw,[status(thm)],[c_0_22, c_0_23])).
cnf(c_0_31, negated_conjecture, (m1_subset_1(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_32, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(k6_xtuple_0(X3,X4,X5,X1),X2)|~v1_classes2(X2)), inference(er,[status(thm)],[c_0_24])).
cnf(c_0_33, negated_conjecture, (m1_subset_1(X1,esk1_0)|~m1_subset_1(k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_20]), c_0_21])).
cnf(c_0_34, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(k6_xtuple_0(X1,X3,X4,X5),X2)|~v1_classes2(X2)), inference(er,[status(thm)],[c_0_26])).
cnf(c_0_35, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(k6_xtuple_0(X3,X1,X4,X5),X2)|~v1_classes2(X2)), inference(er,[status(thm)],[c_0_27])).
cnf(c_0_36, plain, (m1_subset_1(X1,X2)|v1_xboole_0(X2)|~m1_subset_1(k6_xtuple_0(X3,X4,X1,X5),X2)|~v1_classes2(X2)), inference(er,[status(thm)],[c_0_28])).
cnf(c_0_37, negated_conjecture, (~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(esk7_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_38, negated_conjecture, (m1_subset_1(esk7_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_31])])).
cnf(c_0_39, negated_conjecture, (m1_subset_1(X1,esk1_0)|~m1_subset_1(k6_xtuple_0(X2,X3,X4,X1),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_20]), c_0_21])).
cnf(c_0_40, negated_conjecture, (m1_subset_1(k6_xtuple_0(esk3_0,esk4_0,esk5_0,esk6_0),esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_30]), c_0_31])])).
cnf(c_0_41, negated_conjecture, (m1_subset_1(X1,esk1_0)|~m1_subset_1(k6_xtuple_0(X1,X2,X3,X4),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_20]), c_0_21])).
cnf(c_0_42, negated_conjecture, (m1_subset_1(X1,esk1_0)|~m1_subset_1(k6_xtuple_0(X2,X1,X3,X4),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_20]), c_0_21])).
cnf(c_0_43, negated_conjecture, (m1_subset_1(X1,esk1_0)|~m1_subset_1(k6_xtuple_0(X2,X3,X1,X4),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_20]), c_0_21])).
cnf(c_0_44, negated_conjecture, (~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)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37, c_0_38])])).
cnf(c_0_45, negated_conjecture, (m1_subset_1(esk6_0,esk1_0)), inference(spm,[status(thm)],[c_0_39, c_0_40])).
cnf(c_0_46, negated_conjecture, (m1_subset_1(esk3_0,esk1_0)), inference(spm,[status(thm)],[c_0_41, c_0_40])).
cnf(c_0_47, negated_conjecture, (m1_subset_1(esk4_0,esk1_0)), inference(spm,[status(thm)],[c_0_42, c_0_40])).
cnf(c_0_48, negated_conjecture, (m1_subset_1(esk5_0,esk1_0)), inference(spm,[status(thm)],[c_0_43, c_0_40])).
cnf(c_0_49, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44, c_0_45])]), c_0_46]), c_0_47]), c_0_48])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 50
# Proof object clause steps            : 37
# Proof object formula steps           : 13
# Proof object conjectures             : 23
# Proof object clause conjectures      : 20
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 12
# Proof object simplifying inferences  : 28
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 13
# Removed in clause preprocessing      : 2
# Initial clauses in saturation        : 11
# Processed clauses                    : 44
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 43
# Other redundant clauses eliminated   : 6
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 2
# Generated clauses                    : 20
# ...of the previous two non-trivial   : 22
# Contextual simplify-reflections      : 0
# Paramodulations                      : 14
# 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  : 24
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 14
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 15
# Clause-clause subsumption calls (NU) : 62
# Rec. Clause-clause subsumption calls : 55
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 11
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 2
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1530

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.009 s
# Total time               : 0.025 s
# Maximum resident set size: 3664 pages
