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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t7_boole, axiom, ![X1, X2]:~((r2_tarski(X1,X2)&v1_xboole_0(X2))), file('number14/number14__t49_number14', t7_boole)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('number14/number14__t49_number14', redefinition_r2_tarski)).
fof(fraenkel_a_1_0_number12, axiom, ![X1, X2]:(v1_int_1(X2)=>(r2_hidden(X1,a_1_0_number12(X2))<=>?[X3]:(((v7_ordinal1(X3)&v1_int_2(X3))&X1=X3)&r1_int_1(X3,X2)))), file('number14/number14__t49_number14', fraenkel_a_1_0_number12)).
fof(t49_number14, conjecture, ![X1]:((v7_ordinal1(X1)&~(v8_ordinal1(X1)))=>(v1_xboole_0(k2_number12(X1))=>X1=np__1)), file('number14/number14__t49_number14', t49_number14)).
fof(d3_number12, axiom, ![X1]:(v1_int_1(X1)=>k2_number12(X1)=a_1_0_number12(X1)), file('number14/number14__t49_number14', d3_number12)).
fof(t5_moebius1, axiom, ![X1]:(v7_ordinal1(X1)=>~((X1!=np__1&![X2]:((v7_ordinal1(X2)&v1_int_2(X2))=>~(r1_nat_d(X2,X1)))))), file('number14/number14__t49_number14', t5_moebius1)).
fof(redefinition_r1_nat_d, axiom, ![X1, X2]:((v7_ordinal1(X1)&v7_ordinal1(X2))=>(r1_nat_d(X1,X2)<=>r1_int_1(X1,X2))), file('number14/number14__t49_number14', redefinition_r1_nat_d)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number14/number14__t49_number14', cc2_int_1)).
fof(c_0_8, plain, ![X31, X32]:(~r2_tarski(X31,X32)|~v1_xboole_0(X32)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])).
fof(c_0_9, plain, ![X27, X28]:((~r2_tarski(X27,X28)|r2_hidden(X27,X28))&(~r2_hidden(X27,X28)|r2_tarski(X27,X28))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
fof(c_0_10, plain, ![X21, X22, X24]:(((((v7_ordinal1(esk2_2(X21,X22))|~r2_hidden(X21,a_1_0_number12(X22))|~v1_int_1(X22))&(v1_int_2(esk2_2(X21,X22))|~r2_hidden(X21,a_1_0_number12(X22))|~v1_int_1(X22)))&(X21=esk2_2(X21,X22)|~r2_hidden(X21,a_1_0_number12(X22))|~v1_int_1(X22)))&(r1_int_1(esk2_2(X21,X22),X22)|~r2_hidden(X21,a_1_0_number12(X22))|~v1_int_1(X22)))&(~v7_ordinal1(X24)|~v1_int_2(X24)|X21!=X24|~r1_int_1(X24,X22)|r2_hidden(X21,a_1_0_number12(X22))|~v1_int_1(X22))), 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_number12])])])])])).
fof(c_0_11, negated_conjecture, ~(![X1]:((v7_ordinal1(X1)&~v8_ordinal1(X1))=>(v1_xboole_0(k2_number12(X1))=>X1=np__1))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t49_number14])])).
cnf(c_0_12, plain, (~r2_tarski(X1,X2)|~v1_xboole_0(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_13, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, plain, (r2_hidden(X2,a_1_0_number12(X3))|~v7_ordinal1(X1)|~v1_int_2(X1)|X2!=X1|~r1_int_1(X1,X3)|~v1_int_1(X3)), inference(split_conjunct,[status(thm)],[c_0_10])).
fof(c_0_15, negated_conjecture, ((v7_ordinal1(esk1_0)&~v8_ordinal1(esk1_0))&(v1_xboole_0(k2_number12(esk1_0))&esk1_0!=np__1)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])).
fof(c_0_16, plain, ![X20]:(~v1_int_1(X20)|k2_number12(X20)=a_1_0_number12(X20)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_number12])])).
cnf(c_0_17, plain, (~r2_hidden(X1,X2)|~v1_xboole_0(X2)), inference(spm,[status(thm)],[c_0_12, c_0_13])).
cnf(c_0_18, plain, (r2_hidden(X1,a_1_0_number12(X2))|~r1_int_1(X1,X2)|~v1_int_2(X1)|~v1_int_1(X2)|~v7_ordinal1(X1)), inference(er,[status(thm)],[c_0_14])).
cnf(c_0_19, negated_conjecture, (v1_xboole_0(k2_number12(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, plain, (k2_number12(X1)=a_1_0_number12(X1)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_16])).
fof(c_0_21, plain, ![X1]:(v7_ordinal1(X1)=>~((X1!=np__1&![X2]:((v7_ordinal1(X2)&v1_int_2(X2))=>~r1_nat_d(X2,X1))))), inference(fof_simplification,[status(thm)],[t5_moebius1])).
cnf(c_0_22, plain, (~r1_int_1(X1,X2)|~v1_int_2(X1)|~v1_int_1(X2)|~v1_xboole_0(a_1_0_number12(X2))|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_17, c_0_18])).
cnf(c_0_23, negated_conjecture, (v1_xboole_0(a_1_0_number12(esk1_0))|~v1_int_1(esk1_0)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
fof(c_0_24, plain, ![X29]:(((v7_ordinal1(esk3_1(X29))|X29=np__1|~v7_ordinal1(X29))&(v1_int_2(esk3_1(X29))|X29=np__1|~v7_ordinal1(X29)))&(r1_nat_d(esk3_1(X29),X29)|X29=np__1|~v7_ordinal1(X29))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])])).
fof(c_0_25, plain, ![X25, X26]:((~r1_nat_d(X25,X26)|r1_int_1(X25,X26)|(~v7_ordinal1(X25)|~v7_ordinal1(X26)))&(~r1_int_1(X25,X26)|r1_nat_d(X25,X26)|(~v7_ordinal1(X25)|~v7_ordinal1(X26)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_nat_d])])])).
cnf(c_0_26, negated_conjecture, (~r1_int_1(X1,esk1_0)|~v1_int_2(X1)|~v1_int_1(esk1_0)|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_22, c_0_23])).
cnf(c_0_27, plain, (v1_int_2(esk3_1(X1))|X1=np__1|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_28, plain, (v7_ordinal1(esk3_1(X1))|X1=np__1|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_29, plain, (r1_int_1(X1,X2)|~r1_nat_d(X1,X2)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_30, plain, (r1_nat_d(esk3_1(X1),X1)|X1=np__1|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_31, negated_conjecture, (X1=np__1|~r1_int_1(esk3_1(X1),esk1_0)|~v1_int_1(esk1_0)|~v7_ordinal1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])).
cnf(c_0_32, plain, (X1=np__1|r1_int_1(esk3_1(X1),X1)|~v7_ordinal1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29, c_0_30]), c_0_28])).
cnf(c_0_33, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_34, negated_conjecture, (esk1_0!=np__1), inference(split_conjunct,[status(thm)],[c_0_15])).
fof(c_0_35, plain, ![X19]:(~v7_ordinal1(X19)|v1_int_1(X19)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_36, negated_conjecture, (~v1_int_1(esk1_0)), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_33])]), c_0_34])).
cnf(c_0_37, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_35])).
cnf(c_0_38, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_33])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 39
# Proof object clause steps            : 21
# Proof object formula steps           : 18
# Proof object conjectures             : 11
# Proof object clause conjectures      : 8
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 12
# Proof object initial formulas used   : 8
# Proof object generating inferences   : 8
# Proof object simplifying inferences  : 8
# 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                    : 29
# ...of these trivial                  : 0
# ...subsumed                          : 0
# ...remaining for further processing  : 29
# Other redundant clauses eliminated   : 1
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 0
# Backward-rewritten                   : 0
# Generated clauses                    : 16
# ...of the previous two non-trivial   : 13
# Contextual simplify-reflections      : 2
# Paramodulations                      : 15
# 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  : 28
#    Positive orientable unit clauses  : 2
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 23
# Current number of unprocessed clauses: 3
# ...number of literals in the above   : 16
# Current number of archived formulas  : 0
# Current number of archived clauses   : 0
# Clause-clause subsumption calls (NU) : 174
# Rec. Clause-clause subsumption calls : 67
# Non-unit clause-clause subsumptions  : 2
# Unit Clause-clause subsumption calls : 13
# 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          : 1506

# -------------------------------------------------
# User time                : 0.020 s
# System time              : 0.004 s
# Total time               : 0.024 s
# Maximum resident set size: 2868 pages
