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

# Failure: User resource limit exceeded!
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 19
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 19
# Processed clauses                    : 59615
# ...of these trivial                  : 0
# ...subsumed                          : 24876
# ...remaining for further processing  : 34739
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 169
# Backward-rewritten                   : 0
# Generated clauses                    : 584230
# ...of the previous two non-trivial   : 581703
# Contextual simplify-reflections      : 1060
# Paramodulations                      : 584229
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# 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  : 34550
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 4
#    Non-unit-clauses                  : 34540
# Current number of unprocessed clauses: 515044
# ...number of literals in the above   : 2248914
# Current number of archived formulas  : 0
# Current number of archived clauses   : 188
# Clause-clause subsumption calls (NU) : 381241156
# Rec. Clause-clause subsumption calls : 311184460
# Non-unit clause-clause subsumptions  : 26066
# Unit Clause-clause subsumption calls : 7
# 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          : 22731286
# No success with AutoSched0
# Trying AutoSched1 for 71 seconds
# AutoSched1-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04BN
# and selection function PSelectComplexExceptUniqMaxHorn.
#
# Preprocessing time       : 0.013 s
# Presaturation interreduction done

# Failure: User resource limit exceeded!
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 19
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 19
# Processed clauses                    : 33325
# ...of these trivial                  : 0
# ...subsumed                          : 9209
# ...remaining for further processing  : 24116
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 367558
# ...of the previous two non-trivial   : 366565
# Contextual simplify-reflections      : 563
# Paramodulations                      : 367557
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# Propositional unsat checks           : 4
#    Propositional check models        : 3
#    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       : 2.850
#    Propositional solver time         : 0.085
#    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  : 24096
#    Positive orientable unit clauses  : 6
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 24088
# Current number of unprocessed clauses: 333278
# ...number of literals in the above   : 1453641
# Current number of archived formulas  : 0
# Current number of archived clauses   : 19
# Clause-clause subsumption calls (NU) : 186484804
# Rec. Clause-clause subsumption calls : 148329729
# Non-unit clause-clause subsumptions  : 9772
# Unit Clause-clause subsumption calls : 4
# 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          : 21444859
# No success with AutoSched1
# Trying AutoSched2 for 23 seconds
# AutoSched2-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S08CI
# and selection function SelectCQIPrecWNTNp.
#
# Preprocessing time       : 0.018 s
# Presaturation interreduction done

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t14_number15, conjecture, ![X1]:(v7_ordinal1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>![X4]:(v1_int_1(X4)=>![X5]:(v1_int_1(X5)=>(X1!=X2=>r1_xboole_0(k1_number15(X3,X4,X1),k1_number15(X3,X4,X2)))))))), file('number15/number15__t14_number15', t14_number15)).
fof(t3_xboole_0, axiom, ![X1, X2]:(~((~(r1_xboole_0(X1,X2))&![X3]:~((r2_hidden(X3,X1)&r2_hidden(X3,X2)))))&~((?[X3]:(r2_hidden(X3,X1)&r2_hidden(X3,X2))&r1_xboole_0(X1,X2)))), file('number15/number15__t14_number15', t3_xboole_0)).
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__t14_number15', t4_subset)).
fof(dt_k1_number15, axiom, ![X1, X2, X3]:(((v1_int_1(X1)&v1_int_1(X2))&v1_int_1(X3))=>m1_subset_1(k1_number15(X1,X2,X3),k1_zfmisc_1(k4_ordinal1))), file('number15/number15__t14_number15', dt_k1_number15)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('number15/number15__t14_number15', redefinition_r2_tarski)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number15/number15__t14_number15', cc2_int_1)).
fof(t12_number15, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>![X4]:(v1_int_1(X4)=>(r2_tarski(X1,k1_number15(X2,X3,X4))<=>(k5_int_1(X1,X3)=X4&r1_int_1(X1,X2))))))), file('number15/number15__t14_number15', t12_number15)).
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('number15/number15__t14_number15', cc8_ordinal1)).
fof(c_0_8, negated_conjecture, ~(![X1]:(v7_ordinal1(X1)=>![X2]:(v1_int_1(X2)=>![X3]:(v1_int_1(X3)=>![X4]:(v1_int_1(X4)=>![X5]:(v1_int_1(X5)=>(X1!=X2=>r1_xboole_0(k1_number15(X3,X4,X1),k1_number15(X3,X4,X2))))))))), inference(assume_negation,[status(cth)],[t14_number15])).
fof(c_0_9, plain, ![X1, X2]:(~((~r1_xboole_0(X1,X2)&![X3]:~((r2_hidden(X3,X1)&r2_hidden(X3,X2)))))&~((?[X3]:(r2_hidden(X3,X1)&r2_hidden(X3,X2))&r1_xboole_0(X1,X2)))), inference(fof_simplification,[status(thm)],[t3_xboole_0])).
fof(c_0_10, negated_conjecture, (v7_ordinal1(esk1_0)&(v1_int_1(esk2_0)&(v1_int_1(esk3_0)&(v1_int_1(esk4_0)&(v1_int_1(esk5_0)&(esk1_0!=esk2_0&~r1_xboole_0(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])).
fof(c_0_11, plain, ![X45, X46, X48, X49, X50]:(((r2_hidden(esk6_2(X45,X46),X45)|r1_xboole_0(X45,X46))&(r2_hidden(esk6_2(X45,X46),X46)|r1_xboole_0(X45,X46)))&(~r2_hidden(X50,X48)|~r2_hidden(X50,X49)|~r1_xboole_0(X48,X49))), 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)],[c_0_9])])])])])])).
fof(c_0_12, plain, ![X51, X52, X53]:(~r2_tarski(X51,X52)|~m1_subset_1(X52,k1_zfmisc_1(X53))|m1_subset_1(X51,X53)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])).
fof(c_0_13, plain, ![X36, X37, X38]:(~v1_int_1(X36)|~v1_int_1(X37)|~v1_int_1(X38)|m1_subset_1(k1_number15(X36,X37,X38),k1_zfmisc_1(k4_ordinal1))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_number15])])).
fof(c_0_14, plain, ![X39, X40]:((~r2_tarski(X39,X40)|r2_hidden(X39,X40))&(~r2_hidden(X39,X40)|r2_tarski(X39,X40))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
cnf(c_0_15, negated_conjecture, (~r1_xboole_0(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0))), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_16, plain, (r2_hidden(esk6_2(X1,X2),X2)|r1_xboole_0(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
cnf(c_0_17, plain, (r2_hidden(esk6_2(X1,X2),X1)|r1_xboole_0(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_11])).
fof(c_0_18, plain, ![X34]:(~v7_ordinal1(X34)|v1_int_1(X34)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_19, 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_12])).
cnf(c_0_20, plain, (m1_subset_1(k1_number15(X1,X2,X3),k1_zfmisc_1(k4_ordinal1))|~v1_int_1(X1)|~v1_int_1(X2)|~v1_int_1(X3)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_21, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_22, negated_conjecture, (r2_hidden(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)),k1_number15(esk3_0,esk4_0,esk2_0))), inference(spm,[status(thm)],[c_0_15, c_0_16])).
fof(c_0_23, plain, ![X41, X42, X43, X44]:(((k5_int_1(X41,X43)=X44|~r2_tarski(X41,k1_number15(X42,X43,X44))|~v1_int_1(X44)|~v1_int_1(X43)|~v1_int_1(X42)|~v7_ordinal1(X41))&(r1_int_1(X41,X42)|~r2_tarski(X41,k1_number15(X42,X43,X44))|~v1_int_1(X44)|~v1_int_1(X43)|~v1_int_1(X42)|~v7_ordinal1(X41)))&(k5_int_1(X41,X43)!=X44|~r1_int_1(X41,X42)|r2_tarski(X41,k1_number15(X42,X43,X44))|~v1_int_1(X44)|~v1_int_1(X43)|~v1_int_1(X42)|~v7_ordinal1(X41))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_number15])])])])).
cnf(c_0_24, negated_conjecture, (r2_hidden(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)),k1_number15(esk3_0,esk4_0,esk1_0))), inference(spm,[status(thm)],[c_0_15, c_0_17])).
cnf(c_0_25, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_26, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
fof(c_0_27, plain, ![X35]:(~m1_subset_1(X35,k4_ordinal1)|v7_ordinal1(X35)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
cnf(c_0_28, plain, (m1_subset_1(X1,k4_ordinal1)|~r2_tarski(X1,k1_number15(X2,X3,X4))|~v1_int_1(X4)|~v1_int_1(X3)|~v1_int_1(X2)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_29, negated_conjecture, (r2_tarski(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)),k1_number15(esk3_0,esk4_0,esk2_0))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
cnf(c_0_30, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_31, negated_conjecture, (v1_int_1(esk4_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_32, negated_conjecture, (v1_int_1(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_33, plain, (k5_int_1(X1,X2)=X3|~r2_tarski(X1,k1_number15(X4,X2,X3))|~v1_int_1(X3)|~v1_int_1(X2)|~v1_int_1(X4)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_34, negated_conjecture, (r2_tarski(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)),k1_number15(esk3_0,esk4_0,esk1_0))), inference(spm,[status(thm)],[c_0_21, c_0_24])).
cnf(c_0_35, negated_conjecture, (v1_int_1(esk1_0)), inference(spm,[status(thm)],[c_0_25, c_0_26])).
cnf(c_0_36, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_37, negated_conjecture, (m1_subset_1(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)),k4_ordinal1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_30]), c_0_31]), c_0_32])])).
cnf(c_0_38, negated_conjecture, (k5_int_1(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)),esk4_0)=esk1_0|~v7_ordinal1(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_32]), c_0_35]), c_0_31])])).
cnf(c_0_39, negated_conjecture, (v7_ordinal1(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)))), inference(spm,[status(thm)],[c_0_36, c_0_37])).
cnf(c_0_40, negated_conjecture, (k5_int_1(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)),esk4_0)=esk2_0|~v7_ordinal1(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_29]), c_0_32]), c_0_30]), c_0_31])])).
cnf(c_0_41, negated_conjecture, (k5_int_1(esk6_2(k1_number15(esk3_0,esk4_0,esk1_0),k1_number15(esk3_0,esk4_0,esk2_0)),esk4_0)=esk1_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38, c_0_39])])).
cnf(c_0_42, negated_conjecture, (esk1_0!=esk2_0), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_43, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_39])]), c_0_41]), c_0_42]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 44
# Proof object clause steps            : 26
# Proof object formula steps           : 18
# Proof object conjectures             : 20
# Proof object clause conjectures      : 17
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 14
# Proof object initial formulas used   : 8
# Proof object generating inferences   : 10
# Proof object simplifying inferences  : 18
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 19
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 19
# Processed clauses                    : 81
# ...of these trivial                  : 1
# ...subsumed                          : 1
# ...remaining for further processing  : 78
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 5
# Generated clauses                    : 67
# ...of the previous two non-trivial   : 56
# Contextual simplify-reflections      : 0
# Paramodulations                      : 66
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 1
# 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  : 53
#    Positive orientable unit clauses  : 25
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 26
# Current number of unprocessed clauses: 13
# ...number of literals in the above   : 20
# Current number of archived formulas  : 0
# Current number of archived clauses   : 24
# Clause-clause subsumption calls (NU) : 146
# Rec. Clause-clause subsumption calls : 130
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 9
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 41
# BW rewrite match successes           : 2
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 3197

# -------------------------------------------------
# User time                : 230.568 s
# System time              : 1.508 s
# Total time               : 232.076 s
# Maximum resident set size: 3552 pages
