# 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(cc5_int_1, axiom, ![X1]:(v2_int_1(X1)=>v1_int_1(X1)), file('number14/number14__t66_number14', cc5_int_1)).
fof(d16_number14, axiom, ![X1]:(v1_int_1(X1)=>k7_number14(X1)=a_1_0_number14(X1)), file('number14/number14__t66_number14', d16_number14)).
fof(fc6_int_1, axiom, v2_int_1(k4_xcmplx_0(np__1)), file('number14/number14__t66_number14', fc6_int_1)).
fof(dt_k7_number14, axiom, ![X1]:(v1_int_1(X1)=>m1_subset_1(k7_number14(X1),k1_zfmisc_1(k4_numbers))), file('number14/number14__t66_number14', dt_k7_number14)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('number14/number14__t66_number14', redefinition_r2_tarski)).
fof(d3_tarski, axiom, ![X1, X2]:(r1_tarski(X1,X2)<=>![X3]:(r2_hidden(X3,X1)=>r2_hidden(X3,X2))), file('number14/number14__t66_number14', d3_tarski)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('number14/number14__t66_number14', t3_subset)).
fof(t66_number14, conjecture, k7_number14(k4_xcmplx_0(np__1))=k4_numbers, file('number14/number14__t66_number14', t66_number14)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('number14/number14__t66_number14', t1_subset)).
fof(d10_xboole_0, axiom, ![X1, X2]:(X1=X2<=>(r1_tarski(X1,X2)&r1_tarski(X2,X1))), file('number14/number14__t66_number14', d10_xboole_0)).
fof(cc1_int_1, axiom, ![X1]:(m1_subset_1(X1,k4_numbers)=>v1_int_1(X1)), file('number14/number14__t66_number14', cc1_int_1)).
fof(fraenkel_a_1_0_number14, axiom, ![X1, X2]:(v1_int_1(X2)=>(r2_hidden(X1,a_1_0_number14(X2))<=>?[X3]:(m3_number14(X3,X2)&X1=X3))), file('number14/number14__t66_number14', fraenkel_a_1_0_number14)).
fof(d15_number14, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(m3_number14(X2,X1)<=>r1_int_1(X1,X2)))), file('number14/number14__t66_number14', d15_number14)).
fof(t12_int_2, axiom, ![X1]:(v1_int_1(X1)=>((r1_int_1(X1,k5_numbers)&r1_int_1(np__1,X1))&r1_int_1(k4_xcmplx_0(np__1),X1))), file('number14/number14__t66_number14', t12_int_2)).
fof(c_0_14, plain, ![X26]:(~v2_int_1(X26)|v1_int_1(X26)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc5_int_1])])).
fof(c_0_15, plain, ![X31]:(~v1_int_1(X31)|k7_number14(X31)=a_1_0_number14(X31)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_number14])])).
cnf(c_0_16, plain, (v1_int_1(X1)|~v2_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_17, plain, (v2_int_1(k4_xcmplx_0(np__1))), inference(split_conjunct,[status(thm)],[fc6_int_1])).
fof(c_0_18, plain, ![X38]:(~v1_int_1(X38)|m1_subset_1(k7_number14(X38),k1_zfmisc_1(k4_numbers))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_number14])])).
cnf(c_0_19, plain, (k7_number14(X1)=a_1_0_number14(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, plain, (v1_int_1(k4_xcmplx_0(np__1))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
fof(c_0_21, plain, ![X43, X44]:((~r2_tarski(X43,X44)|r2_hidden(X43,X44))&(~r2_hidden(X43,X44)|r2_tarski(X43,X44))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
fof(c_0_22, plain, ![X32, X33, X34, X35, X36]:((~r1_tarski(X32,X33)|(~r2_hidden(X34,X32)|r2_hidden(X34,X33)))&((r2_hidden(esk1_2(X35,X36),X35)|r1_tarski(X35,X36))&(~r2_hidden(esk1_2(X35,X36),X36)|r1_tarski(X35,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)],[d3_tarski])])])])])])).
fof(c_0_23, plain, ![X48, X49]:((~m1_subset_1(X48,k1_zfmisc_1(X49))|r1_tarski(X48,X49))&(~r1_tarski(X48,X49)|m1_subset_1(X48,k1_zfmisc_1(X49)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
cnf(c_0_24, plain, (m1_subset_1(k7_number14(X1),k1_zfmisc_1(k4_numbers))|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_25, plain, (k7_number14(k4_xcmplx_0(np__1))=a_1_0_number14(k4_xcmplx_0(np__1))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
fof(c_0_26, negated_conjecture, k7_number14(k4_xcmplx_0(np__1))!=k4_numbers, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t66_number14])])).
fof(c_0_27, plain, ![X46, X47]:(~r2_tarski(X46,X47)|m1_subset_1(X46,X47)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
cnf(c_0_28, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_29, plain, (r2_hidden(esk1_2(X1,X2),X1)|r1_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_22])).
fof(c_0_30, plain, ![X27, X28]:(((r1_tarski(X27,X28)|X27!=X28)&(r1_tarski(X28,X27)|X27!=X28))&(~r1_tarski(X27,X28)|~r1_tarski(X28,X27)|X27=X28)), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])).
cnf(c_0_31, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2))), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_32, plain, (m1_subset_1(a_1_0_number14(k4_xcmplx_0(np__1)),k1_zfmisc_1(k4_numbers))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24, c_0_20]), c_0_25])).
cnf(c_0_33, negated_conjecture, (k7_number14(k4_xcmplx_0(np__1))!=k4_numbers), inference(split_conjunct,[status(thm)],[c_0_26])).
fof(c_0_34, plain, ![X25]:(~m1_subset_1(X25,k4_numbers)|v1_int_1(X25)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_int_1])])).
cnf(c_0_35, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_27])).
cnf(c_0_36, plain, (r2_tarski(esk1_2(X1,X2),X1)|r1_tarski(X1,X2)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
cnf(c_0_37, plain, (X1=X2|~r1_tarski(X1,X2)|~r1_tarski(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_38, plain, (r1_tarski(a_1_0_number14(k4_xcmplx_0(np__1)),k4_numbers)), inference(spm,[status(thm)],[c_0_31, c_0_32])).
cnf(c_0_39, negated_conjecture, (a_1_0_number14(k4_xcmplx_0(np__1))!=k4_numbers), inference(rw,[status(thm)],[c_0_33, c_0_25])).
cnf(c_0_40, plain, (v1_int_1(X1)|~m1_subset_1(X1,k4_numbers)), inference(split_conjunct,[status(thm)],[c_0_34])).
cnf(c_0_41, plain, (r1_tarski(X1,X2)|m1_subset_1(esk1_2(X1,X2),X1)), inference(spm,[status(thm)],[c_0_35, c_0_36])).
fof(c_0_42, plain, ![X39, X40, X42]:(((m3_number14(esk2_2(X39,X40),X40)|~r2_hidden(X39,a_1_0_number14(X40))|~v1_int_1(X40))&(X39=esk2_2(X39,X40)|~r2_hidden(X39,a_1_0_number14(X40))|~v1_int_1(X40)))&(~m3_number14(X42,X40)|X39!=X42|r2_hidden(X39,a_1_0_number14(X40))|~v1_int_1(X40))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fraenkel_a_1_0_number14])])])])])).
fof(c_0_43, plain, ![X29, X30]:((~m3_number14(X30,X29)|r1_int_1(X29,X30)|~v1_int_1(X30)|~v1_int_1(X29))&(~r1_int_1(X29,X30)|m3_number14(X30,X29)|~v1_int_1(X30)|~v1_int_1(X29))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d15_number14])])])])).
cnf(c_0_44, plain, (~r1_tarski(k4_numbers,a_1_0_number14(k4_xcmplx_0(np__1)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37, c_0_38]), c_0_39])).
cnf(c_0_45, plain, (r1_tarski(k4_numbers,X1)|v1_int_1(esk1_2(k4_numbers,X1))), inference(spm,[status(thm)],[c_0_40, c_0_41])).
fof(c_0_46, plain, ![X45]:(((r1_int_1(X45,k5_numbers)|~v1_int_1(X45))&(r1_int_1(np__1,X45)|~v1_int_1(X45)))&(r1_int_1(k4_xcmplx_0(np__1),X45)|~v1_int_1(X45))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_int_2])])])).
cnf(c_0_47, plain, (r2_hidden(X3,a_1_0_number14(X2))|~m3_number14(X1,X2)|X3!=X1|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_42])).
cnf(c_0_48, plain, (m3_number14(X2,X1)|~r1_int_1(X1,X2)|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_43])).
cnf(c_0_49, plain, (v1_int_1(esk1_2(k4_numbers,a_1_0_number14(k4_xcmplx_0(np__1))))), inference(spm,[status(thm)],[c_0_44, c_0_45])).
cnf(c_0_50, plain, (r1_int_1(k4_xcmplx_0(np__1),X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_46])).
cnf(c_0_51, plain, (r2_hidden(X1,a_1_0_number14(X2))|~m3_number14(X1,X2)|~v1_int_1(X2)), inference(er,[status(thm)],[c_0_47])).
cnf(c_0_52, plain, (m3_number14(esk1_2(k4_numbers,a_1_0_number14(k4_xcmplx_0(np__1))),X1)|~r1_int_1(X1,esk1_2(k4_numbers,a_1_0_number14(k4_xcmplx_0(np__1))))|~v1_int_1(X1)), inference(spm,[status(thm)],[c_0_48, c_0_49])).
cnf(c_0_53, plain, (r1_int_1(k4_xcmplx_0(np__1),esk1_2(k4_numbers,a_1_0_number14(k4_xcmplx_0(np__1))))), inference(spm,[status(thm)],[c_0_50, c_0_49])).
cnf(c_0_54, plain, (r2_hidden(X1,a_1_0_number14(k4_xcmplx_0(np__1)))|~m3_number14(X1,k4_xcmplx_0(np__1))), inference(spm,[status(thm)],[c_0_51, c_0_20])).
cnf(c_0_55, plain, (m3_number14(esk1_2(k4_numbers,a_1_0_number14(k4_xcmplx_0(np__1))),k4_xcmplx_0(np__1))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52, c_0_20]), c_0_53])])).
cnf(c_0_56, plain, (r1_tarski(X1,X2)|~r2_hidden(esk1_2(X1,X2),X2)), inference(split_conjunct,[status(thm)],[c_0_22])).
cnf(c_0_57, plain, (r2_hidden(esk1_2(k4_numbers,a_1_0_number14(k4_xcmplx_0(np__1))),a_1_0_number14(k4_xcmplx_0(np__1)))), inference(spm,[status(thm)],[c_0_54, c_0_55])).
cnf(c_0_58, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_56, c_0_57]), c_0_44]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 59
# Proof object clause steps            : 32
# Proof object formula steps           : 27
# Proof object conjectures             : 4
# Proof object clause conjectures      : 2
# Proof object formula conjectures     : 2
# Proof object initial clauses used    : 15
# Proof object initial formulas used   : 14
# Proof object generating inferences   : 15
# Proof object simplifying inferences  : 7
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 14
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 25
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 25
# Processed clauses                    : 93
# ...of these trivial                  : 0
# ...subsumed                          : 1
# ...remaining for further processing  : 92
# Other redundant clauses eliminated   : 3
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 1
# Generated clauses                    : 75
# ...of the previous two non-trivial   : 64
# Contextual simplify-reflections      : 0
# Paramodulations                      : 72
# Factorizations                       : 0
# NegExts                              : 0
# Equation resolutions                 : 3
# 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  : 64
#    Positive orientable unit clauses  : 27
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 2
#    Non-unit-clauses                  : 35
# Current number of unprocessed clauses: 17
# ...number of literals in the above   : 35
# Current number of archived formulas  : 0
# Current number of archived clauses   : 25
# Clause-clause subsumption calls (NU) : 132
# Rec. Clause-clause subsumption calls : 116
# Non-unit clause-clause subsumptions  : 1
# Unit Clause-clause subsumption calls : 15
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 4
# BW rewrite match successes           : 1
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 2776

# -------------------------------------------------
# User time                : 0.025 s
# System time              : 0.000 s
# Total time               : 0.025 s
# Maximum resident set size: 3608 pages
