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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(t76_number15, conjecture, ![X1]:(v7_ordinal1(X1)=>![X2]:(v1_int_1(X2)=>(X1!=k5_numbers=>r1_int_2(k4_int_1(X2,k3_int_2(X2,X1)),k3_nat_d(X1,k3_int_2(X2,X1)))))), file('number15/number15__t76_number15', t76_number15)).
fof(t14_ring_3, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:(v1_int_1(X2)=>(X1!=k5_numbers=>k3_int_2(k4_int_1(X2,k3_int_2(X2,X1)),k3_nat_d(X1,k3_int_2(X2,X1)))=np__1))), file('number15/number15__t76_number15', t14_ring_3)).
fof(d3_int_2, axiom, ![X1]:(v1_int_1(X1)=>![X2]:(v1_int_1(X2)=>(r1_int_2(X1,X2)<=>k3_int_2(X1,X2)=np__1))), file('number15/number15__t76_number15', d3_int_2)).
fof(redefinition_k3_nat_d, axiom, ![X1, X2]:((v7_ordinal1(X1)&v7_ordinal1(X2))=>k3_nat_d(X1,X2)=k4_int_1(X1,X2)), file('number15/number15__t76_number15', redefinition_k3_nat_d)).
fof(dt_k4_int_1, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>v1_int_1(k4_int_1(X1,X2))), file('number15/number15__t76_number15', dt_k4_int_1)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('number15/number15__t76_number15', cc2_int_1)).
fof(dt_k3_int_2, axiom, ![X1, X2]:((v1_int_1(X1)&v1_int_1(X2))=>v7_ordinal1(k3_int_2(X1,X2))), file('number15/number15__t76_number15', dt_k3_int_2)).
fof(c_0_7, negated_conjecture, ~(![X1]:(v7_ordinal1(X1)=>![X2]:(v1_int_1(X2)=>(X1!=k5_numbers=>r1_int_2(k4_int_1(X2,k3_int_2(X2,X1)),k3_nat_d(X1,k3_int_2(X2,X1))))))), inference(assume_negation,[status(cth)],[t76_number15])).
fof(c_0_8, plain, ![X27, X28]:(~v7_ordinal1(X27)|(~v1_int_1(X28)|(X27=k5_numbers|k3_int_2(k4_int_1(X28,k3_int_2(X28,X27)),k3_nat_d(X27,k3_int_2(X28,X27)))=np__1))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t14_ring_3])])])).
fof(c_0_9, negated_conjecture, (v7_ordinal1(esk1_0)&(v1_int_1(esk2_0)&(esk1_0!=k5_numbers&~r1_int_2(k4_int_1(esk2_0,k3_int_2(esk2_0,esk1_0)),k3_nat_d(esk1_0,k3_int_2(esk2_0,esk1_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])).
fof(c_0_10, plain, ![X25, X26]:((~r1_int_2(X25,X26)|k3_int_2(X25,X26)=np__1|~v1_int_1(X26)|~v1_int_1(X25))&(k3_int_2(X25,X26)!=np__1|r1_int_2(X25,X26)|~v1_int_1(X26)|~v1_int_1(X25))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_int_2])])])])).
cnf(c_0_11, plain, (X1=k5_numbers|k3_int_2(k4_int_1(X2,k3_int_2(X2,X1)),k3_nat_d(X1,k3_int_2(X2,X1)))=np__1|~v7_ordinal1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_8])).
cnf(c_0_12, negated_conjecture, (v1_int_1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_13, negated_conjecture, (~r1_int_2(k4_int_1(esk2_0,k3_int_2(esk2_0,esk1_0)),k3_nat_d(esk1_0,k3_int_2(esk2_0,esk1_0)))), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_14, plain, (r1_int_2(X1,X2)|k3_int_2(X1,X2)!=np__1|~v1_int_1(X2)|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_10])).
cnf(c_0_15, negated_conjecture, (k3_int_2(k4_int_1(esk2_0,k3_int_2(esk2_0,X1)),k3_nat_d(X1,k3_int_2(esk2_0,X1)))=np__1|X1=k5_numbers|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_11, c_0_12])).
cnf(c_0_16, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_17, negated_conjecture, (esk1_0!=k5_numbers), inference(split_conjunct,[status(thm)],[c_0_9])).
cnf(c_0_18, negated_conjecture, (k3_int_2(k4_int_1(esk2_0,k3_int_2(esk2_0,esk1_0)),k3_nat_d(esk1_0,k3_int_2(esk2_0,esk1_0)))!=np__1|~v1_int_1(k3_nat_d(esk1_0,k3_int_2(esk2_0,esk1_0)))|~v1_int_1(k4_int_1(esk2_0,k3_int_2(esk2_0,esk1_0)))), inference(spm,[status(thm)],[c_0_13, c_0_14])).
cnf(c_0_19, negated_conjecture, (k3_int_2(k4_int_1(esk2_0,k3_int_2(esk2_0,esk1_0)),k3_nat_d(esk1_0,k3_int_2(esk2_0,esk1_0)))=np__1), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
fof(c_0_20, plain, ![X18, X19]:(~v7_ordinal1(X18)|~v7_ordinal1(X19)|k3_nat_d(X18,X19)=k4_int_1(X18,X19)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k3_nat_d])])).
cnf(c_0_21, negated_conjecture, (~v1_int_1(k3_nat_d(esk1_0,k3_int_2(esk2_0,esk1_0)))|~v1_int_1(k4_int_1(esk2_0,k3_int_2(esk2_0,esk1_0)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_19])])).
cnf(c_0_22, plain, (k3_nat_d(X1,X2)=k4_int_1(X1,X2)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_20])).
fof(c_0_23, plain, ![X22, X23]:(~v1_int_1(X22)|~v1_int_1(X23)|v1_int_1(k4_int_1(X22,X23))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_int_1])])).
fof(c_0_24, plain, ![X24]:(~v7_ordinal1(X24)|v1_int_1(X24)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_25, negated_conjecture, (~v1_int_1(k4_int_1(esk1_0,k3_int_2(esk2_0,esk1_0)))|~v1_int_1(k4_int_1(esk2_0,k3_int_2(esk2_0,esk1_0)))|~v7_ordinal1(k3_int_2(esk2_0,esk1_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_16])])).
cnf(c_0_26, plain, (v1_int_1(k4_int_1(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_27, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_24])).
cnf(c_0_28, negated_conjecture, (~v1_int_1(k4_int_1(esk1_0,k3_int_2(esk2_0,esk1_0)))|~v7_ordinal1(k3_int_2(esk2_0,esk1_0))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_26]), c_0_12])]), c_0_27])).
cnf(c_0_29, negated_conjecture, (v1_int_1(esk1_0)), inference(spm,[status(thm)],[c_0_27, c_0_16])).
fof(c_0_30, plain, ![X20, X21]:(~v1_int_1(X20)|~v1_int_1(X21)|v7_ordinal1(k3_int_2(X20,X21))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_int_2])])).
cnf(c_0_31, negated_conjecture, (~v7_ordinal1(k3_int_2(esk2_0,esk1_0))), inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_26]), c_0_29])]), c_0_27])).
cnf(c_0_32, plain, (v7_ordinal1(k3_int_2(X1,X2))|~v1_int_1(X1)|~v1_int_1(X2)), inference(split_conjunct,[status(thm)],[c_0_30])).
cnf(c_0_33, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_32]), c_0_29]), c_0_12])]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 34
# Proof object clause steps            : 19
# Proof object formula steps           : 15
# Proof object conjectures             : 16
# Proof object clause conjectures      : 13
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 10
# Proof object initial formulas used   : 7
# Proof object generating inferences   : 8
# Proof object simplifying inferences  : 14
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 8
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 12
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 12
# Processed clauses                    : 37
# ...of these trivial                  : 0
# ...subsumed                          : 2
# ...remaining for further processing  : 35
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 2
# Backward-rewritten                   : 1
# Generated clauses                    : 20
# ...of the previous two non-trivial   : 19
# Contextual simplify-reflections      : 2
# Paramodulations                      : 20
# 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  : 20
#    Positive orientable unit clauses  : 5
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 12
# Current number of unprocessed clauses: 6
# ...number of literals in the above   : 22
# Current number of archived formulas  : 0
# Current number of archived clauses   : 15
# Clause-clause subsumption calls (NU) : 25
# Rec. Clause-clause subsumption calls : 18
# Non-unit clause-clause subsumptions  : 6
# Unit Clause-clause subsumption calls : 6
# 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          : 1308

# -------------------------------------------------
# User time                : 0.017 s
# System time              : 0.004 s
# Total time               : 0.021 s
# Maximum resident set size: 3716 pages
