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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(l57_proofs_1, conjecture, ![X1]:((~(v1_xboole_0(X1))&v15_proofs_1(X1))=>![X2]:((v6_ordinal1(X2)&m1_subset_1(X2,k1_zfmisc_1(X1)))=>r2_tarski(k3_tarski(X2),X1))), file('proofs_1/proofs_1__l57_proofs_1', l57_proofs_1)).
fof(t16_pl_axiom, axiom, ![X1]:(v1_finset_1(X1)=>![X2]:~((((v6_ordinal1(X2)&r1_tarski(X1,k3_tarski(X2)))&X2!=k1_xboole_0)&![X3]:~((r1_tarski(X1,X3)&r2_tarski(X3,X2)))))), file('proofs_1/proofs_1__l57_proofs_1', t16_pl_axiom)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('proofs_1/proofs_1__l57_proofs_1', t3_subset)).
fof(d28_proofs_1, axiom, ![X1]:(v15_proofs_1(X1)<=>![X2]:(r2_tarski(X2,X1)<=>![X3]:((v1_finset_1(X3)&m1_subset_1(X3,k1_zfmisc_1(X2)))=>r2_tarski(X3,X1)))), file('proofs_1/proofs_1__l57_proofs_1', d28_proofs_1)).
fof(t4_subset, axiom, ![X1, X2, X3]:((r2_tarski(X1,X2)&m1_subset_1(X2,k1_zfmisc_1(X3)))=>m1_subset_1(X1,X3)), file('proofs_1/proofs_1__l57_proofs_1', t4_subset)).
fof(t2_subset, axiom, ![X1, X2]:(m1_subset_1(X1,X2)=>(v1_xboole_0(X2)|r2_tarski(X1,X2))), file('proofs_1/proofs_1__l57_proofs_1', t2_subset)).
fof(l56_proofs_1, axiom, ![X1]:((~(v1_xboole_0(X1))&v15_proofs_1(X1))=>r2_tarski(k1_xboole_0,X1)), file('proofs_1/proofs_1__l57_proofs_1', l56_proofs_1)).
fof(t2_zfmisc_1, axiom, k3_tarski(k1_xboole_0)=k1_xboole_0, file('proofs_1/proofs_1__l57_proofs_1', t2_zfmisc_1)).
fof(c_0_8, negated_conjecture, ~(![X1]:((~v1_xboole_0(X1)&v15_proofs_1(X1))=>![X2]:((v6_ordinal1(X2)&m1_subset_1(X2,k1_zfmisc_1(X1)))=>r2_tarski(k3_tarski(X2),X1)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l57_proofs_1])])).
fof(c_0_9, plain, ![X32, X33]:((r1_tarski(X32,esk6_2(X32,X33))|(~v6_ordinal1(X33)|~r1_tarski(X32,k3_tarski(X33))|X33=k1_xboole_0)|~v1_finset_1(X32))&(r2_tarski(esk6_2(X32,X33),X33)|(~v6_ordinal1(X33)|~r1_tarski(X32,k3_tarski(X33))|X33=k1_xboole_0)|~v1_finset_1(X32))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_pl_axiom])])])])])).
fof(c_0_10, plain, ![X37, X38]:((~m1_subset_1(X37,k1_zfmisc_1(X38))|r1_tarski(X37,X38))&(~r1_tarski(X37,X38)|m1_subset_1(X37,k1_zfmisc_1(X38)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
fof(c_0_11, plain, ![X22, X23, X24, X25, X27, X30]:(((~r2_tarski(X23,X22)|(~v1_finset_1(X24)|~m1_subset_1(X24,k1_zfmisc_1(X23))|r2_tarski(X24,X22))|~v15_proofs_1(X22))&(((v1_finset_1(esk3_2(X22,X25))|r2_tarski(X25,X22)|~v15_proofs_1(X22))&(m1_subset_1(esk3_2(X22,X25),k1_zfmisc_1(X25))|r2_tarski(X25,X22)|~v15_proofs_1(X22)))&(~r2_tarski(esk3_2(X22,X25),X22)|r2_tarski(X25,X22)|~v15_proofs_1(X22))))&((((v1_finset_1(esk5_1(X27))|~r2_tarski(esk4_1(X27),X27)|v15_proofs_1(X27))&(m1_subset_1(esk5_1(X27),k1_zfmisc_1(esk4_1(X27)))|~r2_tarski(esk4_1(X27),X27)|v15_proofs_1(X27)))&(~r2_tarski(esk5_1(X27),X27)|~r2_tarski(esk4_1(X27),X27)|v15_proofs_1(X27)))&(r2_tarski(esk4_1(X27),X27)|(~v1_finset_1(X30)|~m1_subset_1(X30,k1_zfmisc_1(esk4_1(X27)))|r2_tarski(X30,X27))|v15_proofs_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)],[d28_proofs_1])])])])])])).
fof(c_0_12, negated_conjecture, ((~v1_xboole_0(esk1_0)&v15_proofs_1(esk1_0))&((v6_ordinal1(esk2_0)&m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0)))&~r2_tarski(k3_tarski(esk2_0),esk1_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
cnf(c_0_13, plain, (r1_tarski(X1,esk6_2(X1,X2))|X2=k1_xboole_0|~v6_ordinal1(X2)|~r1_tarski(X1,k3_tarski(X2))|~v1_finset_1(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2))), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_15, plain, (m1_subset_1(esk3_2(X1,X2),k1_zfmisc_1(X2))|r2_tarski(X2,X1)|~v15_proofs_1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_16, negated_conjecture, (v15_proofs_1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_17, plain, (v1_finset_1(esk3_2(X1,X2))|r2_tarski(X2,X1)|~v15_proofs_1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_18, plain, (X1=k1_xboole_0|r1_tarski(X2,esk6_2(X2,X1))|~v1_finset_1(X2)|~m1_subset_1(X2,k1_zfmisc_1(k3_tarski(X1)))|~v6_ordinal1(X1)), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_19, negated_conjecture, (r2_tarski(X1,esk1_0)|m1_subset_1(esk3_2(esk1_0,X1),k1_zfmisc_1(X1))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
cnf(c_0_20, negated_conjecture, (v1_finset_1(esk3_2(esk1_0,X1))|r2_tarski(X1,esk1_0)), inference(spm,[status(thm)],[c_0_17, c_0_16])).
cnf(c_0_21, plain, (r2_tarski(esk6_2(X1,X2),X2)|X2=k1_xboole_0|~v6_ordinal1(X2)|~r1_tarski(X1,k3_tarski(X2))|~v1_finset_1(X1)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_22, negated_conjecture, (X1=k1_xboole_0|r1_tarski(esk3_2(esk1_0,k3_tarski(X1)),esk6_2(esk3_2(esk1_0,k3_tarski(X1)),X1))|r2_tarski(k3_tarski(X1),esk1_0)|~v6_ordinal1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18, c_0_19]), c_0_20])).
cnf(c_0_23, negated_conjecture, (v6_ordinal1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_24, negated_conjecture, (~r2_tarski(k3_tarski(esk2_0),esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_25, plain, ![X39, X40, X41]:(~r2_tarski(X39,X40)|~m1_subset_1(X40,k1_zfmisc_1(X41))|m1_subset_1(X39,X41)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])).
cnf(c_0_26, plain, (X1=k1_xboole_0|r2_tarski(esk6_2(X2,X1),X1)|~v1_finset_1(X2)|~m1_subset_1(X2,k1_zfmisc_1(k3_tarski(X1)))|~v6_ordinal1(X1)), inference(spm,[status(thm)],[c_0_21, c_0_14])).
cnf(c_0_27, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_28, negated_conjecture, (esk2_0=k1_xboole_0|r1_tarski(esk3_2(esk1_0,k3_tarski(esk2_0)),esk6_2(esk3_2(esk1_0,k3_tarski(esk2_0)),esk2_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
cnf(c_0_29, plain, (m1_subset_1(X1,X3)|~r2_tarski(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3))), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_30, negated_conjecture, (m1_subset_1(esk2_0,k1_zfmisc_1(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_31, negated_conjecture, (X1=k1_xboole_0|r2_tarski(esk6_2(esk3_2(esk1_0,k3_tarski(X1)),X1),X1)|r2_tarski(k3_tarski(X1),esk1_0)|~v6_ordinal1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_19]), c_0_20])).
cnf(c_0_32, plain, (r2_tarski(X3,X2)|~r2_tarski(X1,X2)|~v1_finset_1(X3)|~m1_subset_1(X3,k1_zfmisc_1(X1))|~v15_proofs_1(X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_33, negated_conjecture, (esk2_0=k1_xboole_0|m1_subset_1(esk3_2(esk1_0,k3_tarski(esk2_0)),k1_zfmisc_1(esk6_2(esk3_2(esk1_0,k3_tarski(esk2_0)),esk2_0)))), inference(spm,[status(thm)],[c_0_27, c_0_28])).
fof(c_0_34, plain, ![X35, X36]:(~m1_subset_1(X35,X36)|(v1_xboole_0(X36)|r2_tarski(X35,X36))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])).
cnf(c_0_35, negated_conjecture, (m1_subset_1(X1,esk1_0)|~r2_tarski(X1,esk2_0)), inference(spm,[status(thm)],[c_0_29, c_0_30])).
cnf(c_0_36, negated_conjecture, (esk2_0=k1_xboole_0|r2_tarski(esk6_2(esk3_2(esk1_0,k3_tarski(esk2_0)),esk2_0),esk2_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_23]), c_0_24])).
cnf(c_0_37, negated_conjecture, (esk2_0=k1_xboole_0|r2_tarski(esk3_2(esk1_0,k3_tarski(esk2_0)),X1)|~v1_finset_1(esk3_2(esk1_0,k3_tarski(esk2_0)))|~r2_tarski(esk6_2(esk3_2(esk1_0,k3_tarski(esk2_0)),esk2_0),X1)|~v15_proofs_1(X1)), inference(spm,[status(thm)],[c_0_32, c_0_33])).
cnf(c_0_38, plain, (v1_xboole_0(X2)|r2_tarski(X1,X2)|~m1_subset_1(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_34])).
cnf(c_0_39, negated_conjecture, (esk2_0=k1_xboole_0|m1_subset_1(esk6_2(esk3_2(esk1_0,k3_tarski(esk2_0)),esk2_0),esk1_0)), inference(spm,[status(thm)],[c_0_35, c_0_36])).
cnf(c_0_40, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_41, plain, ![X1]:((~v1_xboole_0(X1)&v15_proofs_1(X1))=>r2_tarski(k1_xboole_0,X1)), inference(fof_simplification,[status(thm)],[l56_proofs_1])).
cnf(c_0_42, negated_conjecture, (esk2_0=k1_xboole_0|r2_tarski(esk3_2(esk1_0,k3_tarski(esk2_0)),X1)|~r2_tarski(esk6_2(esk3_2(esk1_0,k3_tarski(esk2_0)),esk2_0),X1)|~v15_proofs_1(X1)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_20]), c_0_24])).
cnf(c_0_43, negated_conjecture, (esk2_0=k1_xboole_0|r2_tarski(esk6_2(esk3_2(esk1_0,k3_tarski(esk2_0)),esk2_0),esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_39]), c_0_40])).
fof(c_0_44, plain, ![X31]:(v1_xboole_0(X31)|~v15_proofs_1(X31)|r2_tarski(k1_xboole_0,X31)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_41])])).
cnf(c_0_45, plain, (r2_tarski(X2,X1)|~r2_tarski(esk3_2(X1,X2),X1)|~v15_proofs_1(X1)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_46, negated_conjecture, (esk2_0=k1_xboole_0|r2_tarski(esk3_2(esk1_0,k3_tarski(esk2_0)),esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42, c_0_43]), c_0_16])])).
cnf(c_0_47, plain, (v1_xboole_0(X1)|r2_tarski(k1_xboole_0,X1)|~v15_proofs_1(X1)), inference(split_conjunct,[status(thm)],[c_0_44])).
cnf(c_0_48, negated_conjecture, (esk2_0=k1_xboole_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_16])]), c_0_24])).
cnf(c_0_49, plain, (k3_tarski(k1_xboole_0)=k1_xboole_0), inference(split_conjunct,[status(thm)],[t2_zfmisc_1])).
cnf(c_0_50, negated_conjecture, (r2_tarski(k1_xboole_0,esk1_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_16]), c_0_40])).
cnf(c_0_51, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_48]), c_0_49]), c_0_50])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 52
# Proof object clause steps            : 35
# Proof object formula steps           : 17
# Proof object conjectures             : 24
# Proof object clause conjectures      : 21
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 17
# Proof object initial formulas used   : 8
# Proof object generating inferences   : 17
# Proof object simplifying inferences  : 16
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 21
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 21
# Processed clauses                    : 82
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 81
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 8
# Backward-rewritten                   : 18
# Generated clauses                    : 65
# ...of the previous two non-trivial   : 63
# Contextual simplify-reflections      : 4
# Paramodulations                      : 65
# 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  : 34
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 29
# Current number of unprocessed clauses: 16
# ...number of literals in the above   : 93
# Current number of archived formulas  : 0
# Current number of archived clauses   : 47
# Clause-clause subsumption calls (NU) : 409
# Rec. Clause-clause subsumption calls : 98
# Non-unit clause-clause subsumptions  : 13
# Unit Clause-clause subsumption calls : 11
# 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          : 3591

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