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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
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__t83_classes5', d1_classes5)).
fof(d5_tarski, axiom, ![X1, X2]:k4_tarski(X1,X2)=k2_tarski(k2_tarski(X1,X2),k1_tarski(X1)), file('classes5/classes5__t83_classes5', d5_tarski)).
fof(fc3_xboole_0, axiom, ![X1, X2]:~(v1_xboole_0(k2_tarski(X1,X2))), file('classes5/classes5__t83_classes5', fc3_xboole_0)).
fof(d2_classes5, axiom, ![X1]:(v1_classes5(X1)<=>?[X2, X3, X4, X5, X6]:X1=k1_classes5(X2,X3,X4,X5,X6)), file('classes5/classes5__t83_classes5', d2_classes5)).
fof(t83_classes5, conjecture, ![X1]:((((v1_classes5(X1)&v10_classes5(X1))&v11_classes5(X1))&v12_classes5(X1))=>~(v1_xboole_0(X1))), file('classes5/classes5__t83_classes5', t83_classes5)).
fof(c_0_5, plain, ![X24, X25, X26, X27, X28]:k1_classes5(X24,X25,X26,X27,X28)=k4_tarski(k6_xtuple_0(X24,X25,X26,X27),X28), inference(variable_rename,[status(thm)],[d1_classes5])).
fof(c_0_6, plain, ![X41, X42]:k4_tarski(X41,X42)=k2_tarski(k2_tarski(X41,X42),k1_tarski(X41)), inference(variable_rename,[status(thm)],[d5_tarski])).
fof(c_0_7, plain, ![X1, X2]:~v1_xboole_0(k2_tarski(X1,X2)), inference(fof_simplification,[status(thm)],[fc3_xboole_0])).
fof(c_0_8, plain, ![X29, X35, X36, X37, X38, X39, X40]:((~v1_classes5(X29)|X29=k1_classes5(esk2_1(X29),esk3_1(X29),esk4_1(X29),esk5_1(X29),esk6_1(X29)))&(X35!=k1_classes5(X36,X37,X38,X39,X40)|v1_classes5(X35))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_classes5])])])])])).
cnf(c_0_9, 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_5])).
cnf(c_0_10, 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_11, plain, ![X43, X44]:~v1_xboole_0(k2_tarski(X43,X44)), inference(variable_rename,[status(thm)],[c_0_7])).
cnf(c_0_12, plain, (X1=k1_classes5(esk2_1(X1),esk3_1(X1),esk4_1(X1),esk5_1(X1),esk6_1(X1))|~v1_classes5(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, 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_9, c_0_10])).
fof(c_0_14, negated_conjecture, ~(![X1]:((((v1_classes5(X1)&v10_classes5(X1))&v11_classes5(X1))&v12_classes5(X1))=>~v1_xboole_0(X1))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t83_classes5])])).
cnf(c_0_15, plain, (~v1_xboole_0(k2_tarski(X1,X2))), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_16, plain, (X1=k2_tarski(k2_tarski(k6_xtuple_0(esk2_1(X1),esk3_1(X1),esk4_1(X1),esk5_1(X1)),esk6_1(X1)),k1_tarski(k6_xtuple_0(esk2_1(X1),esk3_1(X1),esk4_1(X1),esk5_1(X1))))|~v1_classes5(X1)), inference(rw,[status(thm)],[c_0_12, c_0_13])).
fof(c_0_17, negated_conjecture, ((((v1_classes5(esk1_0)&v10_classes5(esk1_0))&v11_classes5(esk1_0))&v12_classes5(esk1_0))&v1_xboole_0(esk1_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])).
cnf(c_0_18, plain, (~v1_xboole_0(X1)|~v1_classes5(X1)), inference(spm,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_19, negated_conjecture, (v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_20, negated_conjecture, (v1_classes5(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_21, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 22
# Proof object clause steps            : 10
# Proof object formula steps           : 12
# Proof object conjectures             : 6
# Proof object clause conjectures      : 3
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 6
# Proof object initial formulas used   : 5
# Proof object generating inferences   : 2
# Proof object simplifying inferences  : 4
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 5
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 10
# Removed in clause preprocessing      : 2
# Initial clauses in saturation        : 8
# Processed clauses                    : 18
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 18
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 4
# ...of the previous two non-trivial   : 2
# Contextual simplify-reflections      : 0
# Paramodulations                      : 3
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# 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  : 9
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 2
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 10
# Clause-clause subsumption calls (NU) : 0
# Rec. Clause-clause subsumption calls : 0
# Non-unit clause-clause subsumptions  : 0
# Unit Clause-clause subsumption calls : 0
# 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          : 644

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.000 s
# Total time               : 0.021 s
# Maximum resident set size: 3084 pages
