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

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(cc8_ordinal1, axiom, ![X1]:(m1_subset_1(X1,k4_ordinal1)=>v7_ordinal1(X1)), file('newton07/newton07__t27_newton07', cc8_ordinal1)).
fof(dt_k4_newton, axiom, ![X1, X2]:((v7_ordinal1(X1)&v7_ordinal1(X2))=>m1_subset_1(k4_newton(X1,X2),k4_ordinal1)), file('newton07/newton07__t27_newton07', dt_k4_newton)).
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('newton07/newton07__t27_newton07', redefinition_r1_nat_d)).
fof(t119_newton02, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>(v1_int_2(X1)=>(X2=k5_numbers|X2=X1|r1_int_1(X1,k4_newton(X2,X1)))))), file('newton07/newton07__t27_newton07', t119_newton02)).
fof(t27_newton07, conjecture, ![X1]:((v7_ordinal1(X1)&v1_int_2(X1))=>![X2]:(v7_ordinal1(X2)=>(~(r1_nat_d(X1,X2))=>k4_nat_d(k4_newton(X2,X1),X1)=k5_numbers))), file('newton07/newton07__t27_newton07', t27_newton07)).
fof(t6_pepin, axiom, ![X1]:(v7_ordinal1(X1)=>![X2]:(v7_ordinal1(X2)=>(X1!=k5_numbers=>(r1_nat_d(X1,X2)<=>k4_nat_d(X2,X1)=k5_numbers)))), file('newton07/newton07__t27_newton07', t6_pepin)).
fof(rd6_newton02, axiom, ![X1]:(v1_int_1(X1)=>k5_int_1(k5_numbers,X1)=k5_numbers), file('newton07/newton07__t27_newton07', rd6_newton02)).
fof(cc2_int_1, axiom, ![X1]:(v7_ordinal1(X1)=>v1_int_1(X1)), file('newton07/newton07__t27_newton07', cc2_int_1)).
fof(reflexivity_r1_nat_d, axiom, ![X1, X2]:((v7_ordinal1(X1)&v7_ordinal1(X2))=>r1_nat_d(X1,X1)), file('newton07/newton07__t27_newton07', reflexivity_r1_nat_d)).
fof(cc11_ordinal1, axiom, ![X1]:(v8_ordinal1(X1)=>v7_ordinal1(X1)), file('newton07/newton07__t27_newton07', cc11_ordinal1)).
fof(fc9_ordinal1, axiom, v8_ordinal1(k5_ordinal1), file('newton07/newton07__t27_newton07', fc9_ordinal1)).
fof(redefinition_k5_numbers, axiom, k5_numbers=k5_ordinal1, file('newton07/newton07__t27_newton07', redefinition_k5_numbers)).
fof(cc1_nat_6, axiom, ![X1]:((v7_ordinal1(X1)&v1_int_2(X1))=>(~(v1_zfmisc_1(X1))&v7_ordinal1(X1))), file('newton07/newton07__t27_newton07', cc1_nat_6)).
fof(cc13_ordinal1, axiom, ![X1]:(~(v1_zfmisc_1(X1))=>~(v8_ordinal1(X1))), file('newton07/newton07__t27_newton07', cc13_ordinal1)).
fof(redefinition_k4_nat_d, axiom, ![X1, X2]:((v7_ordinal1(X1)&v7_ordinal1(X2))=>k4_nat_d(X1,X2)=k5_int_1(X1,X2)), file('newton07/newton07__t27_newton07', redefinition_k4_nat_d)).
fof(c_0_15, plain, ![X29]:(~m1_subset_1(X29,k4_ordinal1)|v7_ordinal1(X29)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc8_ordinal1])])).
fof(c_0_16, plain, ![X30, X31]:(~v7_ordinal1(X30)|~v7_ordinal1(X31)|m1_subset_1(k4_newton(X30,X31),k4_ordinal1)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_newton])])).
fof(c_0_17, plain, ![X35, X36]:((~r1_nat_d(X35,X36)|r1_int_1(X35,X36)|(~v7_ordinal1(X35)|~v7_ordinal1(X36)))&(~r1_int_1(X35,X36)|r1_nat_d(X35,X36)|(~v7_ordinal1(X35)|~v7_ordinal1(X36)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r1_nat_d])])])).
fof(c_0_18, plain, ![X39, X40]:(~v7_ordinal1(X39)|(~v7_ordinal1(X40)|(~v1_int_2(X39)|(X40=k5_numbers|X40=X39|r1_int_1(X39,k4_newton(X40,X39)))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t119_newton02])])])).
cnf(c_0_19, plain, (v7_ordinal1(X1)|~m1_subset_1(X1,k4_ordinal1)), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, plain, (m1_subset_1(k4_newton(X1,X2),k4_ordinal1)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_16])).
fof(c_0_21, negated_conjecture, ~(![X1]:((v7_ordinal1(X1)&v1_int_2(X1))=>![X2]:(v7_ordinal1(X2)=>(~r1_nat_d(X1,X2)=>k4_nat_d(k4_newton(X2,X1),X1)=k5_numbers)))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t27_newton07])])).
cnf(c_0_22, plain, (r1_nat_d(X1,X2)|~r1_int_1(X1,X2)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_17])).
cnf(c_0_23, plain, (X2=k5_numbers|X2=X1|r1_int_1(X1,k4_newton(X2,X1))|~v7_ordinal1(X1)|~v7_ordinal1(X2)|~v1_int_2(X1)), inference(split_conjunct,[status(thm)],[c_0_18])).
cnf(c_0_24, plain, (v7_ordinal1(k4_newton(X1,X2))|~v7_ordinal1(X2)|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_19, c_0_20])).
fof(c_0_25, negated_conjecture, ((v7_ordinal1(esk1_0)&v1_int_2(esk1_0))&(v7_ordinal1(esk2_0)&(~r1_nat_d(esk1_0,esk2_0)&k4_nat_d(k4_newton(esk2_0,esk1_0),esk1_0)!=k5_numbers))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])).
fof(c_0_26, plain, ![X41, X42]:((~r1_nat_d(X41,X42)|k4_nat_d(X42,X41)=k5_numbers|X41=k5_numbers|~v7_ordinal1(X42)|~v7_ordinal1(X41))&(k4_nat_d(X42,X41)!=k5_numbers|r1_nat_d(X41,X42)|X41=k5_numbers|~v7_ordinal1(X42)|~v7_ordinal1(X41))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_pepin])])])])).
cnf(c_0_27, plain, (X1=k5_numbers|X2=X1|r1_nat_d(X2,k4_newton(X1,X2))|~v1_int_2(X2)|~v7_ordinal1(X2)|~v7_ordinal1(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
cnf(c_0_28, negated_conjecture, (v1_int_2(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_29, negated_conjecture, (v7_ordinal1(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_30, plain, (k4_nat_d(X2,X1)=k5_numbers|X1=k5_numbers|~r1_nat_d(X1,X2)|~v7_ordinal1(X2)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_31, negated_conjecture, (esk1_0=X1|X1=k5_numbers|r1_nat_d(esk1_0,k4_newton(X1,esk1_0))|~v7_ordinal1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])])).
cnf(c_0_32, negated_conjecture, (k4_nat_d(k4_newton(X1,esk1_0),esk1_0)=k5_numbers|esk1_0=k5_numbers|X1=k5_numbers|esk1_0=X1|~v7_ordinal1(k4_newton(X1,esk1_0))|~v7_ordinal1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_31]), c_0_29])])).
cnf(c_0_33, negated_conjecture, (k4_nat_d(k4_newton(X1,esk1_0),esk1_0)=k5_numbers|esk1_0=k5_numbers|esk1_0=X1|X1=k5_numbers|~v7_ordinal1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_24]), c_0_29])])).
cnf(c_0_34, negated_conjecture, (v7_ordinal1(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_35, negated_conjecture, (k4_nat_d(k4_newton(esk2_0,esk1_0),esk1_0)!=k5_numbers), inference(split_conjunct,[status(thm)],[c_0_25])).
fof(c_0_36, plain, ![X32]:(~v1_int_1(X32)|k5_int_1(k5_numbers,X32)=k5_numbers), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rd6_newton02])])).
fof(c_0_37, plain, ![X28]:(~v7_ordinal1(X28)|v1_int_1(X28)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_int_1])])).
cnf(c_0_38, negated_conjecture, (~r1_nat_d(esk1_0,esk2_0)), inference(split_conjunct,[status(thm)],[c_0_25])).
cnf(c_0_39, negated_conjecture, (esk2_0=k5_numbers|esk2_0=esk1_0|esk1_0=k5_numbers), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35])).
fof(c_0_40, plain, ![X37, X38]:(~v7_ordinal1(X37)|~v7_ordinal1(X38)|r1_nat_d(X37,X37)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[reflexivity_r1_nat_d])])).
cnf(c_0_41, plain, (k5_int_1(k5_numbers,X1)=k5_numbers|~v1_int_1(X1)), inference(split_conjunct,[status(thm)],[c_0_36])).
cnf(c_0_42, plain, (v1_int_1(X1)|~v7_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_37])).
fof(c_0_43, plain, ![X25]:(~v8_ordinal1(X25)|v7_ordinal1(X25)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc11_ordinal1])])).
cnf(c_0_44, plain, (v8_ordinal1(k5_ordinal1)), inference(split_conjunct,[status(thm)],[fc9_ordinal1])).
cnf(c_0_45, plain, (k5_numbers=k5_ordinal1), inference(split_conjunct,[status(thm)],[redefinition_k5_numbers])).
fof(c_0_46, plain, ![X1]:((v7_ordinal1(X1)&v1_int_2(X1))=>(~v1_zfmisc_1(X1)&v7_ordinal1(X1))), inference(fof_simplification,[status(thm)],[cc1_nat_6])).
fof(c_0_47, plain, ![X1]:(~v1_zfmisc_1(X1)=>~v8_ordinal1(X1)), inference(fof_simplification,[status(thm)],[cc13_ordinal1])).
cnf(c_0_48, negated_conjecture, (esk1_0=k5_numbers|esk2_0=k5_numbers|~r1_nat_d(esk1_0,esk1_0)), inference(spm,[status(thm)],[c_0_38, c_0_39])).
cnf(c_0_49, plain, (r1_nat_d(X1,X1)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_40])).
fof(c_0_50, plain, ![X33, X34]:(~v7_ordinal1(X33)|~v7_ordinal1(X34)|k4_nat_d(X33,X34)=k5_int_1(X33,X34)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_nat_d])])).
cnf(c_0_51, plain, (k5_int_1(k5_numbers,X1)=k5_numbers|~v7_ordinal1(X1)), inference(spm,[status(thm)],[c_0_41, c_0_42])).
cnf(c_0_52, plain, (v7_ordinal1(X1)|~v8_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_43])).
cnf(c_0_53, plain, (v8_ordinal1(k5_numbers)), inference(rw,[status(thm)],[c_0_44, c_0_45])).
fof(c_0_54, plain, ![X27]:((~v1_zfmisc_1(X27)|(~v7_ordinal1(X27)|~v1_int_2(X27)))&(v7_ordinal1(X27)|(~v7_ordinal1(X27)|~v1_int_2(X27)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])])).
fof(c_0_55, plain, ![X26]:(v1_zfmisc_1(X26)|~v8_ordinal1(X26)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_47])])).
cnf(c_0_56, plain, (r1_nat_d(X2,X1)|X2=k5_numbers|k4_nat_d(X1,X2)!=k5_numbers|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_26])).
cnf(c_0_57, negated_conjecture, (esk2_0=k5_numbers|esk1_0=k5_numbers|~v7_ordinal1(X1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48, c_0_49]), c_0_29])])).
cnf(c_0_58, plain, (k4_nat_d(X1,X2)=k5_int_1(X1,X2)|~v7_ordinal1(X1)|~v7_ordinal1(X2)), inference(split_conjunct,[status(thm)],[c_0_50])).
cnf(c_0_59, negated_conjecture, (k5_int_1(k5_numbers,esk1_0)=k5_numbers), inference(spm,[status(thm)],[c_0_51, c_0_29])).
cnf(c_0_60, plain, (v7_ordinal1(k5_numbers)), inference(spm,[status(thm)],[c_0_52, c_0_53])).
cnf(c_0_61, plain, (~v1_zfmisc_1(X1)|~v7_ordinal1(X1)|~v1_int_2(X1)), inference(split_conjunct,[status(thm)],[c_0_54])).
cnf(c_0_62, plain, (v1_zfmisc_1(X1)|~v8_ordinal1(X1)), inference(split_conjunct,[status(thm)],[c_0_55])).
cnf(c_0_63, negated_conjecture, (esk1_0=k5_numbers|k4_nat_d(esk2_0,esk1_0)!=k5_numbers), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38, c_0_56]), c_0_29]), c_0_34])])).
cnf(c_0_64, negated_conjecture, (esk1_0=k5_numbers|esk2_0=k5_numbers), inference(spm,[status(thm)],[c_0_57, c_0_34])).
cnf(c_0_65, negated_conjecture, (k4_nat_d(k5_numbers,esk1_0)=k5_numbers), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58, c_0_59]), c_0_29]), c_0_60])])).
cnf(c_0_66, plain, (~v8_ordinal1(X1)|~v1_int_2(X1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_61, c_0_62]), c_0_52])).
cnf(c_0_67, negated_conjecture, (esk1_0=k5_numbers), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63, c_0_64]), c_0_65])])).
cnf(c_0_68, plain, (~v1_int_2(k5_numbers)), inference(spm,[status(thm)],[c_0_66, c_0_53])).
cnf(c_0_69, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_67]), c_0_68]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 70
# Proof object clause steps            : 39
# Proof object formula steps           : 31
# Proof object conjectures             : 20
# Proof object clause conjectures      : 17
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 20
# Proof object initial formulas used   : 15
# Proof object generating inferences   : 17
# Proof object simplifying inferences  : 22
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 15
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 22
# Removed in clause preprocessing      : 1
# Initial clauses in saturation        : 21
# Processed clauses                    : 649
# ...of these trivial                  : 127
# ...subsumed                          : 37
# ...remaining for further processing  : 485
# Other redundant clauses eliminated   : 0
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 7
# Backward-rewritten                   : 306
# Generated clauses                    : 1247
# ...of the previous two non-trivial   : 1046
# Contextual simplify-reflections      : 2
# Paramodulations                      : 1246
# Factorizations                       : 1
# 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  : 151
#    Positive orientable unit clauses  : 73
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 1
#    Non-unit-clauses                  : 77
# Current number of unprocessed clauses: 363
# ...number of literals in the above   : 1174
# Current number of archived formulas  : 0
# Current number of archived clauses   : 334
# Clause-clause subsumption calls (NU) : 4218
# Rec. Clause-clause subsumption calls : 3416
# Non-unit clause-clause subsumptions  : 46
# Unit Clause-clause subsumption calls : 466
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 1635
# BW rewrite match successes           : 80
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 30103

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