# 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.015 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__t11_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__t11_classes5', d5_tarski)).
fof(t11_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3, X4, X5]:(X2=k3_xtuple_0(X3,X4,X5)=>((m1_subset_1(X3,X1)&m1_subset_1(X4,X1))&m1_subset_1(X5,X1))))), file('classes5/classes5__t11_classes5', t11_classes5)).
fof(d4_xtuple_0, axiom, ![X1, X2, X3]:k3_xtuple_0(X1,X2,X3)=k4_tarski(k4_tarski(X1,X2),X3), file('classes5/classes5__t11_classes5', d4_xtuple_0)).
fof(c_0_4, 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_5, plain, ![X30, X31, X32, X33]:((m1_subset_1(X32,X30)|X31!=k4_tarski(X32,X33)|~m1_subset_1(X31,X30)|(v1_xboole_0(X30)|~v1_classes2(X30)))&(m1_subset_1(X33,X30)|X31!=k4_tarski(X32,X33)|~m1_subset_1(X31,X30)|(v1_xboole_0(X30)|~v1_classes2(X30)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])).
fof(c_0_6, plain, ![X28, X29]:k4_tarski(X28,X29)=k2_tarski(k2_tarski(X28,X29),k1_tarski(X28)), inference(variable_rename,[status(thm)],[d5_tarski])).
cnf(c_0_7, 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_5])).
cnf(c_0_8, plain, (k4_tarski(X1,X2)=k2_tarski(k2_tarski(X1,X2),k1_tarski(X1))), inference(split_conjunct,[status(thm)],[c_0_6])).
fof(c_0_9, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2]:(m1_subset_1(X2,X1)=>![X3, X4, X5]:(X2=k3_xtuple_0(X3,X4,X5)=>((m1_subset_1(X3,X1)&m1_subset_1(X4,X1))&m1_subset_1(X5,X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t11_classes5])])).
cnf(c_0_10, 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_5])).
cnf(c_0_11, 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_7, c_0_8])).
fof(c_0_12, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&(m1_subset_1(esk2_0,esk1_0)&(esk2_0=k3_xtuple_0(esk3_0,esk4_0,esk5_0)&(~m1_subset_1(esk3_0,esk1_0)|~m1_subset_1(esk4_0,esk1_0)|~m1_subset_1(esk5_0,esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
fof(c_0_13, plain, ![X25, X26, X27]:k3_xtuple_0(X25,X26,X27)=k4_tarski(k4_tarski(X25,X26),X27), inference(variable_rename,[status(thm)],[d4_xtuple_0])).
cnf(c_0_14, 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_10, c_0_8])).
cnf(c_0_15, 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_11])).
cnf(c_0_16, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_17, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_18, negated_conjecture, (esk2_0=k3_xtuple_0(esk3_0,esk4_0,esk5_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_19, plain, (k3_xtuple_0(X1,X2,X3)=k4_tarski(k4_tarski(X1,X2),X3)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_20, 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_14])).
cnf(c_0_21, 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_15, c_0_16]), c_0_17])).
cnf(c_0_22, negated_conjecture, (esk2_0=k2_tarski(k2_tarski(k2_tarski(k2_tarski(esk3_0,esk4_0),k1_tarski(esk3_0)),esk5_0),k1_tarski(k2_tarski(k2_tarski(esk3_0,esk4_0),k1_tarski(esk3_0))))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19]), c_0_8]), c_0_8])).
cnf(c_0_23, negated_conjecture, (m1_subset_1(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_24, 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_20, c_0_16]), c_0_17])).
cnf(c_0_25, negated_conjecture, (~m1_subset_1(esk3_0,esk1_0)|~m1_subset_1(esk4_0,esk1_0)|~m1_subset_1(esk5_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_26, negated_conjecture, (m1_subset_1(esk5_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23])])).
cnf(c_0_27, negated_conjecture, (m1_subset_1(k2_tarski(k2_tarski(esk3_0,esk4_0),k1_tarski(esk3_0)),esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_22]), c_0_23])])).
cnf(c_0_28, negated_conjecture, (~m1_subset_1(esk3_0,esk1_0)|~m1_subset_1(esk4_0,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])])).
cnf(c_0_29, negated_conjecture, (m1_subset_1(esk4_0,esk1_0)), inference(spm,[status(thm)],[c_0_21, c_0_27])).
cnf(c_0_30, negated_conjecture, (m1_subset_1(esk3_0,esk1_0)), inference(spm,[status(thm)],[c_0_24, c_0_27])).
cnf(c_0_31, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_29])]), c_0_30])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 32
# Proof object clause steps            : 22
# Proof object formula steps           : 10
# Proof object conjectures             : 17
# Proof object clause conjectures      : 14
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 6
# Proof object simplifying inferences  : 19
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 9
# Removed in clause preprocessing      : 2
# Initial clauses in saturation        : 7
# Processed clauses                    : 24
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 23
# Other redundant clauses eliminated   : 2
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 2
# Generated clauses                    : 10
# ...of the previous two non-trivial   : 12
# Contextual simplify-reflections      : 0
# Paramodulations                      : 8
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 2
# 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  : 12
#    Positive orientable unit clauses  : 7
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 4
# Current number of unprocessed clauses: 2
# ...number of literals in the above   : 4
# Current number of archived formulas  : 0
# Current number of archived clauses   : 11
# Clause-clause subsumption calls (NU) : 8
# Rec. Clause-clause subsumption calls : 7
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 1
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 4
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 868

# -------------------------------------------------
# User time                : 0.016 s
# System time              : 0.002 s
# Total time               : 0.018 s
# Maximum resident set size: 3760 pages
