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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
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('number15/number15__t41_number15', t4_subset)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('number15/number15__t41_number15', t3_subset)).
fof(t5_subset, axiom, ![X1, X2, X3]:~(((r2_tarski(X1,X2)&m1_subset_1(X2,k1_zfmisc_1(X3)))&v1_xboole_0(X3))), file('number15/number15__t41_number15', t5_subset)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('number15/number15__t41_number15', redefinition_r2_tarski)).
fof(d2_number15, axiom, ![X1]:(v1_number15(X1)<=>![X2]:(v1_xxreal_0(X2)=>~((r2_hidden(X2,X1)&r1_xxreal_0(X2,k5_numbers))))), file('number15/number15__t41_number15', d2_number15)).
fof(t2_subset, axiom, ![X1, X2]:(m1_subset_1(X1,X2)=>(v1_xboole_0(X2)|r2_tarski(X1,X2))), file('number15/number15__t41_number15', t2_subset)).
fof(t41_number15, conjecture, ![X1]:(v1_number15(X1)=>![X2]:(r1_tarski(X2,X1)=>v1_number15(X2))), file('number15/number15__t41_number15', t41_number15)).
fof(c_0_7, plain, ![X26, X27, X28]:(~r2_tarski(X26,X27)|~m1_subset_1(X27,k1_zfmisc_1(X28))|m1_subset_1(X26,X28)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])).
fof(c_0_8, plain, ![X32, X33]:((~m1_subset_1(X32,k1_zfmisc_1(X33))|r1_tarski(X32,X33))&(~r1_tarski(X32,X33)|m1_subset_1(X32,k1_zfmisc_1(X33)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
fof(c_0_9, plain, ![X29, X30, X31]:(~r2_tarski(X29,X30)|~m1_subset_1(X30,k1_zfmisc_1(X31))|~v1_xboole_0(X31)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])).
cnf(c_0_10, 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_7])).
cnf(c_0_11, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|~r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
fof(c_0_12, plain, ![X22, X23]:((~r2_tarski(X22,X23)|r2_hidden(X22,X23))&(~r2_hidden(X22,X23)|r2_tarski(X22,X23))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_13, plain, (~r2_tarski(X1,X2)|~m1_subset_1(X2,k1_zfmisc_1(X3))|~v1_xboole_0(X3)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X3)|~r1_tarski(X3,X2)), inference(spm,[status(thm)],[c_0_10, c_0_11])).
cnf(c_0_15, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
fof(c_0_16, plain, ![X34, X35, X36]:((~v1_number15(X34)|(~v1_xxreal_0(X35)|(~r2_hidden(X35,X34)|~r1_xxreal_0(X35,k5_numbers))))&((v1_xxreal_0(esk3_1(X36))|v1_number15(X36))&((r2_hidden(esk3_1(X36),X36)|v1_number15(X36))&(r1_xxreal_0(esk3_1(X36),k5_numbers)|v1_number15(X36))))), 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)],[d2_number15])])])])])])).
cnf(c_0_17, plain, (~v1_xboole_0(X1)|~r2_tarski(X2,X3)|~r1_tarski(X3,X1)), inference(spm,[status(thm)],[c_0_13, c_0_11])).
fof(c_0_18, plain, ![X24, X25]:(~m1_subset_1(X24,X25)|(v1_xboole_0(X25)|r2_tarski(X24,X25))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])).
cnf(c_0_19, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X3)|~r1_tarski(X3,X2)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
cnf(c_0_20, plain, (r2_hidden(esk3_1(X1),X1)|v1_number15(X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_21, plain, (~v1_xboole_0(X1)|~r2_hidden(X2,X3)|~r1_tarski(X3,X1)), inference(spm,[status(thm)],[c_0_17, c_0_15])).
cnf(c_0_22, plain, (v1_xboole_0(X2)|r2_tarski(X1,X2)|~m1_subset_1(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_23, plain, (m1_subset_1(esk3_1(X1),X2)|v1_number15(X1)|~r1_tarski(X1,X2)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_24, plain, (v1_number15(X1)|~v1_xboole_0(X2)|~r1_tarski(X1,X2)), inference(spm,[status(thm)],[c_0_21, c_0_20])).
cnf(c_0_25, plain, (~v1_number15(X1)|~v1_xxreal_0(X2)|~r2_hidden(X2,X1)|~r1_xxreal_0(X2,k5_numbers)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_26, plain, (r1_xxreal_0(esk3_1(X1),k5_numbers)|v1_number15(X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_27, plain, (v1_xxreal_0(esk3_1(X1))|v1_number15(X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
cnf(c_0_28, plain, (r2_hidden(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_12])).
cnf(c_0_29, plain, (r2_tarski(esk3_1(X1),X2)|v1_number15(X1)|~r1_tarski(X1,X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
fof(c_0_30, negated_conjecture, ~(![X1]:(v1_number15(X1)=>![X2]:(r1_tarski(X2,X1)=>v1_number15(X2)))), inference(assume_negation,[status(cth)],[t41_number15])).
cnf(c_0_31, plain, (v1_number15(X1)|~r2_hidden(esk3_1(X1),X2)|~v1_number15(X2)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_27])).
cnf(c_0_32, plain, (r2_hidden(esk3_1(X1),X2)|v1_number15(X1)|~r1_tarski(X1,X2)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
fof(c_0_33, negated_conjecture, (v1_number15(esk1_0)&(r1_tarski(esk2_0,esk1_0)&~v1_number15(esk2_0))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])).
cnf(c_0_34, plain, (v1_number15(X1)|~r1_tarski(X1,X2)|~v1_number15(X2)), inference(spm,[status(thm)],[c_0_31, c_0_32])).
cnf(c_0_35, negated_conjecture, (r1_tarski(esk2_0,esk1_0)), inference(split_conjunct,[status(thm)],[c_0_33])).
cnf(c_0_36, negated_conjecture, (v1_number15(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_33])).
cnf(c_0_37, negated_conjecture, (~v1_number15(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_33])).
cnf(c_0_38, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_35]), c_0_36])]), c_0_37]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 39
# Proof object clause steps            : 24
# Proof object formula steps           : 15
# Proof object conjectures             : 7
# Proof object clause conjectures      : 4
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 13
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 11
# Proof object simplifying inferences  : 5
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 7
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 14
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 14
# Processed clauses                    : 55
# ...of these trivial                  : 0
# ...subsumed                          : 3
# ...remaining for further processing  : 52
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 1
# Backward-rewritten                   : 0
# Generated clauses                    : 43
# ...of the previous two non-trivial   : 39
# Contextual simplify-reflections      : 3
# Paramodulations                      : 43
# 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  : 37
#    Positive orientable unit clauses  : 2
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 33
# Current number of unprocessed clauses: 11
# ...number of literals in the above   : 50
# Current number of archived formulas  : 0
# Current number of archived clauses   : 15
# Clause-clause subsumption calls (NU) : 155
# Rec. Clause-clause subsumption calls : 97
# Non-unit clause-clause subsumptions  : 6
# Unit Clause-clause subsumption calls : 15
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 0
# BW rewrite match successes           : 0
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 1764

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