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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t19_classes5, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2, X3]:((v7_ordinal1(X3)&~(v8_ordinal1(X3)))=>(m1_subset_1(k9_funct_2(k2_finseq_1(X3),k1_tarski(X2)),X1)=>m1_subset_1(X2,X1)))), file('classes5/classes5__t20_classes5', t19_classes5)).
fof(redefinition_k2_finseq_1, axiom, ![X1]:(v7_ordinal1(X1)=>k2_finseq_1(X1)=k1_finseq_1(X1)), file('classes5/classes5__t20_classes5', redefinition_k2_finseq_1)).
fof(redefinition_k9_funct_2, axiom, ![X1, X2]:(~(v1_xboole_0(X2))=>k9_funct_2(X1,X2)=k1_funct_2(X1,X2)), file('classes5/classes5__t20_classes5', redefinition_k9_funct_2)).
fof(fc2_xboole_0, axiom, ![X1]:~(v1_xboole_0(k1_tarski(X1))), file('classes5/classes5__t20_classes5', fc2_xboole_0)).
fof(t93_finseq_2, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:k4_finseq_2(X1,X2)=k1_funct_2(k1_finseq_1(X1),X2)), file('classes5/classes5__t20_classes5', t93_finseq_2)).
fof(t20_classes5, conjecture, ![X1]:((~(v1_xboole_0(X1))&v1_classes2(X1))=>![X2, X3]:((v7_ordinal1(X3)&~(v8_ordinal1(X3)))=>(m1_subset_1(k4_finseq_2(X3,k1_tarski(X2)),X1)=>m1_subset_1(X2,X1)))), file('classes5/classes5__t20_classes5', t20_classes5)).
fof(c_0_6, plain, ![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2, X3]:((v7_ordinal1(X3)&~v8_ordinal1(X3))=>(m1_subset_1(k9_funct_2(k2_finseq_1(X3),k1_tarski(X2)),X1)=>m1_subset_1(X2,X1)))), inference(fof_simplification,[status(thm)],[t19_classes5])).
fof(c_0_7, plain, ![X23, X24, X25]:(v1_xboole_0(X23)|~v1_classes2(X23)|(~v7_ordinal1(X25)|v8_ordinal1(X25)|(~m1_subset_1(k9_funct_2(k2_finseq_1(X25),k1_tarski(X24)),X23)|m1_subset_1(X24,X23)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
fof(c_0_8, plain, ![X20]:(~v7_ordinal1(X20)|k2_finseq_1(X20)=k1_finseq_1(X20)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k2_finseq_1])])).
fof(c_0_9, plain, ![X1, X2]:(~v1_xboole_0(X2)=>k9_funct_2(X1,X2)=k1_funct_2(X1,X2)), inference(fof_simplification,[status(thm)],[redefinition_k9_funct_2])).
fof(c_0_10, plain, ![X1]:~v1_xboole_0(k1_tarski(X1)), inference(fof_simplification,[status(thm)],[fc2_xboole_0])).
cnf(c_0_11, plain, (v1_xboole_0(X1)|v8_ordinal1(X2)|m1_subset_1(X3,X1)|~v1_classes2(X1)|~v7_ordinal1(X2)|~m1_subset_1(k9_funct_2(k2_finseq_1(X2),k1_tarski(X3)),X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, plain, (k2_finseq_1(X1)=k1_finseq_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
fof(c_0_13, plain, ![X21, X22]:(v1_xboole_0(X22)|k9_funct_2(X21,X22)=k1_funct_2(X21,X22)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
fof(c_0_14, plain, ![X19]:~v1_xboole_0(k1_tarski(X19)), inference(variable_rename,[status(thm)],[c_0_10])).
cnf(c_0_15, plain, (m1_subset_1(X1,X2)|v8_ordinal1(X3)|v1_xboole_0(X2)|~m1_subset_1(k9_funct_2(k1_finseq_1(X3),k1_tarski(X1)),X2)|~v7_ordinal1(X3)|~v1_classes2(X2)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_16, plain, (v1_xboole_0(X1)|k9_funct_2(X2,X1)=k1_funct_2(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_17, plain, (~v1_xboole_0(k1_tarski(X1))), inference(split_conjunct,[status(thm)],[c_0_14])).
fof(c_0_18, plain, ![X26, X27]:(~v7_ordinal1(X26)|k4_finseq_2(X26,X27)=k1_funct_2(k1_finseq_1(X26),X27)), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t93_finseq_2])])])).
fof(c_0_19, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v1_classes2(X1))=>![X2, X3]:((v7_ordinal1(X3)&~v8_ordinal1(X3))=>(m1_subset_1(k4_finseq_2(X3,k1_tarski(X2)),X1)=>m1_subset_1(X2,X1))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t20_classes5])])).
cnf(c_0_20, plain, (m1_subset_1(X1,X2)|v8_ordinal1(X3)|v1_xboole_0(X2)|~m1_subset_1(k1_funct_2(k1_finseq_1(X3),k1_tarski(X1)),X2)|~v7_ordinal1(X3)|~v1_classes2(X2)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
cnf(c_0_21, plain, (k4_finseq_2(X1,X2)=k1_funct_2(k1_finseq_1(X1),X2)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
fof(c_0_22, negated_conjecture, ((~v1_xboole_0(esk1_0)&v1_classes2(esk1_0))&((v7_ordinal1(esk3_0)&~v8_ordinal1(esk3_0))&(m1_subset_1(k4_finseq_2(esk3_0,k1_tarski(esk2_0)),esk1_0)&~m1_subset_1(esk2_0,esk1_0)))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])).
cnf(c_0_23, plain, (m1_subset_1(X1,X2)|v8_ordinal1(X3)|v1_xboole_0(X2)|~m1_subset_1(k4_finseq_2(X3,k1_tarski(X1)),X2)|~v7_ordinal1(X3)|~v1_classes2(X2)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
cnf(c_0_24, negated_conjecture, (m1_subset_1(k4_finseq_2(esk3_0,k1_tarski(esk2_0)),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_25, negated_conjecture, (v7_ordinal1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_26, negated_conjecture, (v1_classes2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_27, negated_conjecture, (~m1_subset_1(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_28, negated_conjecture, (~v8_ordinal1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_29, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_30, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25]), c_0_26])]), c_0_27]), c_0_28]), c_0_29]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 31
# Proof object clause steps            : 15
# Proof object formula steps           : 16
# Proof object conjectures             : 10
# Proof object clause conjectures      : 7
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 11
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 11
# Processed clauses                    : 26
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 26
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 6
# ...of the previous two non-trivial   : 5
# Contextual simplify-reflections      : 0
# Paramodulations                      : 6
# 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  : 15
#    Positive orientable unit clauses  : 3
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 4
#    Non-unit-clauses                  : 8
# Current number of unprocessed clauses: 1
# ...number of literals in the above   : 6
# Current number of archived formulas  : 0
# Current number of archived clauses   : 11
# Clause-clause subsumption calls (NU) : 26
# Rec. Clause-clause subsumption calls : 2
# 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          : 1033

# -------------------------------------------------
# User time                : 0.021 s
# System time              : 0.004 s
# Total time               : 0.025 s
# Maximum resident set size: 2888 pages
