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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(d18_polnot_1, axiom, ![X1]:(((~(v1_xboole_0(X1))&v4_finseq_1(X1))&v3_polnot_1(X1))=>![X2]:(((v1_funct_1(X2)&v1_funct_2(X2,X1,k4_ordinal1))&m1_subset_1(X2,k1_zfmisc_1(k2_zfmisc_1(X1,k4_ordinal1))))=>(m1_polnot_1(X2,X1)<=>?[X3]:(r2_hidden(X3,X1)&k1_funct_1(X2,X3)=k5_ordinal1)))), file('polnot_2/polnot_2__l14_polnot_2', d18_polnot_1)).
fof(dt_m1_polnot_1, axiom, ![X1]:(((~(v1_xboole_0(X1))&v4_finseq_1(X1))&v3_polnot_1(X1))=>![X2]:(m1_polnot_1(X2,X1)=>((v1_funct_1(X2)&v1_funct_2(X2,X1,k4_ordinal1))&m1_subset_1(X2,k1_zfmisc_1(k2_zfmisc_1(X1,k4_ordinal1)))))), file('polnot_2/polnot_2__l14_polnot_2', dt_m1_polnot_1)).
fof(l14_polnot_2, conjecture, ![X1]:(((~(v1_xboole_0(X1))&v4_finseq_1(X1))&v3_polnot_1(X1))=>![X2]:(m1_polnot_1(X2,X1)=>![X3]:((v1_zfmisc_1(X1)&r2_hidden(X3,X1))=>k1_funct_1(X2,X3)=k5_ordinal1))), file('polnot_2/polnot_2__l14_polnot_2', l14_polnot_2)).
fof(d10_zfmisc_1, axiom, ![X1]:(v1_zfmisc_1(X1)<=>![X2, X3]:((r2_hidden(X2,X1)&r2_hidden(X3,X1))=>X2=X3)), file('polnot_2/polnot_2__l14_polnot_2', d10_zfmisc_1)).
fof(c_0_4, plain, ![X1]:(((~v1_xboole_0(X1)&v4_finseq_1(X1))&v3_polnot_1(X1))=>![X2]:(((v1_funct_1(X2)&v1_funct_2(X2,X1,k4_ordinal1))&m1_subset_1(X2,k1_zfmisc_1(k2_zfmisc_1(X1,k4_ordinal1))))=>(m1_polnot_1(X2,X1)<=>?[X3]:(r2_hidden(X3,X1)&k1_funct_1(X2,X3)=k5_ordinal1)))), inference(fof_simplification,[status(thm)],[d18_polnot_1])).
fof(c_0_5, plain, ![X1]:(((~v1_xboole_0(X1)&v4_finseq_1(X1))&v3_polnot_1(X1))=>![X2]:(m1_polnot_1(X2,X1)=>((v1_funct_1(X2)&v1_funct_2(X2,X1,k4_ordinal1))&m1_subset_1(X2,k1_zfmisc_1(k2_zfmisc_1(X1,k4_ordinal1)))))), inference(fof_simplification,[status(thm)],[dt_m1_polnot_1])).
fof(c_0_6, negated_conjecture, ~(![X1]:(((~v1_xboole_0(X1)&v4_finseq_1(X1))&v3_polnot_1(X1))=>![X2]:(m1_polnot_1(X2,X1)=>![X3]:((v1_zfmisc_1(X1)&r2_hidden(X3,X1))=>k1_funct_1(X2,X3)=k5_ordinal1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l14_polnot_2])])).
fof(c_0_7, plain, ![X24, X25, X27]:(((r2_hidden(esk6_2(X24,X25),X24)|~m1_polnot_1(X25,X24)|(~v1_funct_1(X25)|~v1_funct_2(X25,X24,k4_ordinal1)|~m1_subset_1(X25,k1_zfmisc_1(k2_zfmisc_1(X24,k4_ordinal1))))|(v1_xboole_0(X24)|~v4_finseq_1(X24)|~v3_polnot_1(X24)))&(k1_funct_1(X25,esk6_2(X24,X25))=k5_ordinal1|~m1_polnot_1(X25,X24)|(~v1_funct_1(X25)|~v1_funct_2(X25,X24,k4_ordinal1)|~m1_subset_1(X25,k1_zfmisc_1(k2_zfmisc_1(X24,k4_ordinal1))))|(v1_xboole_0(X24)|~v4_finseq_1(X24)|~v3_polnot_1(X24))))&(~r2_hidden(X27,X24)|k1_funct_1(X25,X27)!=k5_ordinal1|m1_polnot_1(X25,X24)|(~v1_funct_1(X25)|~v1_funct_2(X25,X24,k4_ordinal1)|~m1_subset_1(X25,k1_zfmisc_1(k2_zfmisc_1(X24,k4_ordinal1))))|(v1_xboole_0(X24)|~v4_finseq_1(X24)|~v3_polnot_1(X24)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])).
fof(c_0_8, plain, ![X28, X29]:(((v1_funct_1(X29)|~m1_polnot_1(X29,X28)|(v1_xboole_0(X28)|~v4_finseq_1(X28)|~v3_polnot_1(X28)))&(v1_funct_2(X29,X28,k4_ordinal1)|~m1_polnot_1(X29,X28)|(v1_xboole_0(X28)|~v4_finseq_1(X28)|~v3_polnot_1(X28))))&(m1_subset_1(X29,k1_zfmisc_1(k2_zfmisc_1(X28,k4_ordinal1)))|~m1_polnot_1(X29,X28)|(v1_xboole_0(X28)|~v4_finseq_1(X28)|~v3_polnot_1(X28)))), 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_9, plain, ![X18, X19, X20, X21]:((~v1_zfmisc_1(X18)|(~r2_hidden(X19,X18)|~r2_hidden(X20,X18)|X19=X20))&(((r2_hidden(esk4_1(X21),X21)|v1_zfmisc_1(X21))&(r2_hidden(esk5_1(X21),X21)|v1_zfmisc_1(X21)))&(esk4_1(X21)!=esk5_1(X21)|v1_zfmisc_1(X21)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_zfmisc_1])])])])])])).
fof(c_0_10, negated_conjecture, (((~v1_xboole_0(esk1_0)&v4_finseq_1(esk1_0))&v3_polnot_1(esk1_0))&(m1_polnot_1(esk2_0,esk1_0)&((v1_zfmisc_1(esk1_0)&r2_hidden(esk3_0,esk1_0))&k1_funct_1(esk2_0,esk3_0)!=k5_ordinal1))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
cnf(c_0_11, plain, (r2_hidden(esk6_2(X1,X2),X1)|v1_xboole_0(X1)|~m1_polnot_1(X2,X1)|~v1_funct_1(X2)|~v1_funct_2(X2,X1,k4_ordinal1)|~m1_subset_1(X2,k1_zfmisc_1(k2_zfmisc_1(X1,k4_ordinal1)))|~v4_finseq_1(X1)|~v3_polnot_1(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, plain, (v1_funct_1(X1)|v1_xboole_0(X2)|~m1_polnot_1(X1,X2)|~v4_finseq_1(X2)|~v3_polnot_1(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, plain, (v1_funct_2(X1,X2,k4_ordinal1)|v1_xboole_0(X2)|~m1_polnot_1(X1,X2)|~v4_finseq_1(X2)|~v3_polnot_1(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, plain, (m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,k4_ordinal1)))|v1_xboole_0(X2)|~m1_polnot_1(X1,X2)|~v4_finseq_1(X2)|~v3_polnot_1(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_15, plain, (X2=X3|~v1_zfmisc_1(X1)|~r2_hidden(X2,X1)|~r2_hidden(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_16, negated_conjecture, (r2_hidden(esk3_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_17, negated_conjecture, (v1_zfmisc_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_18, plain, (r2_hidden(esk6_2(X1,X2),X1)|v1_xboole_0(X1)|~m1_polnot_1(X2,X1)|~v3_polnot_1(X1)|~v4_finseq_1(X1)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_11, c_0_12]), c_0_13]), c_0_14])).
cnf(c_0_19, negated_conjecture, (m1_polnot_1(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_20, negated_conjecture, (v3_polnot_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_21, negated_conjecture, (v4_finseq_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_22, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_23, plain, (k1_funct_1(X1,esk6_2(X2,X1))=k5_ordinal1|v1_xboole_0(X2)|~m1_polnot_1(X1,X2)|~v1_funct_1(X1)|~v1_funct_2(X1,X2,k4_ordinal1)|~m1_subset_1(X1,k1_zfmisc_1(k2_zfmisc_1(X2,k4_ordinal1)))|~v4_finseq_1(X2)|~v3_polnot_1(X2)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_24, negated_conjecture, (X1=esk3_0|~r2_hidden(X1,esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])])).
cnf(c_0_25, negated_conjecture, (r2_hidden(esk6_2(esk1_0,esk2_0),esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20]), c_0_21])]), c_0_22])).
cnf(c_0_26, plain, (k1_funct_1(X1,esk6_2(X2,X1))=k5_ordinal1|v1_xboole_0(X2)|~m1_polnot_1(X1,X2)|~v3_polnot_1(X2)|~v4_finseq_1(X2)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_23, c_0_12]), c_0_13]), c_0_14])).
cnf(c_0_27, negated_conjecture, (esk6_2(esk1_0,esk2_0)=esk3_0), inference(spm,[status(thm)],[c_0_24, c_0_25])).
cnf(c_0_28, negated_conjecture, (k1_funct_1(esk2_0,esk3_0)!=k5_ordinal1), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_29, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_19]), c_0_27]), c_0_20]), c_0_21])]), c_0_28]), c_0_22]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 30
# Proof object clause steps            : 19
# Proof object formula steps           : 11
# Proof object conjectures             : 14
# Proof object clause conjectures      : 11
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 4
# Proof object generating inferences   : 4
# Proof object simplifying inferences  : 18
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 17
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 17
# Processed clauses                    : 40
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 40
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 9
# ...of the previous two non-trivial   : 7
# Contextual simplify-reflections      : 6
# Paramodulations                      : 9
# 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  : 22
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 11
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 18
# Clause-clause subsumption calls (NU) : 41
# Rec. Clause-clause subsumption calls : 10
# Non-unit clause-clause subsumptions  : 6
# Unit Clause-clause subsumption calls : 8
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 1
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1702

# -------------------------------------------------
# User time                : 0.023 s
# System time              : 0.000 s
# Total time               : 0.023 s
# Maximum resident set size: 3052 pages
