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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t46_subset_1, axiom, ![X1]:((~(v1_xboole_0(X1))&v1_zfmisc_1(X1))=>?[X2]:(m1_subset_1(X2,X1)&X1=k1_tarski(X2))), file('polnot_2/polnot_2__l1_polnot_2', t46_subset_1)).
fof(l1_polnot_2, conjecture, ![X1]:(v1_zfmisc_1(X1)=>![X2]:(m1_subset_1(X2,k1_zfmisc_1(X1))=>(~(v1_xboole_0(X2))=>X1=X2))), file('polnot_2/polnot_2__l1_polnot_2', l1_polnot_2)).
fof(t47_subset_1, axiom, ![X1]:(~(v1_xboole_0(X1))=>![X2]:((~(v1_xboole_0(X2))&m1_subset_1(X2,k1_zfmisc_1(X1)))=>~((v1_zfmisc_1(X2)&![X3]:(m1_subset_1(X3,X1)=>X2!=k1_tarski(X3)))))), file('polnot_2/polnot_2__l1_polnot_2', t47_subset_1)).
fof(cc5_subset_1, axiom, ![X1]:(v1_zfmisc_1(X1)=>![X2]:(m1_subset_1(X2,k1_zfmisc_1(X1))=>v1_zfmisc_1(X2))), file('polnot_2/polnot_2__l1_polnot_2', cc5_subset_1)).
fof(cc1_subset_1, axiom, ![X1]:(v1_xboole_0(X1)=>![X2]:(m1_subset_1(X2,k1_zfmisc_1(X1))=>v1_xboole_0(X2))), file('polnot_2/polnot_2__l1_polnot_2', cc1_subset_1)).
fof(d7_subset_1, axiom, ![X1]:(v1_zfmisc_1(X1)<=>![X2]:(m1_subset_1(X2,X1)=>![X3]:(m1_subset_1(X3,X1)=>X2=X3))), file('polnot_2/polnot_2__l1_polnot_2', d7_subset_1)).
fof(c_0_6, plain, ![X1]:((~v1_xboole_0(X1)&v1_zfmisc_1(X1))=>?[X2]:(m1_subset_1(X2,X1)&X1=k1_tarski(X2))), inference(fof_simplification,[status(thm)],[t46_subset_1])).
fof(c_0_7, negated_conjecture, ~(![X1]:(v1_zfmisc_1(X1)=>![X2]:(m1_subset_1(X2,k1_zfmisc_1(X1))=>(~v1_xboole_0(X2)=>X1=X2)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l1_polnot_2])])).
fof(c_0_8, plain, ![X30]:((m1_subset_1(esk5_1(X30),X30)|(v1_xboole_0(X30)|~v1_zfmisc_1(X30)))&(X30=k1_tarski(esk5_1(X30))|(v1_xboole_0(X30)|~v1_zfmisc_1(X30)))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])).
fof(c_0_9, negated_conjecture, (v1_zfmisc_1(esk1_0)&(m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0))&(~v1_xboole_0(esk2_0)&esk1_0!=esk2_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
fof(c_0_10, plain, ![X1]:(~v1_xboole_0(X1)=>![X2]:((~v1_xboole_0(X2)&m1_subset_1(X2,k1_zfmisc_1(X1)))=>~((v1_zfmisc_1(X2)&![X3]:(m1_subset_1(X3,X1)=>X2!=k1_tarski(X3)))))), inference(fof_simplification,[status(thm)],[t47_subset_1])).
fof(c_0_11, plain, ![X22, X23]:(~v1_zfmisc_1(X22)|(~m1_subset_1(X23,k1_zfmisc_1(X22))|v1_zfmisc_1(X23))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc5_subset_1])])])).
fof(c_0_12, plain, ![X20, X21]:(~v1_xboole_0(X20)|(~m1_subset_1(X21,k1_zfmisc_1(X20))|v1_xboole_0(X21))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_subset_1])])])).
cnf(c_0_13, plain, (m1_subset_1(esk5_1(X1),X1)|v1_xboole_0(X1)|~v1_zfmisc_1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_14, negated_conjecture, (v1_zfmisc_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
fof(c_0_15, plain, ![X32, X33]:((m1_subset_1(esk6_2(X32,X33),X32)|~v1_zfmisc_1(X33)|(v1_xboole_0(X33)|~m1_subset_1(X33,k1_zfmisc_1(X32)))|v1_xboole_0(X32))&(X33=k1_tarski(esk6_2(X32,X33))|~v1_zfmisc_1(X33)|(v1_xboole_0(X33)|~m1_subset_1(X33,k1_zfmisc_1(X32)))|v1_xboole_0(X32))), 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_10])])])])])).
cnf(c_0_16, plain, (v1_zfmisc_1(X2)|~v1_zfmisc_1(X1)|~m1_subset_1(X2,k1_zfmisc_1(X1))), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_17, plain, ![X24, X25, X26, X27]:((~v1_zfmisc_1(X24)|(~m1_subset_1(X25,X24)|(~m1_subset_1(X26,X24)|X25=X26)))&((m1_subset_1(esk3_1(X27),X27)|v1_zfmisc_1(X27))&((m1_subset_1(esk4_1(X27),X27)|v1_zfmisc_1(X27))&(esk3_1(X27)!=esk4_1(X27)|v1_zfmisc_1(X27))))), 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)],[d7_subset_1])])])])])])).
cnf(c_0_18, plain, (v1_xboole_0(X2)|~v1_xboole_0(X1)|~m1_subset_1(X2,k1_zfmisc_1(X1))), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_19, negated_conjecture, (v1_xboole_0(esk1_0)|m1_subset_1(esk5_1(esk1_0),esk1_0)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_20, plain, (m1_subset_1(esk6_2(X1,X2),X1)|v1_xboole_0(X2)|v1_xboole_0(X1)|~v1_zfmisc_1(X2)|~m1_subset_1(X2,k1_zfmisc_1(X1))), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_21, negated_conjecture, (v1_zfmisc_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(esk1_0))), inference(spm,[status(thm)],[c_0_16, c_0_14])).
cnf(c_0_22, negated_conjecture, (m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_23, plain, (X2=X3|~v1_zfmisc_1(X1)|~m1_subset_1(X2,X1)|~m1_subset_1(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_24, negated_conjecture, (v1_xboole_0(X1)|m1_subset_1(esk5_1(esk1_0),esk1_0)|~m1_subset_1(X1,k1_zfmisc_1(esk1_0))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
cnf(c_0_25, negated_conjecture, (~v1_xboole_0(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_26, plain, (v1_xboole_0(X1)|m1_subset_1(esk6_2(X2,X1),X2)|~m1_subset_1(X1,k1_zfmisc_1(X2))|~v1_zfmisc_1(X1)), inference(csr,[status(thm)],[c_0_20, c_0_18])).
cnf(c_0_27, negated_conjecture, (v1_zfmisc_1(esk2_0)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_28, plain, (X1=k1_tarski(esk6_2(X2,X1))|v1_xboole_0(X1)|v1_xboole_0(X2)|~v1_zfmisc_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(X2))), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_29, negated_conjecture, (X1=X2|~m1_subset_1(X2,esk1_0)|~m1_subset_1(X1,esk1_0)), inference(spm,[status(thm)],[c_0_23, c_0_14])).
cnf(c_0_30, negated_conjecture, (m1_subset_1(esk5_1(esk1_0),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_22]), c_0_25])).
cnf(c_0_31, negated_conjecture, (m1_subset_1(esk6_2(X1,esk2_0),X1)|~m1_subset_1(esk2_0,k1_zfmisc_1(X1))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_25])).
cnf(c_0_32, plain, (k1_tarski(esk6_2(X1,X2))=X2|v1_xboole_0(X2)|~m1_subset_1(X2,k1_zfmisc_1(X1))|~v1_zfmisc_1(X2)), inference(csr,[status(thm)],[c_0_28, c_0_18])).
cnf(c_0_33, negated_conjecture, (X1=esk5_1(esk1_0)|~m1_subset_1(X1,esk1_0)), inference(spm,[status(thm)],[c_0_29, c_0_30])).
cnf(c_0_34, negated_conjecture, (m1_subset_1(esk6_2(esk1_0,esk2_0),esk1_0)), inference(spm,[status(thm)],[c_0_31, c_0_22])).
cnf(c_0_35, plain, (X1=k1_tarski(esk5_1(X1))|v1_xboole_0(X1)|~v1_zfmisc_1(X1)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_36, negated_conjecture, (k1_tarski(esk6_2(X1,esk2_0))=esk2_0|~m1_subset_1(esk2_0,k1_zfmisc_1(X1))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_27]), c_0_25])).
cnf(c_0_37, negated_conjecture, (esk6_2(esk1_0,esk2_0)=esk5_1(esk1_0)), inference(spm,[status(thm)],[c_0_33, c_0_34])).
cnf(c_0_38, negated_conjecture, (k1_tarski(esk5_1(esk1_0))=esk1_0|v1_xboole_0(esk1_0)), inference(spm,[status(thm)],[c_0_35, c_0_14])).
cnf(c_0_39, negated_conjecture, (k1_tarski(esk5_1(esk1_0))=esk2_0), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_22]), c_0_37])).
cnf(c_0_40, negated_conjecture, (esk1_0!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_41, negated_conjecture, (v1_xboole_0(esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_40])).
cnf(c_0_42, negated_conjecture, (v1_xboole_0(X1)|~m1_subset_1(X1,k1_zfmisc_1(esk1_0))), inference(spm,[status(thm)],[c_0_18, c_0_41])).
cnf(c_0_43, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_22]), c_0_25]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 44
# Proof object clause steps            : 29
# Proof object formula steps           : 15
# Proof object conjectures             : 23
# Proof object clause conjectures      : 20
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 11
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 16
# Proof object simplifying inferences  : 8
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 14
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 14
# Processed clauses                    : 56
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 56
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 4
# Generated clauses                    : 72
# ...of the previous two non-trivial   : 63
# Contextual simplify-reflections      : 2
# Paramodulations                      : 72
# 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  : 38
#    Positive orientable unit clauses  : 9
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 27
# Current number of unprocessed clauses: 30
# ...number of literals in the above   : 102
# Current number of archived formulas  : 0
# Current number of archived clauses   : 18
# Clause-clause subsumption calls (NU) : 123
# Rec. Clause-clause subsumption calls : 85
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 7
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 4
# BW rewrite match successes           : 4
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2174

# -------------------------------------------------
# User time                : 0.024 s
# System time              : 0.000 s
# Total time               : 0.024 s
# Maximum resident set size: 2932 pages
