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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(dt_o_1_1_polnot_2, axiom, ![X1]:(((~(v1_xboole_0(X1))&v4_finseq_1(X1))&v3_polnot_1(X1))=>(v3_relat_1(o_1_1_polnot_2(X1))&m1_polnot_1(o_1_1_polnot_2(X1),X1))), file('polnot_2/polnot_2__t5_polnot_2', dt_o_1_1_polnot_2)).
fof(t5_polnot_2, conjecture, ![X1]:(((~(v1_xboole_0(X1))&v4_finseq_1(X1))&v3_polnot_1(X1))=>(((~(v1_xboole_0(X1))&v3_polnot_1(X1))&v5_polnot_2(X1,X1))&m1_subset_1(X1,k1_zfmisc_1(k5_polnot_1(X1))))), file('polnot_2/polnot_2__t5_polnot_2', t5_polnot_2)).
fof(l30_polnot_2, axiom, ![X1]:(((~(v1_xboole_0(X1))&v4_finseq_1(X1))&v3_polnot_1(X1))=>![X2]:(m1_polnot_1(X2,X1)=>(v3_relat_1(X2)=>k3_polnot_2(X1,X2)=X1))), file('polnot_2/polnot_2__t5_polnot_2', l30_polnot_2)).
fof(dt_k3_polnot_2, axiom, ![X1, X2]:((((~(v1_xboole_0(X1))&v4_finseq_1(X1))&v3_polnot_1(X1))&m1_polnot_1(X2,X1))=>(((~(v1_xboole_0(k3_polnot_2(X1,X2)))&v3_polnot_1(k3_polnot_2(X1,X2)))&v5_polnot_2(k3_polnot_2(X1,X2),X1))&m1_subset_1(k3_polnot_2(X1,X2),k1_zfmisc_1(k5_polnot_1(X1))))), file('polnot_2/polnot_2__t5_polnot_2', dt_k3_polnot_2)).
fof(c_0_4, plain, ![X1]:(((~v1_xboole_0(X1)&v4_finseq_1(X1))&v3_polnot_1(X1))=>(v3_relat_1(o_1_1_polnot_2(X1))&m1_polnot_1(o_1_1_polnot_2(X1),X1))), inference(fof_simplification,[status(thm)],[dt_o_1_1_polnot_2])).
fof(c_0_5, negated_conjecture, ~(![X1]:(((~v1_xboole_0(X1)&v4_finseq_1(X1))&v3_polnot_1(X1))=>(((~v1_xboole_0(X1)&v3_polnot_1(X1))&v5_polnot_2(X1,X1))&m1_subset_1(X1,k1_zfmisc_1(k5_polnot_1(X1)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t5_polnot_2])])).
fof(c_0_6, plain, ![X1]:(((~v1_xboole_0(X1)&v4_finseq_1(X1))&v3_polnot_1(X1))=>![X2]:(m1_polnot_1(X2,X1)=>(v3_relat_1(X2)=>k3_polnot_2(X1,X2)=X1))), inference(fof_simplification,[status(thm)],[l30_polnot_2])).
fof(c_0_7, plain, ![X12]:((v3_relat_1(o_1_1_polnot_2(X12))|(v1_xboole_0(X12)|~v4_finseq_1(X12)|~v3_polnot_1(X12)))&(m1_polnot_1(o_1_1_polnot_2(X12),X12)|(v1_xboole_0(X12)|~v4_finseq_1(X12)|~v3_polnot_1(X12)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])).
fof(c_0_8, negated_conjecture, (((~v1_xboole_0(esk1_0)&v4_finseq_1(esk1_0))&v3_polnot_1(esk1_0))&(v1_xboole_0(esk1_0)|~v3_polnot_1(esk1_0)|~v5_polnot_2(esk1_0,esk1_0)|~m1_subset_1(esk1_0,k1_zfmisc_1(k5_polnot_1(esk1_0))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
fof(c_0_9, plain, ![X1, X2]:((((~v1_xboole_0(X1)&v4_finseq_1(X1))&v3_polnot_1(X1))&m1_polnot_1(X2,X1))=>(((~v1_xboole_0(k3_polnot_2(X1,X2))&v3_polnot_1(k3_polnot_2(X1,X2)))&v5_polnot_2(k3_polnot_2(X1,X2),X1))&m1_subset_1(k3_polnot_2(X1,X2),k1_zfmisc_1(k5_polnot_1(X1))))), inference(fof_simplification,[status(thm)],[dt_k3_polnot_2])).
fof(c_0_10, plain, ![X13, X14]:(v1_xboole_0(X13)|~v4_finseq_1(X13)|~v3_polnot_1(X13)|(~m1_polnot_1(X14,X13)|(~v3_relat_1(X14)|k3_polnot_2(X13,X14)=X13))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])).
cnf(c_0_11, plain, (v3_relat_1(o_1_1_polnot_2(X1))|v1_xboole_0(X1)|~v4_finseq_1(X1)|~v3_polnot_1(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, negated_conjecture, (v3_polnot_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, negated_conjecture, (v4_finseq_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
fof(c_0_15, plain, ![X10, X11]:((((~v1_xboole_0(k3_polnot_2(X10,X11))|(v1_xboole_0(X10)|~v4_finseq_1(X10)|~v3_polnot_1(X10)|~m1_polnot_1(X11,X10)))&(v3_polnot_1(k3_polnot_2(X10,X11))|(v1_xboole_0(X10)|~v4_finseq_1(X10)|~v3_polnot_1(X10)|~m1_polnot_1(X11,X10))))&(v5_polnot_2(k3_polnot_2(X10,X11),X10)|(v1_xboole_0(X10)|~v4_finseq_1(X10)|~v3_polnot_1(X10)|~m1_polnot_1(X11,X10))))&(m1_subset_1(k3_polnot_2(X10,X11),k1_zfmisc_1(k5_polnot_1(X10)))|(v1_xboole_0(X10)|~v4_finseq_1(X10)|~v3_polnot_1(X10)|~m1_polnot_1(X11,X10)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])).
cnf(c_0_16, plain, (v1_xboole_0(X1)|k3_polnot_2(X1,X2)=X1|~v4_finseq_1(X1)|~v3_polnot_1(X1)|~m1_polnot_1(X2,X1)|~v3_relat_1(X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_17, negated_conjecture, (v3_relat_1(o_1_1_polnot_2(esk1_0))), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_12]), c_0_13])]), c_0_14])).
cnf(c_0_18, plain, (m1_polnot_1(o_1_1_polnot_2(X1),X1)|v1_xboole_0(X1)|~v4_finseq_1(X1)|~v3_polnot_1(X1)), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_19, plain, (v5_polnot_2(k3_polnot_2(X1,X2),X1)|v1_xboole_0(X1)|~v4_finseq_1(X1)|~v3_polnot_1(X1)|~m1_polnot_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, negated_conjecture, (k3_polnot_2(X1,o_1_1_polnot_2(esk1_0))=X1|v1_xboole_0(X1)|~m1_polnot_1(o_1_1_polnot_2(esk1_0),X1)|~v3_polnot_1(X1)|~v4_finseq_1(X1)), inference(spm,[status(thm)],[c_0_16, c_0_17])).
cnf(c_0_21, negated_conjecture, (m1_polnot_1(o_1_1_polnot_2(esk1_0),esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_12]), c_0_13])]), c_0_14])).
cnf(c_0_22, negated_conjecture, (v1_xboole_0(esk1_0)|~v3_polnot_1(esk1_0)|~v5_polnot_2(esk1_0,esk1_0)|~m1_subset_1(esk1_0,k1_zfmisc_1(k5_polnot_1(esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_23, negated_conjecture, (v5_polnot_2(k3_polnot_2(esk1_0,X1),esk1_0)|~m1_polnot_1(X1,esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_12]), c_0_13])]), c_0_14])).
cnf(c_0_24, negated_conjecture, (k3_polnot_2(esk1_0,o_1_1_polnot_2(esk1_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_20, c_0_12]), c_0_21]), c_0_13])]), c_0_14])).
cnf(c_0_25, plain, (m1_subset_1(k3_polnot_2(X1,X2),k1_zfmisc_1(k5_polnot_1(X1)))|v1_xboole_0(X1)|~v4_finseq_1(X1)|~v3_polnot_1(X1)|~m1_polnot_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_26, negated_conjecture, (~m1_subset_1(esk1_0,k1_zfmisc_1(k5_polnot_1(esk1_0)))|~v5_polnot_2(esk1_0,esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_12])]), c_0_14])).
cnf(c_0_27, negated_conjecture, (v5_polnot_2(esk1_0,esk1_0)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_21]), c_0_24])).
cnf(c_0_28, negated_conjecture, (m1_subset_1(k3_polnot_2(esk1_0,X1),k1_zfmisc_1(k5_polnot_1(esk1_0)))|~m1_polnot_1(X1,esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_12]), c_0_13])]), c_0_14])).
cnf(c_0_29, negated_conjecture, (~m1_subset_1(esk1_0,k1_zfmisc_1(k5_polnot_1(esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_27])])).
cnf(c_0_30, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_21]), c_0_24]), c_0_29]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 31
# Proof object clause steps            : 19
# Proof object formula steps           : 12
# 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   : 8
# Proof object simplifying inferences  : 24
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 4
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 11
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 11
# Processed clauses                    : 39
# ...of these trivial                  : 0
# ...subsumed                          : 2
# ...remaining for further processing  : 37
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 6
# Generated clauses                    : 17
# ...of the previous two non-trivial   : 19
# Contextual simplify-reflections      : 0
# Paramodulations                      : 17
# 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  : 20
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 12
# Current number of unprocessed clauses: 0
# ...number of literals in the above   : 0
# Current number of archived formulas  : 0
# Current number of archived clauses   : 17
# Clause-clause subsumption calls (NU) : 17
# Rec. Clause-clause subsumption calls : 10
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 3
# 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          : 1583

# -------------------------------------------------
# User time                : 0.013 s
# System time              : 0.008 s
# Total time               : 0.021 s
# Maximum resident set size: 3708 pages
