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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t6_boole, axiom, ![X1]:(v1_xboole_0(X1)=>X1=k1_xboole_0), file('proofs_1/proofs_1__l56_proofs_1', t6_boole)).
fof(rc2_subset_1, axiom, ![X1]:?[X2]:(m1_subset_1(X2,k1_zfmisc_1(X1))&v1_xboole_0(X2)), file('proofs_1/proofs_1__l56_proofs_1', rc2_subset_1)).
fof(d27_proofs_1, axiom, ![X1]:(v15_proofs_1(X1)<=>![X2]:(r2_hidden(X2,X1)<=>?[X3]:(X3=X2&![X4]:((v1_finset_1(X4)&m1_subset_1(X4,k1_zfmisc_1(X3)))=>r2_tarski(X4,X1))))), file('proofs_1/proofs_1__l56_proofs_1', d27_proofs_1)).
fof(cc1_finset_1, axiom, ![X1]:(v1_xboole_0(X1)=>v1_finset_1(X1)), file('proofs_1/proofs_1__l56_proofs_1', cc1_finset_1)).
fof(d1_xboole_0, axiom, ![X1]:(v1_xboole_0(X1)<=>![X2]:~(r2_hidden(X2,X1))), file('proofs_1/proofs_1__l56_proofs_1', d1_xboole_0)).
fof(l56_proofs_1, conjecture, ![X1]:((~(v1_xboole_0(X1))&v15_proofs_1(X1))=>r2_tarski(k1_xboole_0,X1)), file('proofs_1/proofs_1__l56_proofs_1', l56_proofs_1)).
fof(c_0_6, plain, ![X37]:(~v1_xboole_0(X37)|X37=k1_xboole_0), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])).
fof(c_0_7, plain, ![X35]:(m1_subset_1(esk8_1(X35),k1_zfmisc_1(X35))&v1_xboole_0(esk8_1(X35))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])])).
cnf(c_0_8, plain, (X1=k1_xboole_0|~v1_xboole_0(X1)), inference(split_conjunct,[status(thm)],[c_0_6])).
cnf(c_0_9, plain, (v1_xboole_0(esk8_1(X1))), inference(split_conjunct,[status(thm)],[c_0_7])).
fof(c_0_10, plain, ![X22, X23, X25, X26, X27, X29, X31, X34]:((((esk3_2(X22,X23)=X23|~r2_hidden(X23,X22)|~v15_proofs_1(X22))&(~v1_finset_1(X25)|~m1_subset_1(X25,k1_zfmisc_1(esk3_2(X22,X23)))|r2_tarski(X25,X22)|~r2_hidden(X23,X22)|~v15_proofs_1(X22)))&(((v1_finset_1(esk4_3(X22,X26,X27))|X27!=X26|r2_hidden(X26,X22)|~v15_proofs_1(X22))&(m1_subset_1(esk4_3(X22,X26,X27),k1_zfmisc_1(X27))|X27!=X26|r2_hidden(X26,X22)|~v15_proofs_1(X22)))&(~r2_tarski(esk4_3(X22,X26,X27),X22)|X27!=X26|r2_hidden(X26,X22)|~v15_proofs_1(X22))))&((((v1_finset_1(esk6_2(X29,X31))|X31!=esk5_1(X29)|~r2_hidden(esk5_1(X29),X29)|v15_proofs_1(X29))&(m1_subset_1(esk6_2(X29,X31),k1_zfmisc_1(X31))|X31!=esk5_1(X29)|~r2_hidden(esk5_1(X29),X29)|v15_proofs_1(X29)))&(~r2_tarski(esk6_2(X29,X31),X29)|X31!=esk5_1(X29)|~r2_hidden(esk5_1(X29),X29)|v15_proofs_1(X29)))&((esk7_1(X29)=esk5_1(X29)|r2_hidden(esk5_1(X29),X29)|v15_proofs_1(X29))&(~v1_finset_1(X34)|~m1_subset_1(X34,k1_zfmisc_1(esk7_1(X29)))|r2_tarski(X34,X29)|r2_hidden(esk5_1(X29),X29)|v15_proofs_1(X29))))), 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)],[d27_proofs_1])])])])])])).
cnf(c_0_11, plain, (m1_subset_1(esk8_1(X1),k1_zfmisc_1(X1))), inference(split_conjunct,[status(thm)],[c_0_7])).
cnf(c_0_12, plain, (esk8_1(X1)=k1_xboole_0), inference(spm,[status(thm)],[c_0_8, c_0_9])).
cnf(c_0_13, plain, (r2_tarski(X1,X2)|~v1_finset_1(X1)|~m1_subset_1(X1,k1_zfmisc_1(esk3_2(X2,X3)))|~r2_hidden(X3,X2)|~v15_proofs_1(X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_14, plain, (m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1))), inference(rw,[status(thm)],[c_0_11, c_0_12])).
fof(c_0_15, plain, ![X17]:(~v1_xboole_0(X17)|v1_finset_1(X17)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_finset_1])])).
fof(c_0_16, plain, ![X1]:(v1_xboole_0(X1)<=>![X2]:~r2_hidden(X2,X1)), inference(fof_simplification,[status(thm)],[d1_xboole_0])).
fof(c_0_17, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v15_proofs_1(X1))=>r2_tarski(k1_xboole_0,X1))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l56_proofs_1])])).
cnf(c_0_18, plain, (r2_tarski(k1_xboole_0,X1)|~r2_hidden(X2,X1)|~v1_finset_1(k1_xboole_0)|~v15_proofs_1(X1)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_19, plain, (v1_finset_1(X1)|~v1_xboole_0(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, plain, (v1_xboole_0(k1_xboole_0)), inference(rw,[status(thm)],[c_0_9, c_0_12])).
fof(c_0_21, plain, ![X18, X19, X20]:((~v1_xboole_0(X18)|~r2_hidden(X19,X18))&(r2_hidden(esk2_1(X20),X20)|v1_xboole_0(X20))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])])).
fof(c_0_22, negated_conjecture, ((~v1_xboole_0(esk1_0)&v15_proofs_1(esk1_0))&~r2_tarski(k1_xboole_0,esk1_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])).
cnf(c_0_23, plain, (r2_tarski(k1_xboole_0,X1)|~r2_hidden(X2,X1)|~v15_proofs_1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])])).
cnf(c_0_24, plain, (r2_hidden(esk2_1(X1),X1)|v1_xboole_0(X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_25, negated_conjecture, (~r2_tarski(k1_xboole_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_26, plain, (r2_tarski(k1_xboole_0,X1)|v1_xboole_0(X1)|~v15_proofs_1(X1)), inference(spm,[status(thm)],[c_0_23, c_0_24])).
cnf(c_0_27, negated_conjecture, (v15_proofs_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_28, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_29, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])]), c_0_28]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 30
# Proof object clause steps            : 16
# Proof object formula steps           : 14
# Proof object conjectures             : 7
# Proof object clause conjectures      : 4
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 9
# Proof object initial formulas used   : 6
# Proof object generating inferences   : 5
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 6
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 19
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 19
# Processed clauses                    : 48
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 48
# Other redundant clauses eliminated   : 6
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 2
# Generated clauses                    : 15
# ...of the previous two non-trivial   : 14
# Contextual simplify-reflections      : 0
# Paramodulations                      : 9
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 6
# 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  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 14
# Current number of unprocessed clauses: 4
# ...number of literals in the above   : 16
# Current number of archived formulas  : 0
# Current number of archived clauses   : 22
# Clause-clause subsumption calls (NU) : 34
# Rec. Clause-clause subsumption calls : 18
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 1
# 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          : 1656

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